Mon, Jan 8

Lecture 1: Why are you here? (Nima)

Wed, Jan 10

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

Release Homework 1

Thu, Jan 11

Section 1 (Jonathan, BLDG 160 Rm. 129)

Section 1 (Jeff, Online)

Fri, Jan 12

Section 0.5: Big-O, Complexity, and Induction (Review Section) (Arpita, Skilling auditorium)

Section 1 (Junyao, MCCULL 126)

Section 1 (Samantha, MCCULL 126)

Section 1 (Joey, BLDG 200 Rm. 107)

Wed, Jan 17

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

DueHomework 1

Release Homework 2

Thu, Jan 18

Section 2 (Jonathan, BLDG 160 Rm. 129)

Section 2 (Jeff, Online)

Fri, Jan 19

Section 2 (Junyao, MCCULL 126)

Section 2 (Samantha, MCCULL 126)

Section 2 (Joey, BLDG 200 Rm. 107)

Mon, Jan 22

Lecture 4: Median and Selection (Nima)

Wed, Jan 24

Lecture 5: Randomized Algorithms and QuickSort (Nima)

DueHomework 2

Release Homework 3

Thu, Jan 25

Section 3 (Jonathan, BLDG 160 Rm. 129)

Section 3 (Jeff, Online)

Fri, Jan 26

Section 3 (Junyao, Thornton 211)

Ethics 1 (Dan)

Section 3 (Samantha, MCCULL 126)

Section 3 (Joey, BLDG 200 Rm. 107)

Mon, Jan 29

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

Wed, Jan 31

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

DueHomework 3

Release Homework 4

Thu, Feb 1

Section 4 (Jonathan, BLDG 160 Rm. 129)

Section 4 (Jeff, Online)

Fri, Feb 2

Section 4 (Junyao, MCCULL 126)

Section 4 (Samantha, MCCULL 126)

Section 4 (Joey, BLDG 200 Rm. 107)

Mon, Feb 5

Lecture 8: Hashing (Nima)

Wed, Feb 7

Lecture 9: Graphs and BFS and DFS (Nima)

DueHomework 4

Thu, Feb 8

Section 5 (Jonathan, BLDG 160 Rm. 129)

Section 5 (Jeff, Online)

Fri, Feb 9

Section 5 (Junyao, GESB 131)

Section 5.5: Midterm Review (Review Section) (Jeff, Skilling auditorium)

Section 5 (Samantha, MCCULL 126)

Section 5 (Joey, BLDG 200 Rm. 107)

Mon, Feb 12

Lecture 10: Strongly Connected Components (Moses)

Wed, Feb 14

Lecture 11: Dijkstra and Bellman-Ford (Moses)

Release Homework 5

Thu, Feb 15

Exam 1: Midterm

Wed, Feb 21

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

DueHomework 5

Release Homework 6

Thu, Feb 22

Section 6 (Jonathan, BLDG 160 Rm. 129)

Section 6 (Jeff, Online)

Fri, Feb 23

Section 6 (Junyao, MCCULL 126)

Section 6 (Samantha, MCCULL 126)

Section 6 (Joey, BLDG 200 Rm. 107)

Mon, Feb 26

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

Wed, Feb 28

Lecture 14: Greedy Algorithms (Moses)

DueHomework 6

Release Homework 7

Thu, Feb 29

Section 7 (Jonathan, BLDG 160 Rm. 129)

Section 7 (Jeff, Online)

Fri, Mar 1

Section 7 (Junyao, GESB 131)

Ethics 2 (Dan)

Section 7 (Samantha, MCCULL 126)

Section 7 (Joey, BLDG 200 Rm. 107)

Mon, Mar 4

Lecture 15: Minimum Spanning Trees (Nima)

Wed, Mar 6

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

DueHomework 7

Release Homework 8

Thu, Mar 7

Section 8 (Jonathan, BLDG 160 Rm. 129)

Section 8 (Jeff, Online)

Fri, Mar 8

Section 8 (Junyao, GESB 131)

Section 7.5: General Review (Review Section) (Jonathan, Skilling auditorium)

Section 8 (Samantha, MCCULL 126)

Section 8 (Joey, BLDG 200 Rm. 107)

Mon, Mar 11

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

Wed, Mar 13

Lecture 18: What's next? (Moses)

DueHomework 8

Thu, Mar 14

Section 9 (Jonathan, BLDG 160 Rm. 129)

Section 9 (Jeff, Online)

Fri, Mar 15

Section 9 (Junyao, GESB 131)

Section 8.5: General Review (Review Section) (Samantha, Skilling auditorium)

Section 9 (Samantha, MCCULL 126)

Section 9 (Joey, BLDG 200 Rm. 107)

Mon, Mar 18

Exam 2: Final