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.
Lecture | Date | Topic |
---|---|---|
(click for PDF) | ||
1 | February 25th | Introduction |
2 | February 28th | Review |
3 | March 4th | Algorithms |
4 | March 7th | Recursion |
5 | March 11th | Algorithm analysis 1 |
6 | March 14th | Algorithm analysis 2 |
7 | March 18th | Array algorithms 1 |
8 | March 21st | Array algorithms 2 |
9 | March 25th | Collections & Generics |
10 | March 28th | Linked lists 1 |
11 | April 1st | Linked lists 2 |
12 | April 4th | Random 1 |
13 | April 8th | Random 2 |
14 | April 11th | Stacks |
15 | April 15th | Queues |
16 | April 18th | Insertion & Selection sort |
Apr 19th - Apr 28th | Mid-semester break | |
17 | April 29th | Quick sort |
18 | May 2nd | Guest lecture (TBA) |
19 | May 6th | Merge sort |
20 | May 9th | Heaps & Priority Queues |
21 | May 13th | Heap sort |
22 | May 16th | Sorting comparisons |
23 | May 20th | Object oriented programming I |
24 | May 23rd | Object oriented programming II |
25 | May 27th | Object oriented programming applied |
26 | May 30th | Review & exam Guide |
Page maintained by Iain Hewson. Last modified: Wed Feb 20 11:05:24 2019