Staff and channels
- CS224 Advanced Algorithms, taught by Jelani Nelson, with one TF (Jeffery); staff contact is the course mailing address
0:00. - No URL was written on the board: find the course site via the instructor's page, and sign up for the mailing list there
0:47,1:06.
Grading breakdown
| Component | Weight | Notes |
|---|---|---|
| Scribing | 10% | Effectively free credit — you do it, you get it 1:26 |
| P-sets | 60% | Written only, no programming 2:16 |
| Final project | 30% | Written, due last day of reading period 2:16 |
Rules that shape the work
- No textbook. Students take turns scribing lecture notes in LaTeX from a website template; lectures are recorded so you can fill gaps
1:59,2:16. - One person scribes each lecture; notes are due 9:00 PM the following day, and the instructor may edit them afterward
5:05,5:20,5:59. - Scribe notes must carry references (conference/journal + year), which is why the lecturer states them on the board
19:36,20:23. - Final project: proposal around October 30, then roughly six weeks of work; the instructor reads proposals and gives feedback
2:44,3:26. - P-sets are LaTeXed, emailed, and have page limits — deliberately, to discourage padding when you don't know an answer; brief solutions are appreciated
3:26,3:59. - Every student must grade at least once: teams of 3–4 students plus the TF meet once per P-set. Scribing and grading slots are first come, first served
4:19,4:36.
CS124 vs. CS224
- Algorithms is broad: a full semester of CS124 does not cover all topics
6:50. - CS224 adds new models and new measures of efficiency not seen in 124, and is more theory-focused — no programming assignments (an implementation option exists only for the final project)
7:12,7:29.