It will be to your advantage
to bring the handouts to every lecture, together with a notebook with
non-detachable pages and a few coloured pens. Further printed copies
of the handouts are available from the student administration office in
the William Gates
Building.

Errata Corrige

Negative lines counted from bottom of page.

Page

Line

Errata

Corrige

Reported on

by

70

-7

rotated is n edge

rotated is an edge

2017-02-06

author

102

11

If it hasn't

If it isn't

2017-05-03

author

§5.6

Problem statement

for every pair of vertices

for every vertex v compute the weight of the minimal-weight path from s to v

2017-02-17

Jakub Perlin

Example sheet week 5

Question 5

O(V+E)

O(E+V log V)

2017-02-20

Example sheet week 5

Question 6

assert w.active == True

assert (w.active == True) or (w is not v's first neighbour)

2017-02-24

Adam Kucz

§5.10

top of page

Kruskal [...] has the same running time [as Prim's algorithm]

Delete the comment about running time

2017-03-01

§5.12, in Graphs part 2 Page 6

half way down

either f(v→w)<c(v→w) or f(v→w)>0

either f(v→w)<c(v→w) or f(w→v)>0

2017-03-01

§5.12, in Graphs part 2 Page 8

3rd paragraph

total running time is O(E V F*)

total running time is O(E f*)

2017-03-03

§6.2, in Adv.Data Page 7

line 6 of code snippet

newroots[x.degree] = null

newroots[x.degree-1] = null

2017-03-08

A. Student

§6.2, in Adv.Data page 8

equations for total amortized cost

-Φ(S0)+c1+Φ(S0)

-Φ(S0)+c1+Φ(S1)

2017-03-08

A. Student

§6.2, in Adv.Data page 8

equations for total amortized cost

+Φ(S0)-Φ(Sk)

-Φ(S0)+Φ(Sk)

2017-03-08

A. Student

§6.1, in Adv.Data page 3

line 17 of code snippet

making the smaller child a root of the larger

making the larger child a root of the smaller

2017-04-09

J. Perlin

§7.2, in Geometry page 3

description of algorithm

If two points have the same smallest angle, use the one that's furthest from p

If two points have the same smallest angle, use the one that's furthest from q

We are happy when people use the homebrew
online Otter system, which is
still somewhat experimental. Please help us make it work for you by
providing constructive feedback on how it could be improved.
Alternatively, here are exercise sheets in pdf.

Past exam questions
for Algorithms
I, Algorithms
II,
Data
Structures and Algorithms
and Algorithms
may be of interest. If you want to own this material
rather than just memorize it, attempt the questions as seriously as if
you were taking the exam yourself and do not open the solution notes
until after having irrevocably committed (no more changes) to your own
solution. The best students already understand the wisdom of this
advice; for the others, yeah, the pressure is high, the temptation is
strong, the flesh is weak...

If you are a supervisor

Thanks for supervising. Please email frank dot stajano hyphen
hyphen algs @cl.cam.ac.uk with your CRSID and ask your supervisor to
tell Frank that she or he agrees that you should be supervising this
course. You will then be granted access to the "information for
supervisors" tab and added to the list of people who should know about
supervisor-relevant stuff.