Skip to main content
Wikispaces Classroom is now free, social, and easier than ever.
Try it today.
guest

Join

Help

Sign In
guest
Join

Help

Sign In
50004
Home
Home
pages
changes
Favorites
20
All Pages
20
Home
Class Schedule
Instructors
Reference and Resources
Grading
Policies
Announcements
Add
Add "All Pages"
Done
Class Schedule
Edit
0
163
…
0
Tags
No tags
Notify
RSS
Backlinks
Source
Print
Export (PDF)
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 13)
3Oct, 12pm1pm
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: BellmanFord algorithm
s10.2: Quiz 2
Weekly Homework 10
Deadline: Next Tue 3pm
Quiz 2
(Week 49)
14Nov, 12pm1pm
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://50002.wikispaces.com/2D+Design+Challenge+2014**
Javascript Required
You need to enable Javascript in your browser to edit pages.
help on how to format text
Turn off "Getting Started"
Home
...
Loading...
Week 1's Monday lecture = s1.1
Week 1's Tuesday/Wednesday recitation = s1.2
CLRS = the very famous textbook
Course material
s1.2: Document distance
s2.2: Master theorem
Deadline: Next Tue 3pm
s3.2: Heap
Deadline: Next Tue 3pm
s4.2: Quiz 1
Deadline: Next Tue 3pm
3Oct, 12pm1pm
s5.2: Hashing
Submission deadline:
31Oct 3pm
s6.2: Graph, BFS
s6.3: 2D Project briefing
Deadline: 7Nov 3pm
s9.2: Dijkstra's algorithm
Submission deadline:
28Nov 3pm
s10.2: Quiz 2
Deadline: Next Tue 3pm
14Nov, 12pm1pm
s11.2: Dynamic Programming
Deadline: Next Tue 3pm
s12.2: Dynamic Programming
Deadline: Next Tue 3pm
s13.2: P & NP
**http://50002.wikispaces.com/2D+Design+Challenge+2014**