CS2040S

CS2040S

1. ADT: Linked List, Queues and Stacks
2. Algorithm Analysis
3. Binary and Mergesort
4. QuickSort
5.Binary Heap and Priority Queue
6. BST
7. Balanced Binary Search Tree
8. Hashing
9. Graph Theory
10. Searching on Graph
11. Single source shortest Path
12. Single source shortest Path (Special)
13. All pairs shortest Path + Revision
14. MST (Minimum Spanning Tree)
15. Kruskal's Algorithm


Tutorial:
1 - Time complexity
2- Quick Sort and Partition complexity
3 - BST
4 - Week 8


Lab:
2
3