CS 200
|
Computer Science from Ada and Euclid to Quantum Computing and the World Wide Web |
Spring 2003 | |
Schedule - Problem Sets - Exams - Lectures - Syllabus - Links |
CS200 - Problem Sets
- Problem Set 1: Mosaics (Out: 15 Jan, Due: 22 Jan) - Introduction, Divide-and-Conquer Problem Solving, Procedures
- Problem Set 2: Function Fractals (Out: 22 Jan, Due: 3 Feb) - Recursion, High-Order Procedures [Comments]
- Problem Set 3: L-System Fractals (Out: 4 Feb, Due: 12 Feb) - Lists, List Recursion [Comments]
- Problem Set 4: The Lorenz Cipher and the Postman's Computer (Out: 12 Feb, Due: 19 Feb) - Review for Exam 1 [Comments]
- Problem Set 5: Wahoo! Auctions (Out: 24 Feb, Due: 14 March) - State and Mutation [Comments]
- Problem Set 6: Adventures in Charlatansville (Out: 14 March, Due: 24 March) - Programming with Objects [Comments]
- Problem Set 7: Quantum Computing (Out: 24 March, Due: 4 April) - Languages as Abstractions, Metacircular Evaluator [Comments]
- Problem Set 8: ...and the World Wide Web (Out: 4 April, Due: 28 April)
|
cs200-staff@cs.virginia.edu Using these Materials |