COSC242

Algorithms and Data Structures

Lecture Timetable (provisional)

The lecture notes have but one purpose: to remind the lecturer what to cover in class. Reading these cannot substitute for attending the lecture. Most topics are also extensively covered in the textbook, but we sometimes take a different approach than they do.

Electronic copies of each lecture handout are available the week before. Hard copies are not provided. We reserve the right to depart from the planned schedule if necessary.

Basic maths facts and strategies for COSC 242 are available here

Lecture Date Topic
1 12 July Introduction
2 15 July C programming - memory & pointers
3 19 July Big-O and Big-Theta
4 22 July Proof techniques
5 26 July Induction examples
6 29 July Divide and Conquer - recursion
7 2 August Recurrences & Mergesort analysis
8 5 August Quicksort analysis
9 9 August Hashing 1
10 12 August Hashing 2
11 16 August Hashing 3
12 19 August Binary search trees 1
13 23 August Binary search trees 2
14 26 August Binary search trees 3
  (Aug 28th - Sep 5th) Mid-semester break
15 6 September Red-black trees 1
16 9 September Red-black trees 2
17 13 September Red-black trees 3
18 16 September Graph algorithms 1
19 20 September Graph algorithms 2
20 23 September Graph algorithms 3
21 27 September Greedy algorithms
22 30 September Dynamic programming 1
23 4 October Dynamic programming 1
24 7 October B-trees
25 11 October P and NP
26 14 October Review and Exam prep
Valid XHTML 1.0 Strict

Page maintained by Iain Hewson. Last modified: Fri Jun 25 13:44:59 2021