Why should I visit this page?
This page will contain most of the lecture materials: notes from lectures, summary slides,
example code, etc.
We post these materials to help you focus on what's happening in class without worrying
about copying it all down. Attendance at lectures is mandatory as a lot of lecture time will
be devoted to in-class exercises and discussion. Reading these notes is not an adequate
substitute for attending lectures.
| Date |
Class materials |
| Jan 8-12 |
- Course information sheet
- Course administration slides
- Introduction slides
- Complexity of algorithms pre-lecture slides
- Complexity of algorithms post-lecture slides part 1 (up to what Anya didn't get to cover)
- CLRS Chapters: 2 and 3 (in both 3rd and 4th editions).
|
| Jan 15-19 |
|
| Jan 22 - Jan 26 |
- Balanced trees (AVL) post-lecture complete with remaining slides
- This week's tutorial questions
- Augmented data structures pre-lecture slides
- Union of balanced trees pre-lecture slides
- CLRS Chapter 14 (3rd edition) / 17 (4th edition).
- Guy Blelloch, Daniel Ferizovic, Yihan Sun, Parallel Ordered Sets Using
Join, 2016. Paper is
available here (very much optional)
- Augmented data structures post-lecture slides
- Union of balanced trees post-lecture slides part 1
- This week's tutorial solutions
|
| Jan 29 - Feb 2 |
|
| Feb 5-9 |
|
| Feb 12-16 |
|
| Feb 19-23 |
READING WEEK
|
| Feb 26 - Mar 1 |
This week's tutorial questions
Minimum spanning trees pre-lecture slides
This week's tutorial solutions
Minimum spanning trees post-lecture slides
|
| Mar 4-8 |
|
| Mar 11-15 |
- Amortised complexity pre-lecture slides
- Disjoint sets pre-lecture slides
- Amortised complexity post-lecture slides
- Disjoint sets post-lecture slides
- CLRS Chapters: 16, 19, 22 in ed.4 / 24, 17, 19, 21 in ed.3.
|
| Mar 18-22 |
|
| Mar 25-29 |
- Tutorial material on Fibonacci heaps
- Quicksort pre-lecture slides
- Quicksort post-lecture slides
- CLRS Chapters: 19 in 3rd ed.; 7 in both eds
|
| Apr 1-5 |
|