Welcome to the Unit webpage of the Algorithms 1 unit!
Teaching Staff
Teaching Sessions
|
Week | Topic | Slides | |
---|---|---|---|
W13: 22 - 26 Jan Problem Sheet 1 PDF solution | Welcome and Introduction | ||
Peak Finding | |||
Why Constants Matter Less | |||
Big-O Notation | |||
W14: 29 Jan - 02 Feb Problem Sheet 2 PDF solution | Theta and Omega Notation | ||
RAM Model and Runtime Analysis | |||
W15: 05 - 09 Feb Problem Sheet 3 PDF solution | Linear and Binary Search | ||
Recap: Proofs by Induction | |||
Loop Invariants and Insertionsort | |||
W16: 12 - 16 Feb Problem Sheet 4 PDF solution | Mergesort | ||
Maximum Subarray Problem | |||
W17: 19 - 23 Feb Problem Sheet 5 PDF solution | Trees | ||
Heapsort | |||
W18: 26 Feb - 01 Mar | |||
W19: 04 - 08 Mar Problem Sheet 6 PDF solution | Quicksort - part 1 | ||
Quicksort - part 2 | |||
Lower Bound for Sorting | |||
W20: 11 - 15 Mar Problem Sheet 7 PDF solution | Countingsort and Radixsort | ||
Recurrences 1 | |||
W21: 18 - 22 Mar Problem Sheet 8 PDF solution | Recurrences 2 | ||
Fibonacci Numbers | |||
EV1: 25 - 29 Mar | |||
EV2: 01 - 05 Apr | |||
EV3: 08 - 12 Apr | |||
W22: 15 Apr - 19 Apr Problem Sheet 9 PDF solution | The Pole Cutting Problem | ||
The Matrix Chain Parenthesization Problem | |||
W23: 22 - 26 Apr | Elements of Dynamic Programming | ||
W24: 29 - 03 May | Revision Week, no new material |