Module | Week | Content | Materials |
---|---|---|---|
Introduction and Basic Data Structures
Visualising data structures and algorithms through animation http://visualgo.net |
Week I – Introduction |
|
|
Week II -Arrays and Dynamic Arrays |
|
|
|
Week III -Lists |
|
|
|
Week IV -Stacks and Queues I |
|
|
|
Binary Trees | Week V – Binary Trees |
|
|
First Exam | |||
Heaps and Priority Queues, and Disjoint Sets | Weeks VI – Heaps, Heap Sort and Priority Queues |
|
|
Week VIII – Programming Contests, Challenges and Competitions. |
|
|
|
Week IX – Disjoint Sets |
|
|
|
Hash Tables | Week X |
|
|
Week XI |
|
|
|
Week XII |
|
|
|
Week XIII |
|
|
|
Binary Search Trees | Week XIV |
|
|
Week XV |
|
||
Skip Lists | Week XVI |
|
|
Final Exam |