Mon, Jan 3

Lecture 1: Why are you here? (Moses; Online)

Wed, Jan 5

Lecture 2: Asymptotics, Worst-Case Analysis, and MergeSort (Moses; Online)

Release Homework 1

Thu, Jan 6

Section 1 (Jose; Online)

Section 1 (Amrita; Online)

Section 1 (Samar; Online)

Fri, Jan 7

Section 1 (Jerry; Online)

Mon, Jan 10

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

Wed, Jan 12

Lecture 4: Median and Selection (Nima; Online)

Release Homework 2

DueHomework 1

Thu, Jan 13

Section 2 (Jose; Online)

Section 2 (Amrita; Online)

Section 2 (Samar; Online)

Fri, Jan 14

Section 2 (Jerry; Online)

Wed, Jan 19

Lecture 5: Randomized Algorithms and QuickSort (Moses; Online)

Release Homework 3

DueHomework 2

Thu, Jan 20

Section 3 (Jose; Online)

Section 3 (Amrita; Online)

Section 3 (Samar; Online)

Fri, Jan 21

Section 3 (Jerry; Online)

Mon, Jan 24

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

Wed, Jan 26

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

Release Homework 4

DueHomework 3

Thu, Jan 27

Section 4 (Jose; 200-202)

Section 4 (Amrita; Encina West 108)

Section 4 (Samar; 120-59; recorded)

Fri, Jan 28

Section 4 (Jerry; 200-219)

Mon, Jan 31

Lecture 8: Hashing (Nima)

Wed, Feb 2

Lecture 9: Graphs and BFS and DFS (Nima)

DueHomework 4

Thu, Feb 3

Section 5 (Jose; 200-202)

Section 5 (Amrita; Encina West 108)

Section 5 (Samar; 120-59; recorded)

Fri, Feb 4

Section 5 (Jerry; 200-219)

Mon, Feb 7

Release Exam 1

Lecture 10: Strongly Connected Components (Moses)

Tue, Feb 8

DueExam 1

Wed, Feb 9

Lecture 11: Dijkstra and Bellman-Ford (Moses)

Release Homework 5

Thu, Feb 10

Section 6 (Jose; 200-202)

Section 6 (Amrita; Encina West 108)

Section 6 (Samar; 120-59; recorded)

Fri, Feb 11

Section 6 (Jerry; 200-219)

Mon, Feb 14

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

Wed, Feb 16

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

Release Homework 6

DueHomework 5

Thu, Feb 17

Section 7 (Jose; 200-202)

Section 7 (Amrita; Encina West 108)

Section 7 (Samar; 120-59; recorded)

Fri, Feb 18

Section 7 (Jerry; 200-219)

Wed, Feb 23

Lecture 14: Greedy Algorithms (Nima)

Release Homework 7

Thu, Feb 24

Section 8 (Jose; 200-202)

Section 8 (Amrita; Encina West 108)

Section 8 (Samar; 120-59; recorded)

DueHomework 6

Fri, Feb 25

Section 8 (Jerry; 200-219)

Mon, Feb 28

Lecture 15: Minimum Spanning Trees (Moses)

Wed, Mar 2

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

Release Homework 8

Thu, Mar 3

Section 9 (Jose; 200-202)

Section 9 (Amrita; Encina West 108)

Section 9 (Samar; 120-59; recorded)

DueHomework 7

Fri, Mar 4

Section 9 (Jerry; 200-219)

Mon, Mar 7

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

Wed, Mar 9

Lecture 18: What's next? (Nima)

DueHomework 8

Thu, Mar 10

Section 10 (Jose; 200-202)

Section 10 (Amrita; Encina West 108)

Section 10 (Samar; 120-59; recorded)

Fri, Mar 11

Section 10 (Jerry; 200-219)

Wed, Mar 16

Release Exam 2

DueExam 2