Electronic copies of the lecture material will be available by Thursday afternoon for the following week. We reserve the right to depart from the planned schedule if necessary.
Copies of the lecture notes and code samples will be available on Blackboard.
Recordings of the lectures will be available here.
Lecture | Date | Topic |
---|---|---|
1 | March 1st | Introduction |
2 | March 4th | Review |
3 | March 8th | Algorithms |
4 | March 11th | Recursion |
5 | March 15th | Algorithm analysis 1 |
6 | March 18th | Algorithm analysis 2 |
7 | March 22nd | Array algorithms 1 |
8 | March 25th | Array algorithms 2 |
9 | March 29th | Linked lists 1 |
10 | April 1st | Linked lists 2 |
Apr 2nd - Apr 11th | Mid-semester break | |
11 | April 12th | Random 1 |
12 | April 15th | Random 2 |
13 | April 19th | Collections & Generics |
14 | April 22nd | Stacks |
15 | April 26th | ANZAC Day - No lecture |
16 | April 29th | Queues |
17 | May 3rd | Insertion & Selection sort |
18 | May 6th | Quick sort |
19 | May 10th | Merge sort |
20 | May 13th | Heaps & Priority Queues |
21 | May 17th | Heap sort |
22 | May 20th | Sorting comparisons |
23 | May 24th | Object oriented programming I (combined handout) |
24 | May 27th | Object oriented programming II |
25 | May 31st | Object oriented programming applied |
26 | June 3rd | Review & exam Guide |
Page maintained by Iain Hewson. Last modified: Thu Feb 18 16:42:39 2021