Mon, Jan 9

Lecture 1: Why are you here? (Nima)

Wed, Jan 11

Lecture 2: Asymptotics, Worst-Case Analysis, and MergeSort (Nima)

Release Homework 1

Thu, Jan 12

Section 1 (Ivan, STLC 115)

Section 1 (Akash, 160-B35)

Section 1 (Amrita, Online)

Fri, Jan 13

Section 1 (Apoorva, 200-034)

Section 1 (Lucy, Y2E2 111)

Wed, Jan 18

Lecture 3: Solving Recurrences and the Master Theorem (Nima)

Release Homework 2

DueHomework 1

Thu, Jan 19

Section 2 (Ivan, STLC 115)

Section 2 (Akash, 160-B35)

Section 2 (Amrita, Online)

Fri, Jan 20

Section 2 (Apoorva, 200-034)

Section 2 (Lucy, Y2E2 111)

Mon, Jan 23

Lecture 4: Median and Selection (Moses)

Wed, Jan 25

Lecture 5: Randomized Algorithms and QuickSort (Moses)

Release Homework 3

DueHomework 2

Thu, Jan 26

Section 3 (Ivan, STLC 115)

Section 3 (Akash, 160-B35)

Section 3 (Amrita, Online)

Fri, Jan 27

Section 3 (Apoorva, 200-034)

Section 3 (Lucy, Y2E2 111)

Mon, Jan 30

Lecture 6: BucketSort and Lower Bounds for Sorting (Nima)

Wed, Feb 1

Lecture 7: Binary Search Trees and Red-Black Trees (Nima)

Release Homework 4

DueHomework 3

Thu, Feb 2

Section 4 (Ivan, STLC 115)

Section 4 (Akash, 160-B35)

Section 4 (Amrita, Online)

Fri, Feb 3

Section 4 (Apoorva, 200-034)

Section 4 (Lucy, Y2E2 111)

Mon, Feb 6

Lecture 8: Hashing (Nima)

Wed, Feb 8

Lecture 9: Graphs and BFS and DFS (Nima)

DueHomework 4

Thu, Feb 9

Section 5 (Ivan, STLC 115)

Section 5 (Akash, 160-B35)

Section 5 (Amrita, Online)

Fri, Feb 10

Section 5 (Apoorva, 200-034)

Section 5 (Lucy, Y2E2 111)

Mon, Feb 13

Lecture 10: Strongly Connected Components (Moses)

Wed, Feb 15

Lecture 11: Dijkstra and Bellman-Ford (Moses)

Release Homework 5

Thu, Feb 16

Exam 1: Midterm

Wed, Feb 22

Lecture 12: Dynamic Programming: Bellman-Ford and Floyd-Warshall (Moses)

Release Homework 6

DueHomework 5

Thu, Feb 23

Section 6 (Ivan, STLC 115)

Section 6 (Akash, 160-B35)

Section 6 (Amrita, Online)

Fri, Feb 24

Section 6 (Apoorva, 200-034)

Section 6 (Lucy, Y2E2 111)

Mon, Feb 27

Lecture 13: More Dynamic Programming: LCS, Knapsack, Independent Set (Nima)

Wed, Mar 1

Lecture 14: Greedy Algorithms (Nima)

Release Homework 7

DueHomework 6

Thu, Mar 2

Section 7 (Ivan, STLC 115)

Section 7 (Akash, 160-B35)

Section 7 (Amrita, Online)

Fri, Mar 3

Section 7 (Apoorva, 200-034)

Section 7 (Lucy, Y2E2 111)

Mon, Mar 6

Lecture 15: Minimum Spanning Trees (Moses)

Wed, Mar 8

Lecture 16: Max-Flow and the Ford-Fulkerson Algorithm (Moses)

Release Homework 8

DueHomework 7

Thu, Mar 9

Section 8 (Ivan, STLC 115)

Section 8 (Apoorva, 200-034)

Section 8 (Akash, 160-B35)

Section 8 (Amrita, Online)

Fri, Mar 10

Section 8 (Lucy, Y2E2 111)

Mon, Mar 13

Lecture 17: Stable Matchings and Gale-Shapley (Moses)

Wed, Mar 15

Lecture 18: What's next? (Moses)

DueHomework 8

Thu, Mar 16

Section 9 (Ivan, STLC 115)

Section 9 (Apoorva, 200-034)

Section 9 (Akash, 160-B35)

Section 9 (Amrita, Online)

Fri, Mar 17

Section 9 (Lucy, Y2E2 111)

Thu, Mar 23

Exam 2: Final