Lecture Schedule
The following schedule is tentative and subject to change as the instructor deems necessary.
1. Course info - Introduction to data structures
2. Algorithm analysis (1)
3. Algorithm analysis (2)
4. Recursion and logarithms
5. Merge sort - Solving recurrences
6. Quick sort
7. Arrays - Linked lists
8. Stacks
9. Queues
10. Double-ended queues - Extendable arrays
11. Trees
12. Binary trees
13. Midterm test
14. Binary search trees
15. More sorting algorithms
16. AVL trees
17. Heaps
18. Heap sort
19. Hash tables (1)
20. Hash tables (2)
21. Introduction to graphs
22. Depth-first search (DFS)
23. Breadth-first search (BFS)
24. Applications of BSF and DFS
Last updated: 7 January 2020