Link Search Menu Expand Document
CS 161 (Archived)

General Lecture Information

  • Lectures will be recorded and the recordings can be accessed on Canvas.

Lectures

Lecture 1: Why are you here?

Mon, Jan 9, 9:30 am – 10:50 am (Nima)
Lecture resources
Recording

Lecture 2: Asymptotics, Worst-Case Analysis, and MergeSort

Wed, Jan 11, 9:30 am – 10:50 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
  • Pre-lecture Python notebook: [Colab] [Zip]
Lecture resources
Recording
  • Video (in-person part): [Canvas]
  • Video (recorded offline, MergeSort): [Canvas]

Lecture 3: Solving Recurrences and the Master Theorem

Wed, Jan 18, 9:30 am – 10:50 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 4: Median and Selection

Mon, Jan 23, 9:30 am – 10:50 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 5: Randomized Algorithms and QuickSort

Wed, Jan 25, 9:30 am – 10:50 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 6: BucketSort and Lower Bounds for Sorting

Mon, Jan 30, 9:30 am – 10:50 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 7: Binary Search Trees and Red-Black Trees

Wed, Feb 1, 9:30 am – 10:50 am (Nima)
Pre-lecture resources
Lecture resources
Recording

Lecture 8: Hashing

Mon, Feb 6, 9:30 am – 10:50 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 9: Graphs and BFS and DFS

Wed, Feb 8, 9:30 am – 10:50 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 10: Strongly Connected Components

Mon, Feb 13, 9:30 am – 10:50 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 11: Dijkstra and Bellman-Ford

Wed, Feb 15, 9:30 am – 10:50 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 12: Dynamic Programming: Bellman-Ford and Floyd-Warshall

Wed, Feb 22, 9:30 am – 10:50 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 13: More Dynamic Programming: LCS, Knapsack, Independent Set

Mon, Feb 27, 9:30 am – 10:50 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: None this time!
Lecture resources
Recording

Lecture 14: Greedy Algorithms

Wed, Mar 1, 9:30 am – 10:50 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 15: Minimum Spanning Trees

Mon, Mar 6, 9:30 am – 10:50 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 16: Max-Flow and the Ford-Fulkerson Algorithm

Wed, Mar 8, 9:30 am – 10:50 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 17: Stable Matchings and Gale-Shapley

Mon, Mar 13, 9:30 am – 10:50 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: None this time!
Lecture resources
Recording

Lecture 18: What's next?

Wed, Mar 15, 9:30 am – 10:50 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: None this time!
Lecture resources
Recording