Link Search Menu Expand Document
CS 161 (Archived)

General Lecture Information

  • For the first three weeks, lectures will be held live on Zoom. The Zoom links can be found on Canvas. For the rest of the quarter, lectures will be held in person in the NVIDIA Auditorium.
  • Lectures will be recorded and the recordings can be accessed on Canvas.

Lectures

Lecture 1: Why are you here?

Mon, Jan 3, 9:45 am – 11:15 am (Moses; Online)
Lecture resources
Recording

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

Wed, Jan 5, 9:45 am – 11:15 am (Moses; Online)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
  • Pre-lecture Python notebook: [Colab] [Zip]
Lecture resources
Recording

Lecture 3: Solving Recurrences and the Master Theorem

Mon, Jan 10, 9:45 am – 11:15 am (Nima; Online)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 4: Median and Selection

Wed, Jan 12, 9:45 am – 11:15 am (Nima; Online)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 5: Randomized Algorithms and QuickSort

Wed, Jan 19, 9:45 am – 11:15 am (Moses; Online)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 6: BucketSort and Lower Bounds for Sorting

Mon, Jan 24, 9:45 am – 11:15 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 7: Binary Search Trees and Red-Black Trees

Wed, Jan 26, 9:45 am – 11:15 am (Moses)
Pre-lecture resources
Lecture resources
Recording

Lecture 8: Hashing

Mon, Jan 31, 9:45 am – 11:15 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 9: Graphs and BFS and DFS

Wed, Feb 2, 9:45 am – 11:15 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 10: Strongly Connected Components

Mon, Feb 7, 9:45 am – 11:15 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 11: Dijkstra and Bellman-Ford

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

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

Mon, Feb 14, 9:45 am – 11:15 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

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

Wed, Feb 16, 9:45 am – 11:15 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: None this time!
Lecture resources
Recording

Lecture 14: Greedy Algorithms

Wed, Feb 23, 9:45 am – 11:15 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 15: Minimum Spanning Trees

Mon, Feb 28, 9:45 am – 11:15 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources (coming)
Recording

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

Wed, Mar 2, 9:45 am – 11:15 am (Moses)
Pre-lecture resources
  • Pre-lecture exercise: [PDF]
Lecture resources
Recording

Lecture 17: Stable Matchings and Gale-Shapley

Mon, Mar 7, 9:45 am – 11:15 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: None this time!
Lecture resources
Recording

Lecture 18: What's next?

Wed, Mar 9, 9:45 am – 11:15 am (Nima)
Pre-lecture resources
  • Pre-lecture exercise: None this time!
Lecture resources

Recording