CS 200
|
Computer Science from Ada and Euclid to Quantum Computing and the World Wide Web |
Spring 2004 | |
Schedule - Problem Sets - Exams - Lectures - Syllabus - Links |
Problem Sets
- Problem Set 1: Making Mosaics (Out: 15 Jan, Due: 22 Jan) - Divide-and-Conquer Problem Solving, Introduction to Procedures
- Problem Set 2: Procedurally Predicting Presidential Primaries (Out: 21 Jan, Due: 2 Feb) - Recursion, High-Order Procedures [My Answers]
- Problem Set 3: L-System Fractals (Out: 2 Feb, Due: 11 Feb) - Lists, List Recursion [Comments]
- Problem Set 4: The Lorenz Cipher and the Postman's Computer (Out: 11 Feb, Due: 16 Feb) - Review for Exam 1 [Comments]
- Problem Set 5: Wahoo! Auctions (Out: 23 Feb, Due: 5 March) - State and Mutation, Orders of Growth [Comments]
- Problem Set 6: Adventures in Charlatansville (Out: 5 March, Due: 29 March) - Programming with Objects [Comments]
- Problem Set 7: Building Web Communities (Out: 29 March, Due: 7 April) [Comments]
- Problem Set 8: ...and the World Wide Web (Out: 29 March, Due: 7, 12 and 26 April)
|
cs200-staff@cs.virginia.edu Using these Materials |