Upcoming Deadlines / Events
- Mon Oct 13
- Guided Problem Set 6 (9pm)
- Tue Oct 14
- Homework 6 (9pm)
- Fri Oct 17
- Drop deadline (11:59pm)
- Mon Oct 20
- Guided Problem Set 7 (9pm)
- Tue Oct 21
- Homework 7 (9pm)
Recent Announcements
- Wed Oct 8
- Homework 5 solutions are available. Pirates are in this year.
- Sat Oct 3
- Homework policy clarifications / reminders:
-
For homework problems with mulitple subproblems ((a), (b), etc.), you must include a list of sources and collaborators and (if necessary) an LLM transcript/link at the end of each lettered subproblem. Yes, even if the list is empty, and even if the list is the same for each subproblem.
Please also remember to start your solution to each subproblem on a new page of your submitted PDF.
-
You are welcome to use tools in your homework solutions that are not part of the official course materials and are not covered in prerequisite courses. (Examples include the pumping lemma for regular languages, language homomorphisms, the ”master“ theorem, actually-O(1)-time hashing, “segment trees” according to computational geometers, “segment trees” according to competitive programmers, suffix arrays, constant-time range-minimum queries, KMP/z-function string matching, and planar 3SAT.)
However, your solutions must be understandable to someone who only knows the official course material and prerequisites. For each outside tool you use, your solution must include a self-contained description of that tool (including pseudocode if your tool is an algorithm), and either a proof or a reliable reference for every claim you make about that tool (including correctness and running time). LLMs, Geeks4Geeks, and Wikipedia are not reliable references.
-
For homework problems with mulitple subproblems ((a), (b), etc.), you must include a list of sources and collaborators and (if necessary) an LLM transcript/link at the end of each lettered subproblem. Yes, even if the list is empty, and even if the list is the same for each subproblem.
- Tue Sep 30
-
- Solutions for Midterm 1 are available.
- Solutions for Conflict Midterm 1 are available.
- Sun Sep 28
-
- Another slightly different set of Midterm 1 Practice 2 solutions is available, along with a wwalkthrough video, this time with sound! (Sorry about the audio screwup on the first video.)
- Solutions and a walkthrough video for Midterm 1 Practice 3 are available.
- Fri Sep 26
- Midterm 1 Practice 2 solutions are available.
- Thu Sep 25
- Midterm 1 Practice 1 solutions are available. Anything edited or added after today's lecture period is written in a darker color. There is an alternative solution to Problem 1(b) given in the scratch notes, but please remember we will only grade the first solution you submit for each problem.
- Web Sep 24
- Homework 4 solutions are available.
- ∞
- Earlier announcements
Illam vero methodum calculi mechanici taedium magis minuere, praxis tentantem docebit.
[Truly, this method greatly reduces the tedium of mechanical calculation; practice will teach those who try.]
[Truly, this method greatly reduces the tedium of mechanical calculation; practice will teach those who try.]
— Carl Friedrich Gauß,
“Theoria interpolationis methodo nova tractata” (c. 1805)
Dealing with failure is easy: Work hard to improve.
Success is also easy to handle: You’ve solved the wrong problem. Work hard to improve.
Success is also easy to handle: You’ve solved the wrong problem. Work hard to improve.
— Alan Perlis, “Epigrams on Programming” (1982)
— Clay Shirky (2011)
The only way to learn is by playing, the only way to win is by learning,
and the only way to begin is by beginning. So without further ado, let's begin.
— Sam Reich, Game Changer (2019–present)