Winter classes start January 4.
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. Arrays - Linked lists
7. Quick sort
8. Quick sort running time - More sorting algorithms
9. Stacks
10. Queues
11. Deques - Extendable arrays
12. Trees and binary trees (1)
13. Trees and binary trees (2)
14. Binary search trees
Reading week: February 19-25.
15. Midterm test (March 1)
16. AVL trees
Last date to drop courses without receiving a grade: March 4.
17. Heaps
18. Heap sort
19. Hash tables (1)
20. Hash tables (2)
21. Introduction to graphs
22. Depth-first search
23. Breadth-first search
24. Applications of BSF and DFS
Winter classes end April 4.
Winter exams start April 6.