What you will learn:
- 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, & heaps. Examine tree operations & algorithms. Implement Hashmaps that use 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.
