Notation:
Week 1's Monday lecture = s1.1
Week 1's Tuesday/Wednesday recitation = s1.2
CLRS = the very famous textbook

Course material


Week
Topic
Homework, Project
Quiz, Exam
1: 12Sep
s1.1: Complexity, Asymptotic notation
s1.2: Document distance


2: 19Sep
s2.1: Sorting, guest talk by JP Morgan
s2.2: Master theorem
Weekly Homework 2
Deadline: Next Tue 3pm

3: 26Sep
s3.1: Heap
s3.2: Heap
Weekly Homework 3
Deadline: Next Tue 3pm

4: 3Oct
s4.1: BST, AVL tree, Linear time sorting
s4.2: Quiz 1
Weekly Homework 4
Deadline: Next Tue 3pm
Quiz 1 (Week 1-3)
3Oct, 12pm-1pm
5: 10Oct
s5.1: Hashing
s5.2: Hashing
Problem set 1
Submission deadline:
31Oct 3pm

6: 17Oct
s6.1: Graph, BFS
s6.2: Graph, BFS
s6.3: 2D Project briefing
Weekly Homework 6
Deadline: 7Nov 3pm

7: 24Oct
No lecture (recess week)


8: 31Oct
No lecture (2D project)


9: 7Nov
s9.1: Single source shortest path
s9.2: Dijkstra's algorithm
Problem set 2
Submission deadline:
28Nov 3pm

10: 14Nov
s10.1: Bellman-Ford algorithm
s10.2: Quiz 2
Weekly Homework 10
Deadline: Next Tue 3pm
Quiz 2 (Week 4-9)
14Nov, 12pm-1pm
11: 21Nov
s11.1: Dynamic Programming
s11.2: Dynamic Programming
Weekly Homework 11
Deadline: Next Tue 3pm

12: 28Nov
s12.1: Dynamic Programming
s12.2: Dynamic Programming
Weekly Homework 12
Deadline: Next Tue 3pm

13: 5Dec
s13.1: P & NP
s13.2: P & NP


14: 12Dec
No lecture (Final examination week)

Final exam

**http://50-002.wikispaces.com/2D+Design+Challenge+2014**