Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, priority queues, disjoint set unions, binary ...

Learn when and how to use different data structures and their algorithms in your own code. This is harder as a student, as the problem assignments you'll work through just won't impart this knowledge.

For example, the Heap is an implementation of the binary tree. Various low level data structures of the file system and databases would be a heap. This list just goes on ...

Specialization: Foundations of Data Structures and Algorithms Instructor: Dr. Sriram Sankaranarayanan, Professor of Computer Science Prior knowledge needed: You must understand all concepts covered in ...

Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, heaps, priority queues, disjoint set unions, ...