CS 401 Lecture slides

Back to main page for CS 401

Date Topic   Reading     Slides     Homework  
Jan 9 Stable Matching KT 1.1 Lecture 1
Jan 11 Stable Matching KT 1.1 Lecture 2
Jan 16 Representative Problems / Running Time Analysis KT 1.2, 2.1, 2.2 Lecture 3
Jan 18 Running Time Analysis KT 2.2, 2.4 Lecture 4
Jan 23 Running Time Analysis KT 2.2, 2.4 Lecture 5
Jan 25 Efficiency / Graph KT 3.1, 3.2 Lecture 6 Homework 1
Jan 30 BFS KT 3.2, 3.3 Lecture 7
Feb 1 BFS / DFS KT 3.2, 3.3, 3.4 Lecture 8
Feb 6 DFS / Topological Ordering KT 3.5, 3.6 Lecture 9
Feb 8 Interval Scheduling KT 4.1 Lecture 10 Homework 2
Feb 13 Interval Scheduling / Interval Partitioning KT 4.1 Lecture 11
Feb 15 Interval Partitioning / Lateness Maximization KT 4.1, 4.2 Lecture 12
Feb 15 Lateness Maximization / Shortest Path KT 4.2, 4.4 Lecture 13
Feb 22 Shortest Path / MST KT 4.4, 4.5 Lecture 14
Feb 27 Midterm Review Lecture 15
Feb 29 Midterm Exam
Feb 27 Merge Sort / Counting Inversions KT 5.1, 5.3 Lecture 16
Mar 7 Counting Inversions / Binary Search KT 5.3 Lecture 17
Mar 12 Master Theorem / Closest Points KT 5.2, 5.4 Lecture 18
Mar 14 Closest Points / Integer and Matrix Multiplication KT 5.4, 5.5 Lecture 19
Mar 19 and 21 Spring Break Homework 3
Mar 26 Weighted Inteverl Scheduing KT 6.1 Lecture 20
Mar 28 Weighted Inteverl Scheduing / Segmented Least Squares KT 6.1, 6.2, 6.3 Lecture 21
April 2 Segmented Least Squares / Knapsack KT 6.3, 6.4 Lecture 22
April 4 Knapsack / RNA Secondary Structure KT 6.4, 6.5 Lecture 23 Homework 4
April 9 RNA Secondary Structure / Negative Shortest Path KT 6.5, 6.8 Lecture 24
April 11 Polynomial Reduction KT 8.1 Lecture 25
April 16 Polynomial Reduction KT 8.1 Lecture 26
April 18 Polynomial Reduction / P and NP KT 8.1, 8.3 Lecture 27 Homework 5
April 23 NP / NP-Complete KT 8.3, 8.4 Lecture 28
April 25 NP-Complete / Final Exam Review KT 8.4 Lecture 29