Link Search Menu Expand Document
CS 161
Mon, Jan 5
Lecture 1: Why are you here? (Ellen)
Wed, Jan 7
Lecture 2: Asymptotics, Worst-Case Analysis, and MergeSort (Ellen)
Release Homework 1
Thu, Jan 8
Section 1 (Simon, Remote (Zoom link on Ed, recordings on Canvas))
Section 1 (Will, Bldg. 160, Rm. 315)
Section 1 (Yash, Bldg. 160, Rm. 322)
Fri, Jan 9
Section 1 (Nikhil, Bldg 160, Rm. 125)
Section 0.5: Big-O, Complexity, and Induction (Review section) (Zoe & Will, STLC 111)
Mon, Jan 12
Lecture 3: Solving Recurrences and the Master Theorem (Moses)
Wed, Jan 14
Lecture 4: Median and Selection (Moses)
DueHomework 1
Release Homework 2
Thu, Jan 15
Section 2 (Simon, Remote (Zoom link on Ed, recordings on Canvas))
Section 2 (Will, Bldg. 160, Rm. 315)
Section 2 (Yash, Bldg. 160, Rm. 322)
Fri, Jan 16
Section 2 (Nikhil, Bldg 160, Rm. 125)
Wed, Jan 21
Lecture 5: Randomized Algorithms and QuickSort (Moses)
DueHomework 2
Release Homework 3
Thu, Jan 22
Section 3 (Simon, Remote (Zoom link on Ed, recordings on Canvas))
Section 3 (Will, Bldg. 160, Rm. 315)
Section 3 (Yash, Bldg. 160, Rm. 322)
Fri, Jan 23
Section 3 (Nikhil, Bldg 160, Rm. 125)
Ethics 1 (Justin)
Mon, Jan 26
Lecture 6: BucketSort and Lower Bounds for Sorting (Moses)
Wed, Jan 28
Lecture 7: Binary Search Trees and Red-Black Trees (Moses)
DueHomework 3
Release Homework 4
Thu, Jan 29
Section 4 (Simon, Remote (Zoom link on Ed, recordings on Canvas))
Section 4 (Will, Bldg. 160, Rm. 315)
Section 4 (Yash, Bldg. 160, Rm. 322)
Fri, Jan 30
Section 4 (Nikhil, Bldg 160, Rm. 125)
Mon, Feb 2
Lecture 8: Hashing (Ellen)
Wed, Feb 4
Lecture 9: Graphs and BFS and DFS (Ellen)
DueHomework 4
Thu, Feb 5
Section 5 (Simon, Remote (Zoom link on Ed, recordings on Canvas))
Section 5 (Will, Bldg. 160, Rm. 315)
Section 5 (Yash, Bldg. 160, Rm. 322)
Fri, Feb 6
Section 5 (Nikhil, Bldg 160, Rm. 125)
Mon, Feb 9
Lecture 10: Strongly Connected Components (Moses)
Wed, Feb 11
Lecture 11: Dijkstra and Bellman-Ford (Moses)
Exam 1: Midterm
Release Homework 5
Thu, Feb 12
Section 6 (Simon, Remote (Zoom link on Ed, recordings on Canvas))
Section 6 (Will, Bldg. 160, Rm. 315)
Section 6 (Yash, Bldg. 160, Rm. 322)
Fri, Feb 13
Section 6 (Nikhil, Bldg 160, Rm. 125)
Wed, Feb 18
Lecture 12: Dynamic Programming: Bellman-Ford and Floyd-Warshall (Ellen)
DueHomework 5
Release Homework 6
Thu, Feb 19
Section 7 (Simon, Remote (Zoom link on Ed, recordings on Canvas))
Section 7 (Will, Bldg. 160, Rm. 315)
Section 7 (Yash, Bldg. 160, Rm. 322)
Fri, Feb 20
Section 7 (Nikhil, Bldg 160, Rm. 125)
Mon, Feb 23
Lecture 13: More Dynamic Programming: LCS, Knapsack, Independent Set (Ellen)
Wed, Feb 25
Lecture 14: Greedy Algorithms (Ellen)
DueHomework 6
Release Homework 7
Thu, Feb 26
Section 8 (Simon, Remote (Zoom link on Ed, recordings on Canvas))
Section 8 (Will, Bldg. 160, Rm. 315)
Section 8 (Yash, Bldg. 160, Rm. 322)
Fri, Feb 27
Section 8 (Nikhil, Bldg 160, Rm. 125)
Mon, Mar 2
Lecture 15: Minimum Spanning Trees (Moses)
Wed, Mar 4
Lecture 16: Max-Flow and the Ford-Fulkerson Algorithm (Moses)
DueHomework 7
Release Homework 8
Thu, Mar 5
Section 9 (Simon, Remote (Zoom link on Ed, recordings on Canvas))
Section 9 (Will, Bldg. 160, Rm. 315)
Section 9 (Yash, Bldg. 160, Rm. 322)
Fri, Mar 6
Section 9 (Nikhil, Bldg 160, Rm. 125)
Mon, Mar 9
Lecture 17: Stable Matchings and Gale-Shapley (Ellen)
Wed, Mar 11
Lecture 18: What's next? (Ellen)
DueHomework 8
Wed, Mar 18
Exam 2: Final