Lectures

Descriptions
Lectures by Topic
Course Summary (with links to lectures)

Class 1: Introduction (Notes)
Class 2: Formal Systems and Languages (Notes)
Class 3: Rules of Evaluation (Notes)
Class 4: Evaluation and Recursion (Notes)
Class 5: Beware the Bunnies! (Notes)
Class 6: Recursing Recursively (GEB Chapter V) (Notes)
Class 7: Do be do be (no slides) (Notes)
Class 8: Cons car cdr sdr wdr (Notes)
Class 9: The Great Lambda Tree of Knowledge and Power (Notes)
Class 10: Barista Assista (Notes only)
Class 11: All Sorts (Notes)
Class 12: Quicksorting (Notes)
Class 13: Astrophysics and Cryptology (Notes)
Class 14: P = NP? (Notes)
Class 15: Intractable Problems (Smiley Puzzles and Curing Cancer) (Notes)
Class 16: Knapsack Problem (Exam Review) (Notes)
Class 17: Exam 1
Class 18: Mutation (Notes)
Class 19: Environments (Notes)
Class 20: Objects (Notes)
Class 21: Inheritance (Notes)
Class 22: Gödel's Theorem (Notes)
Class 23: Computability (Notes)
Class 24: Problem Classification Practice (Notes only)
Class 25: Metalinguistics (Notes)
Class 26: The Metacircular Evaluator (Notes)
Class 27: In Praise of Idleness (Notes)
Class 28: Types of Types (Notes)
Class 29: Typed Scheme (Notes from Class 28)
Class 30: Exam 2
Class 31: Networks, The Internet and the World Wide Web (Notes)
Class 32: How to Build a Dynamic Web Site (Notes)
Class 34: Modeling Computation (Notes)
Class 35: Lambda Calculus (Notes)
Class 36: The Meaning of Truth (Notes)
Class 37: Making Numbers, Lists and Recursion from Glue Alone (Notes)
Class 38: Fixed Points and Biological Computing (Notes)
Class 39: Review (Notes)
Class 40: Jeopardy (Notes)

University of Virginia Department of Computer Science CS 200: Computer Science

David Evans evans@virginia.edu Using these Materials