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.

Lecture Date Topic
    (click for PDF)
1 February 26th 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 19th Array algorithms 1
8 March 22nd Array algorithms 2
9 March 26th Random 1
10 March 29th Random 2
  Mar 30th - Apr 8th Mid-semester break
11 April 9th ADT principles
12 April 12th Stack ADT
13 April 16th Linked lists 1
14 April 19th Linked lists 2
15 April 23rd Queues
16 April 26th Insertion & Selection sort
17 April 30th Quick sort
18 May 3rd Merge sort
19 May 7th Heaps & Priority Queues
20 May 10th Heap sort
21 May 14th Sorting comparisons
22 May 17th Guest lecture (big data / scaling)
23 May 21st Application 1
24 May 24th Application 2
25 May 28th Catch up / Review
26 May 31st Exam Guide
Valid XHTML 1.0 Strict

Page maintained by Iain Hewson. Last modified: Fri Feb 23 14:11:07 2018