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