| Week 1 | Introduction to Computer Science, Stable Marriage, and Bipartite Matching | Reading/Notes | slides |
| Week 2 | Introduction to Computing; Graphs and Web Search |
Kleinberg (read 10 pgs.) Notes | Slides |
| Week 3 | Introduction to Ruby | Ruby Notes | Read Forum |
| Week 4 | Euclid's GCD | Notes | Read Forum |
| Week 5 | Friend Recommendations
in Facebook Arrays and Binary Search |
Notes 1 Notes 2 | Read Forum |
| Week 6 | Exam Review and Exam 1 | Sample Exam Binary Search in Ruby | Read Forum |
| Week 7 | Graph representation | Notes | Read Forum |
| Week 8 | Graph Algorithms and Systems | Notes(updated on 10/22) | Read Forum |
| Week 9 | Operating Systems/Internet and Shortest Paths Routing | Notes | Video |
| Week 10 | Shortest Paths Routing/Google Talk | See notes from week9 | Read Forum |
| Week 11 | Internet and Review (Shortest Paths) | Max index in Ruby | Read Forum |
| Week 12 | EXAM 2 and Data Communication | Notes | Read Forum |
| Week 13 | Retransmission protocols and Thanksgiving | ??? | Read Forum |
| Week 14 | Using Circuits to Compute and AI | Notes | Read Forum |
| Week 15 | Crytography and Complexity | No Notes | Bubble Sort Quick Sort |