COSC241
Programming and Problem Solving
Lecture schedule and handouts
Electronic copies of each lecture handout are available to help with your revision. If you want a hard copy of a lecture you have missed please check the pigeon holes, and ask at the main office if you can't find the lecture you are looking for. We reserve the right to depart from the planned schedule if necessary.
Code samples from the lectures are available here.
| Lecture | Date | Topic (click for PDF) |
|---|---|---|
| 1 | February 27th | Introduction |
| 2 | March 1st | Review |
| 3 | March 5th | Algorithms |
| 4 | March 8th | Recursion |
| 5 | March 12th | Algorithm analysis 1 |
| 6 | March 15th | Algorithm analysis 2 |
| 7 | March 19st | Array algorithms 1 |
| 8 | March 22nd | Array algorithms 2 |
| 9 | March 26th | Sorting 1 |
| 10 | March 29th | Sorting 2 (lect 9 handout) |
| 11 | April 2nd | ADT principles |
| 12 | April 5th | Stack ADT |
| April 6th - 15th | Mid-semester break | |
| 13 | April 16th | Linked lists 1 |
| 14 | April 20th | Linked lists 2 |
| 15 | April 23rd | Queues |
| 16 | April 27th | Graphs 1 |
| 17 | April 30th | Trees 1 |
| 18 | May 3rd | Trees 2 |
| 19 | May 7th | Binary search trees 1 |
| 20 | May 10th | Binary search trees 2 |
| 21 | May 14th | Heaps |
| 22 | May 17th | Priority queues & Heapsort |
| 23 | May 21st | Graphs 2 |
| 24 | May 24th | Maze generation |
| 25 | May 28th | Review |
| 26 | May 31st | Q+A session |
Page maintained by Iain Hewson. Last modified: Sat May 12 16:17:34 2012
