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.

Recordings of the lectures are available here.

Basic maths facts and strategies for COSC 242 are available here

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

Page maintained by Iain Hewson. Last modified: Tue Oct 27 16:28:03 2020