COSC241
Programming and Problem Solving
Lecture schedule and handouts
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.
Code samples from the lectures will be available here.
Recordings of the lectures are available here.
Practice problems on O-notation.
| Lecture | Date | Topic |
|---|---|---|
| (click for PDF) | ||
| 1 | February 27th | Introduction |
| 2 | March 2nd | Review |
| 3 | March 6th | Algorithms |
| 4 | March 9th | Recursion |
| 5 | March 13th | Algorithm analysis 1 |
| 6 | March 16th | Algorithm analysis 2 |
| 7 | March 20th | Array algorithms 1 |
| 8 | March 23rd | Array algorithms 2 |
| 9 | March 27th | Sorting 1 |
| 10 | March 30th | Random 1 |
| 11 | April 3rd | Random 2 |
| 12 | April 6th | ADT principles |
| 13 | April 10th | Stack ADT |
| 14 | April 13th | Catch up / Review |
| April 14th - 23rd | Mid-semester break | |
| 15 | April 24th | Linked lists 1 |
| 16 | April 27th | Linked lists 2 |
| 17 | May 1st | Queues |
| 18 | May 4th | Trees 1 |
| 19 | May 8th | Trees 2 |
| 20 | May 11th | BSTs |
| 21 | May 15th | Heaps |
| 22 | May 18th | Priority Queues & Heapsort |
| 23 | May 22nd | Graphs 1 |
| 24 | May 25th | Graphs 2 |
| 25 | May 29th | Maze generation |
| 26 | June 1st | Exam Guide |
Page maintained by Iain Hewson. Last modified: Mon Jun 5 14:05:35 2017
Use of the user account you have been given by the department implies acceptance of, and agreement to abide by, departmental
regulations, as well as official Otago University computer user policies. You may read more by accessing the information (and
following the links) on our
information pages on our departmental web site.