INF2-IADS: Schedule and Course Materials for Semester 1 (Autumn 2026)
Below you can find the schedule and materials for Semester 1.
Our lectures this semester are:
- Mondays 4pm-5pm in LT A of 40 George Square for weeks 1-8.
- Thursdays 11am-12 in LT A of 40 George Square for weeks 1-8.
The video recordings of this year's lectures will all be available via the course's Learn page, but you may also find the lecture recordings from previous years helpful - perhaps more polished and better edited than most live lectures, and they also feature music and songs :-) You can access these in either of two ways:
- Go to the IADS 2021-22 channel on Media Hopper Create, and select the playlist for the lecture you want, OR
- Go to media.ed.ac.uk, log on to Media Hopper Create using the person icon at top right, and the 'Recording from previous years' links below will then take you directly to the playlists.
| Week (commencing) | Date | Event | Lecturer | Topic | Reading (For details of the textbooks referenced here, choose 'Resource List' from the navigation menu on the right.) |
| 1 (21 Sept) | Mon 21 Sept | Lecture 1 | John | Algorithms Illuminated 1.1., 10.1. CLRS 1 | |
| Thu 24 Sept | Lecture 2 | John | CLRS 2.1, CLRS 2.3, CLRS 31.6 (second half) Algorithms Illuminated 1.4, 1.5. KT 2.1, 2.4. (Merging two sorted lists), 5.1. (only page 210, but read through 5.1 if you are interested). | ||
| 2 (28 Sept) | InfBase labs | Labsheets 1, 2 | |||
| Mon 28 Sept | Lecture 3 | John | Algorithms Illuminated 2 KT 2.2, 2.4 CLRS 3 (does everything) GGT 3.3, 3.4 | ||
| Thu 1 Oct | Lecture 4 | John | As for Lecture 3 | ||
| 3 (5 Oct) | InfBase labs | Labsheet 3 | Supporting files: numbers1.txt, numbers2.txt, numbers3.txt, numbers4.txt, numbers5.txt |
| |
| Multiple dates | Tutorial 1 | Tutorial 1 - Asymptotic Notation Solutions, slides | |||
| Mon 5 Oct | Lecture 5 | John | Lecture 5 - Asymptotic analysis of sorting algorithms Cancelled due to illness. Please watch recording at the link below. | Roughgarden 1.5, 1.6 KT 2.4/4.1 CLRS 2.2 | |
| Thu 8 Oct | Lecture 6 | John | CLRS 10.2, 10.3 Python documentation: Data model (just 3.1) | ||
| 4 (12 Oct) | Multiple dates | Tutorial 2 | Tutorial 2 - Analysis of Algorithms Solutions, slides | ||
| Mon 12 Oct | Lecture 7 | John | Array expansion: Stacks + queues: | ||
| Thu 15 Oct | Lecture 8 | John | Roughgarden 12.1-12.4 (recommended!), GTG 10.1, 10.2 Sedgewick 3.4 | ||
| 5 (19 Oct) | Multiple Dates | Tutorial 3 | Tutorial 3 - Data structures for lists and sets Solutions, slides | ||
| Mon 19 Oct | Lecture 9 | John | Sedgewick 3.2 (first half) and 3.3 (second half) CLRS 12.1-3, 13.1-3 | ||
| Thu 22 Oct | Lecture 10 | John | |||
| 6 (26 Oct) | Mon 26 Oct | Lecture 11 | Mary | CLRS 6.1-6.4 KT 2.5 (uses min-heap) [AI] (Roughgarden) 10.1, 10.2, 10.5 (major differences: [AI] uses min-heap, but also uses "Heapify" to refer to our Build-Max-Heap, and implements Min-Heapify as part of "ExtractMin"). | |
| Thurs 29 Oct | Lecture 12 | Mary | CLRS 6.5 KT 2.5 (uses min-heap) [AI] (Roughgarden): 10.3, 10.5 (major differences: RG uses min-heap, uses "Heapify" for our Build-Max-Heap, and implements Min-Heapify as part of "ExtractMin"). | ||
| 7 (2 Nov) | Multiple Dates | Lab | * | Drop-in for coursework 1 | |
| Multiple Dates | Tutorial 4 | * | Tutorial 4 - The Master Theorem and Heaps Solutions, slides | ||
| Mon 2 Nov | Lecture 13 | Mary | Lecture 13 - Quicksort | CLRS 7.1-7.3. Roughgarden 5.1, 5.3 (5.2 - but this is different to our Partition) | |
| Thurs 5 Nov | Lecture 14 | Mary | KT 3.2., 3.3.
| ||
| 8 (9 Nov) | Multiple Dates | Lab | * | Drop-in for coursework 1 | |
| Multiple Dates | Tutorial 5 | * | Tutorial 5 - Quicksort, BFS, and DFS, solutions, slides | ||
| Mon 9 Nov | Lecture 15 | Mary | KT 3.4., 3.6. Roughgarden 8.3, 8.4 8.5. CLRS 20.4. |