Class Notes (As given by Anna Philippou)
Lecture 1
Introduction - Algorithm Complexity
pdf
Lecture 2
Divide-And-Conquer Algorithms
Lecture 3
Dynamic Programming
Lecture 4
Greedy Algorithms
Lecture 5
Backtracking Algorithms
Lecture 6-7
Shortest Paths on Graphs
Lecture 8-9
Shortest Paths on Graphs (Continued)
Lecture 10-11
Flow Algorithms on Graphs
Lecture 12-13
Fast Fourier Transform
Lecture 14-16
Geometric Algorithms
Lecture 17-19
Sorting Networks
Lecture 20-21
Randomized Algorithms
Lecture 22
Parallel Algorithms
Lecture 23-25
Arithmotheory Algorithms and the Kryptosystem RSA