University of Virginia Computer ScienceCS150: Computer Science, Fall 2005 |

Class 1: Introduction [PPT, PDF] (Notes)
What is Computer Science?Class 2: Formal Systems and Languages [PPT, PDF] (Notes) Formal SystemsClass 3: Rules of Evaluation [PPT, PDF] (Notes) Language ElementsClass 4: Programming with Data [PPT, PDF] (slides not used in class) (Notes) Making dataClass 5: Recursing on Lists [PPT, PDF] (Notes) Making cons, car, and cdrClass 6: List Recursion (Notes only)
Class 7: Recursion Practice (Notes only) How to define recursive procedures Class 8: Recursing Recursivey [PPT, PDF] (Notes) Recursive Procedures Class 9: On On and Off Grounds Sorting [PPT, PDF] (Notes) PS2: Data AbstractionClass 10: Quicker Sorting [PPT, PDF] (Notes) Measuring Work: Theta NotationClass 11: Golden Ages, Orders of Growth, and Astrophysics [PPT, PDF] (Notes) Simulating the UniverseClass 12: Quickest Sorting [PPT, PDF] (Notes) Binary TreesClass 13: Problems [PPT, PDF] (Notes) Problems and ProceduresClass 14: Intractable Problems [PPT, PDF] (Notes) Smileys PuzzleClass 15: P vs. NP (Smiley Puzzles and Curing Cancer) [PPT, PDF] Smileys ProblemClass 16: NP-Completeness [PPT, PDF] Complexity Classes |
Class 17: Sex, Religion, and Politics [PPT, PDF]
PS4, Question 1fClass 18: Mutation (slides lost) Class 19: Environments [PPT, PDF] (Notes) Class 20: Objects [PPT, PDF] (Notes) (These slides were not actually used in class) Class 21: Purpose of College (No slides or notes) Class 22: Inheritance [PPT, PDF] (Notes) Class 23: Gödel's Theorem [PPT, PDF] (Notes) PS5, PS6Class 24: Computability [PPT, PDF] (Notes) Proofs and Proof CheckingClass 25: Undecidable Problems [PPT, PDF] (Notes) Proving UndecidabilityClass 26: Modeling Computing [PPT, PDF] (Notes) Modeling ComputingClass 27: Universal Turing Machines [PPT, PDF] (Notes) Describing Turing MachinesClass 28: The Meaning of Truth [PPT, PDF] (Notes) Lambda CalculusClass 29: Trick-or-Treat Protocols [PPT, PDF] (Notes) NetworkingClass 30: Vocational Skills [PPT, PDF] (Notes) Who Invented the Internet?Class 31: Cookie Monsters and Semi-Secure Websites [PPT, PDF] (Notes) (These slides were not used because we had class outside.) Class 32: Computability in Theory and Practice [PPT, PDF] (Notes) Making NumbersClass 33: Computing with Photons [PPT, PDF] (Notes) Church-Turing ThesisClass 34: Computing with Life, Life Computing [PPT, PDF] DNA ComputersClass 35: Decoding DNA [PPT, PDF] (Notes) Human Genome ProjectClass 36: Public-Key Cryptography [PPT, PDF] (Notes) Key Distribution ProblemClass 37: How to Find Aliens [PPT, PDF] (Notes) Distributed ComputingClass 38: Googling Google [PPT, PDF] (Notes) Crawling the Web |

CS 150: Computer ScienceUniversity of Virginia |
evans@cs.virginia.eduUsing these Materials |