Week 1

Introduction to Algorithms, Proofs, Algorithm Analysis
Why Do We Do Proofs? - Check out the annotated slides. You can download the whole lecture/resources and then listen to the lecture.

Guides to Proofs, including by induction

Problem: Stable Matching
Shapley wins Nobel prize in Economics

Kleinberg & Tardos: Preface, Chapters 1--2

Priority queues and Heaps
Kleinberg & Tardos, Chapter 2

Graphs
Kleinberg & Tardos: Chapter 3

Wiki due Monday at 11:59 p.m. (2.3, 2.4)

Problem Set 2 due Friday
PS2 FAQ
Starter Python 3 Code for Chapter 2, Exercise 6

Problem Set 3 handed out

Week 5

Directed Graphs
Topological Ordering
K & T: Chapter 3

Greedy Algorithms: Intro
K & T: Chapter 4

Wiki due Tuesday (finishing Chapter 3 -- 3.2-3.6)

Problem Set 4 due Friday

PS4 FAQ

Exam 1 handed out.

Greedy Algorithms: Interval scheduling, Minimizing max lateness, Shortest paths

How to write Greedy Stays Ahead Proofs and Greedy Exchange Proofs (continued)

Week  

Week 8

Greedy Algorithms: Data Compression - Huffman Codes

Divide and Conquer Algorithms: Recurrence relations, Counting inversions

K&T 5.1, 5.2, 5.3

Wiki due Monday (4.5-4.7)
Problem Set 6 due Friday
Problem Set 7 handed out

Exam 2 FAQ

No wiki

Problem Set 8 handed out

Week 12

Writing a Network Flow Proof

Wiki Due Monday (7.1-7.2, 7.5, 7.7)

Problem Set 9 due
Python3 template file, Java template file
Data file and Expected Output files
To extract the data/output files in a Linux terminal:
tar xfz neruda.tgz

Fill out course evaluation

Final Exam handed out

Read The status of the P versus NP problem. For a gentler intro to The math problem that could change the world: Does P = NP?

Week