CSC263H: Lecture Notes

Lectures

This page contains tentative schedule, readings and exercises, and lecture materials for each week.

Date/Topic Readings/Exercises Lecture Files
Week 1: Jan 8 (course info, complexity review, ADTs)
  • Course Notes: Chapter 1
  • CLRS: Appendix A, C, Chapter 2, 3, 4.5, 5.1, 5.2
Week 2: Jan 15 (Priority Queues; Heaps)
  • Course Notes: Chapter 2
  • CLRS: Chapter 6, EX 6.1-1, 6.1-4, 6.2-4
Week 3: Jan 22 (Dictionaries; BSTs)
  • Course Notes: Chapter 3
  • CLRS: Chapter 12.1, 12.2, 12.3, EX 12.2-3, 12.3-1
Week 4: Jan 29 (Balanced Trees; Augmentation)
  • Course Notes: Chapter 3
  • CLRS: Problem 13-3, Chapter 14.1, EX 14.1-1, 14.1-2
Week 5: Feb 5 (Hashing)
  • Course Notes: Chapter 4
  • CLRS: Chapter 11.1, 11.2, 11.3, EX 11.1-1, 11.2-1, 11.2-2
Week 6: Feb 12 (Amortised Analysis; Quicksort)
  • Course Notes: Chapter 7, Chapter 1
  • CLRS: Chapter 17.1, 17.2, 7.1, 7.2, EX 17.1-2, 7.1-1, 7.2-2
Feb 19 (Reading Week)
Week 7: Feb 26 (Graph; BFS)
  • Course Notes: Chapter 6, Page 63-70
  • CLRS: Chapter 22.1, 22.2, EX 22.1-1, 22.1-2
Week 8: Mar 5 (DFS)
  • Course Notes Chapter 6, Page 71-78
  • CLRS: Chapter 22.3, EX 22.3-2
Week 9: Mar 12 (MST)
  • Course Notes: Chapter 6, Page 79-86
  • CLRS: Chapter 23, EX 23.1-1, 23.2-2
Week 10: Mar 19 (Disjoint Sets)
  • Course Notes: Chapter 8
  • CLRS: Chapter 21.1, 21.2, 21.3, EX 21.2-2
Week 11: Mar 26 (Randomised Algorithms; Lower Bounds)
  • Course Notes: Chapter 5
  • CLRS: Chapter 7.1, 7.2, EX 7.1-1, 7.2-2
Exam Review Session
  • None