| Week | Date | Lecture Time/Venue Schedule | Laboratory / Home work |
Assignments | ||
|---|---|---|---|---|---|---|
| Mon 12:00pm-1:00pm ENEG T | Tue 12:00pm-1:00pm JD 101 | Wed 11:00am-12:00pm JD 101 | ||||
| 1 | 20 July | No lecture | Introduction | Asymptotics-1 | ||
| 2 | 27 July | Asymptotics-2 | No lecture | Summations | ||
| 3 | 3 August | Recurrences | No lecture | Mathematical Tools: R&A | Ass-1 out | |
| 4 | 10 August | Min-max, Selection 1 | Selection2; Quick Sort | Sorting; DP-1 | ||
| 5 | 17 August | DP-2 | DP (matrix multiplication) | LCS, greedy algorithm | tut/lab-1 | |
| 6 | 24 August | Greedy algorithms | No lecture | Design Methodologies: R&A | ||
| 7 | 31 August | heaps and priority queues | Prioirty Queue, hashing | Hash Table-2 | tut/lab-2 | |
| 8 | 7 September | Binary search tree | R-B Trees | R-B trees, indexed sets | ||
| 9 | 14 September | Disjoint sets | Data Structures: R&A | BFS | Ass-1 due | |
| 10 | 21 Septemner | DFS;Topology sort | MST-1 | MST-2 | tut/lab-3 | Ass-2 out |
| Mid Semester Break (Saturday 26 September - Sunday 11 October) | ||||||
| 11 | 12 October | SPT-1 | SPT-2 | ASPT-1 | ||
| 12 | 19 October | SCC, Bridges,Cutting points | Graph algorithms R & A | Course and past exam paper review | tut/lab-4 | Ass-2 due |
| 13 | 26 October | |||||