| Lecture times | ||
|---|---|---|
| Day | Time | Location |
| Monday | 2:00pm-4:00pm | JD 101 |
| Wednesday | 2:00pm-3:00pm | JD 101 |
| Week | Date | Lecture Time/Venue Schedule | Lecturer | Laboratory / Home work |
Assignments | ||
|---|---|---|---|---|---|---|---|
| Mon 2:00pm-3:00pm JD 101 (Building 27) | Mon 3:00pm-4:00pm JD 101 (Building 27) | Wed 2:00pm-3:00pm JD 101 (Building 27) | |||||
| 1 | 25 July | Introduction | Asymptotics-1 | Asymptotics-2 | W. Liang | ||
| 2 | 1 August | Summations | Recurrences (I) | Recurrences (II) | W. Liang | ||
| 3 | 8 August | Mathematical Tools: R&A | Min-max, Selection 1 | Selection2; Quick Sort | W. Liang | Ass-1 out | |
| 4 | 15 August | Sorting; DP-1 | DP-2 | DP-3 | W. Liang | tut/lab-1 | |
| 5 | 22 August | DP (matrix multiplication) | LCS, Greedy algorithms | Design Methodologies: R&A | W. Liang | ||
| 6 | 29 August | Heaps and Priority Queues | no lecture | Hashing I | W. Liang | tut/lab-2 | |
| 7 | 5 September | Hashing II | Binary Search Trees | Red-black Trees | W. Liang | Ass-1 due | |
| Mid Semester Break (Monday 12 September - Friday 23 September) | |||||||
| 8 | 26 September | Red-black Trees | Disjoint Sets | BFS/DFS;Topology sort | W. Liang | Ass-2 out | |
| 9 | 3 October | Public Holiday | Public Holiday | no lecture | W. Liang | ||
| 10 | 10 October | Public Holiday | Public Holiday | Data Structures: R&A | W. Liang | tut/lab-3 | |
| 11 | 17 October | MST-1 | MST-2 | SPT-1 | W. Liang | ||
| 12 | 24 October | SPT-2 | All-pairs SP | Graph algorithms R & A | W. Liang | tut/lab-4 | Ass-2 due |
| 13 | 31 October | Course and past exam paper review | W. Liang | ||||
| 14 | 10 Nov ( 2:15pm -- 5:30pm) | FINAL EXAMINATION | JD 101? | ||||