| Week | Date | Lecture Time/Venue Schedule | Lecturer | Laboratory / Home work |
Assignment/Quiz | ||
|---|---|---|---|---|---|---|---|
| Mon 9:00am-10:00am JD 101 (Building 27) | Tue 9:00am-10:00am JD 101 (Building 27) | Fri 12:00pm-1:00pm MCC T4 (Building 26a) | |||||
| 1 | 22 July | Introduction | Asymptotics-1 | Asymptotics-2 | W.Liang/B. Faller | Quiz-1 out | |
| 2 | 29 July | Summations | Recurrences | Mathematical Tools: R&A | B. Faller | tut/lab-1 | |
| 3 | 5 August | Min-max, Selection 1 | Selection2; Quick Sort | no lecture | W. Liang | Ass-1 out/Quiz-2 out | |
| 4 | 12 August | Lower Bound on Sorting | DP-1 | DP-2 | W. Liang | tut/lab-2 | |
| 5 | 19 August | DP-3 | Greedy algorithms I | Greedy algorithms II | W. Liang | Quiz-3 out | |
| 6 | 26 August | Design Methodologies: R&A | no lecture | Heaps and Priority Queues | W. Liang | tut/lab-3 | |
| 7 | 2 September | Hashing I | Hashing II | Mid-Semester Exam (in this week) | W. Liang | Mid-sem Exam/Ass-1 due/Quiz-4 out | |
| Mid Semester Break (Monday 8 September - Friday 21 September) | |||||||
| 8 | 23 September | Binary Search Trees | Red-black Trees | Red-black Trees | W. Liang | tut/lab-4 | Ass-2 out |
| 9 | 30 September | Public Holiday | Disjoint Sets | Graph representation and BFS | W. Liang | Quiz-5 out | |
| 10 | 7 October | Public Holiday | DFS;Topology sort | Data Structures: R&A | W. Liang/B. Faller | tut/lab-5 | |
| 11 | 14 October | MST-1 | MST-2 | SPT-1 | B. Faller | Quiz-6 out | |
| 12 | 21 October | SPT-2 | All-pairs SP | Graph Algorithm
R & A |
B. Faller | tut/lab-6 | |
| 13 | 28 October | Course and past exam paper review | W. Liang | Ass-2 due | |||
| 14 | 4 Nov | Final exam (expected in this week) | |||||