Class 1: Introduction [Notes]
Class 2: Language [Notes]
Class 3: Rules of Evaluation [Notes]
Class 4: Making Procedures [Notes]
Class 5: Procedure Practice [Notes]
Class 6: Programming with Data [Notes]
Class 7: Programming with Lists [Quiz 1 (PDF)]
Class 8: Programming with Lists [Notes]
Class 9: Consistent Hashing [Slides] [Notes]
Class 10: Abstracting List Procedures [Notes]
Class 11: Deeper List Procedures [Slides] [Notes]
Class 12: Computing Machines [Slides] [Quiz 2 (PDF)]
Class 13: Digital Logic [Slides] [Notes]
Class 14: Turing's Model [Slides] [Notes]
Class 15: Where are the Bagels? [Notes]
Class 16: Making Loops [Slides] [Notes]
Class 17: Golden Sneezewort [Slides] [Notes]
Class 18: Measuring Cost [Slides] [Notes])
Class 19: Analyzing Algorithms [Slides] [Notes]
Class 20: Running Time [Slides]
Class 21: Changing State [Slides] [Notes]
Class 22: Stateful Evaluation Rules [Slides] [Notes]
Class 23: Programming with State and Genetic Algorithms (guest lecture by Westley Weimer) (Slides [PDF])
Class 24: Imperative Programming [Slides] [Notes] [Code]
Class 25: Reversing Reverse [Slides]
Class 26: Objectifying Objects [Slides] [Notes]
Class 27: Pythonic Objects [Slides]
Class 28: Entropy [Slides] [Notes]
Class 29: Trick-or-Treat Protocols [Slides] [Notes]
Class 30: Sex, Religion, and Politics [Slides]
Class 31: Dictionaries [Slides] [Notes] [Code]
Class 32: Interpreters [Slides] [Notes]
Class 33: Diving Deep (guest lecture by Ivan Alagenchev) [Slides] [Notes]
Class 34: Unprovability [Slides] [Notes]
Class 35: Self-Reference [Slides]
Class 36: Halting Problem [Slides] [Notes]
Class 37: Computability in Theory and Practice [Slides]
Class 38: The Internet [Slides] [Notes]
Class 39: ...and the World Wide Web [Slides]
Class 40: Research (Notes: [PDF])
Class 41: The Cake of Computing
It may just be me, but Fridays seem to be a bad day to submit the Problem Sets. I get most of my work done on Sunday and throughout the week I am very busy.
Also ElevenLearning.com is fine, it would be better with a “Find” Feature
Yes, it would be useful to have a search in book, which doesn’t seem to exist. Note with google you can do searches across the PDFs by using site:computingbook.org in your search. For example,
I agree with Michael. Problem sets would be much easier to manage if they were due after the weekend rather than before.
Most of the remaining problem sets are scheduled to be due on non-Fridays (except PS5 which is scheduled for Oct 21), so hopefully that will help. (I should note, though, that there is more that a week for every problem set, so if you find it easier to schedule your work over a weekend you can always start early even for a problem set due on a Friday!)
Is there a place on this website or elsewhere for us to check our grades and progress in the class?
Not yet, but I’ll make the grades available for you to check sometime after Exam 1.
Awesome. Thank you.
Will we be able to view our PS and Quiz grades as well?
Will we be able to view our PS and quiz grades as well?
Yes, you’ll be able to see all your grades.
Where/When will you be posting them?
I sense from the questions, you are wanting this because you don’t know your grades on some of the assignments. This isn’t the point of me posting the grades. It is only so you can verify that I have grades recorded correctly. I won’t post grades for assignments that haven’t yet been collected, since I don’t want students to substitute carefully reading our comments on your assignments/exams, for seeing just the posted score.
So, the grades will be posted before the end of the semester (but probably a bit before that), but only grades for assignments that have already been collected.
You must be logged in to post a comment.