Course pages 2018–19
Algorithms
Lectures
Mon-Wed-Fri 1000-1100 in Mill Lane Lecture Room 9, from Fri 2019-01-18 to Wed 2019-03-13 inclusive (12 with FMS + 12 with DJW = 24 lectures).
Handouts and videos
- For lectures 1–12:
- Course handout distributed in lecture 1.
- For lectures 13–19:
- Lecture notes distributed in lecture 13.
See also code snippets.
Video: 5.4 Dijkstra's algorithm - For lectures 20–24:
- Lecture nodes distributed in lecture 20.
Video: 7.1, 7.2 Amortized analysis
Video: 7.3 Heaps
Video: 7.4 Fibonacci heap
Video: 7.5 Implementing/using the Fibonacci heap
Code: 7.5 class implementation (FibHeap.java, Graph.java) and dynamic implementation (fibheap.py, dijkstra.py)
Video: 7.6 Amortized analysis of the Fibonacci heap
Video: 7.7 Disjoint sets
Spare coopies of handouts are available at student reception at the Computer Laboratory.
Example sheets
- For lectures 1-12:
- Available as pdf
- For lectures 13-24:
- Example sheet 5 covering lectures 13–15
Example sheet 6 covering lectures 16–19
Example sheet 7 covering lectures 20–23
Example sheet 8 covering lecture 24
Slides
Lecture schedule
Ticks
Q&A forum
On Moodle