edX
edXData Structures and Algorithms
3k studentsINTERMEDIATEEnglish
Korshub's take
Algorithms & Data Structures: Competitive Edge
Choosing the right structure and algorithm separates efficient code from bottlenecks. This course visualizes both: linear structures (linked lists, arrays, stacks, queues) and hierarchical ones (binary trees, heaps, AVL trees). You'll implement self-balancing trees, master sorting and pattern-matching algorithms, and study graph traversal including Dijkstra's shortest path. Culminate with dynamic programming—the secret weapon for optimization problems.
About this course
Learn how to differentiate between linear data structures like linkedlists, arrays, arraylists, stacks, and queues, and select the correct structure for a given situation. Analyze data structure performance with the course visualization tool. ,Visualize and study nonlinear/hierarchical data structures such as Binary Trees, BSTs and Heaps. Examine tree operations & algorithms. Implement a HashMap that uses key-value pairs to store data. Explore probabilistic data structures like SkipLists. ,To differentiate between complex tree data structures, like AVL and (2-4) trees, understand their self-balancing techniques and implementations. Visualize and examine various Divide and Conquer sorting algorithms along with their performance. ,Analyze & implement various Pattern Matching algorithms from KMP to Rabin-Karp. Study essential graph traversal algorithms in order to implement Dijkstra’s Shortest Path, and construct Minimum Spanning Trees. Delve in Dynamic Programming.
Price
$756
No active coupon right now
View Course →Advertisement
