skip to primary navigationskip to content

Department of Computer Science and Technology

Algorithms 2

 

Course pages 2022–23

Algorithms 2

This course is a continuation of Algorithms 1 (which is why these notes start at Section 5, and why the lectures start at Lecture 13).

Lecture notes

Announcements, Q&A, tick submission

Moodle

Schedule

5. Graphs and path finding graphs.ipynb
Lecture 13
[slides]
5, 5.1 Graphs (14:27)
Optional tick: bfs-all from ex4.q6
Lecture 14
[slides]
5.4 Dikstra's algorithm (15:25) plus proof (24:01)
Lecture 15
[slides]
Optional challenge: chatgpt-bfs
Optional tick: bf-cycle from ex4.q19
Lecture 16
[slides]
Example sheet 4 [pdf]
6. Graphs and subgraphs subgraphs.ipynb
Lecture 17
[slides]
Compulsory tick: max-flow (due 12noon on 13 March)
Lecture 18
[slides]
Lecture 19
[slides]
Lecture 20
[slides]
Optional challenge: rank-sim
Example sheet 5 [pdf]
7. Advanced data structures
Lecture 20 ctd.
[slides]
Lecture 21
[slides]
Lecture 22
[slides]
Optional tick: fib-heap
Lecture 23
[slides]
7.8 (continued)
Optional tick: dis-set from ex6.q12
Example sheet 6 [pdf]
Further topics
Lecture 24
[slides]
X. Optimization algorithms