Search result for Online Courses & Certifications
FollowFilter ![]()
Filter ![]()
Showing 103 courses
By Category ![]()
By Subject![]()
By Language![]()
By Duration![]()
By Price![]()
Get Course Alerts by Email
Data Structures and Algorithms (III)
by Junhui DENG- 0.0
-
![]()
![]()
![]()
![]()
![]()
Approx. 27 hours to complete
By learning this course, you will get a comprehensive grasp of hashing and typical balanced binary search trees, as well as their applications. 通过学习本课程，你将全面了解散列和典型的平衡二叉搜索树技术及其应用。 在本课程结束时，你将能够了解散列的原理，设计和实现用于实际问题的哈希表，了解并实现典型的平衡二叉搜索树，例如Splay树，红黑树以及B树，并使用BBST解决各种问题，例如范围查询。 第零章 写在选课之前 考核方式 课程教材与讲义 关于讨论区 微信平台 第八章 高级搜索树（上） 08-A1-1：宽松平衡 08-A1-2：局部性 08-A1-3：自适应调整 08-A1-4：逐层伸展 08-A1-5：实例 08-A1-6：一步一步往上爬 08-A1-7：最坏情况 08-A2-1：双层伸展 08-A2-2：子孙异侧 08-A2-3：子孙同侧 08-A2-4：点睛之笔 08-A2-5：折叠效果 08-A2-6：分摊性能 08-A2-7：最后一步 08-A3-1：功能接口 08-A3-2：伸展算法 08-A3-3：四种情况 08-A3-4：查找算法...
Computational Thinking for Problem Solving
by Susan Davidson- 4.7
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
Computational thinking is the process of approaching a problem in a systematic manner and creating and expressing a solution such that it can be carried out by a computer. But you don't need to be a computer scientist to think like a computer scientist! In fact, we encourage students from any field of study to take this course....
Build a Modern Computer from First Principles: From Nand to Tetris (Project-Centered Course)
by Shimon SchockenTop Instructor , Noam NisanTop Instructor- 4.9
-
![]()
![]()
![]()
![]()
![]()
Approx. 44 hours to complete
What you’ll achieve: In this project-centered course* you will build a modern computer system, from the ground up. We’ll divide this fascinating journey into six hands-on projects that will take you from constructing elementary logic gates all the way through creating a fully functioning general purpose computer. What you’ll need: Course format:...
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 17 hours to complete
The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts). Week 1 Why Study Algorithms? Integer Multiplication Karatsuba Multiplication About the Course Merge Sort: Motivation and Example...
Excel/VBA for Creative Problem Solving, Part 1
by Charlie NuttelmanTop Instructor- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 18 hours to complete
"Excel/VBA for Creative Problem Solving, Part 1" is aimed at learners who are seeking to augment, expand, optimize, and increase the efficiency of their Excel spreadsheet skills by tapping into the powerful programming, automation, and customization capabilities available with Visual Basic for Applications (VBA). New to computer programming? e. Macro recording, VBA procedures, and debugging...
Algorithmic Toolbox
by Alexander S. Kulikov , Michael Levin , Neil Rhodes , Pavel Pevzner , Daniel M Kane- 4.6
-
![]()
![]()
![]()
![]()
![]()
Approx. 39 hours to complete
The course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second). Programming Challenges Welcome!...
Discrete Optimization
by Professor Pascal Van Hentenryck , Dr. Carleton Coffrin- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 65 hours to complete
Tired of solving Sudokus by hand? This class teaches you how to solve complex search problems with discrete optimization concepts and algorithms, including constraint programming, local search, and mixed-integer programming. Optimization technology is ubiquitous in our society. Optimization clears the day-ahead and real-time markets to deliver electricity to millions of people....
Основы программирования на Python
by Густокашин Михаил Сергеевич- 4.5
-
![]()
![]()
![]()
![]()
![]()
Approx. 87 hours to complete
Язык программирования Python является одним из самых простых в освоении и популярных языков программирования. Целью курса является изучение основных конструкций языка Python, которые пригодятся при решении широкого круга задач – от анализа данных до разработки новых программных продуктов. Также слушатели познакомятся с основами различных парадигм программирования: процедурным, функциональным и объектно-ориентированным программированием....
Mathematical Thinking in Computer Science
by Alexander S. Kulikov , Michael Levin , Владимир Подольский- 4.4
-
![]()
![]()
![]()
![]()
![]()
Approx. 40 hours to complete
Mathematical thinking is crucial in all areas of computer science: algorithms, bioinformatics, computer graphics, data science, machine learning, etc. In this course, we will learn the most important tools used in discrete mathematics: induction, recursion, logic, invariants, examples, optimality. We will use these tools to answer typical programming questions like: How can we be certain a solution exists?...
Graph Search, Shortest Paths, and Data Structures
by Tim Roughgarden- 4.8
-
![]()
![]()
![]()
![]()
![]()
Approx. 15 hours to complete
The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis). Week 1 Graph Search - Overview Breadth-First Search (BFS): The Basics...
Previous
