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 Schedule

January and February

March 2003

SundayMondayTuesdayWednesdayThursdayFridaySaturday
9 10

Class 18, Notes (Gödel)

11 12

Class 19, Notes (Computability)

13 14

Class 20, Notes (Objects)
Due: Problem Set 5
Out: Problem Set 6

15
16 17

Class 21, Notes (Inheritance)

18 19

Class 22, Notes (P =? NP)

20 21

Class 23, Notes (Intractable Problems)

22
23 24

Class 24, Notes (Metalinguistics)
Due: Problem Set 6
Out: Problem Set 7

25 26

Class 25, Notes (Evaluator)

27 28

Class 26, Notes (Laziness)

29

April

SundayMondayTuesdayWednesdayThursdayFridaySaturday
30 March 31 March

Class 27, Notes (Types)
Due: PS8 Team Requests (optional)

1 2

Class 28, Notes (Networking)

3 4

Class 29, Notes (Web Sites / Pancakes, Puzzles and Polynomials)
Due: Problem Set 7
Out: Problem Set 8

5
6 7

Team work day

8 9

Class 30, Notes (Modeling Computation)

10 11

Class 31, Notes (Lambda Calculus)

12

13 14

Class 32, Notes (Meaning of Truth)

15 16

Class 33, Notes (Numbers)

17 18

Class 34, Notes (TBA)
Out: Exam 2

19
20 21

Class 35, Notes (Client Authentication)

22 23

Class 36, Notes (PKC)
Due: Exam 2

24 25

Class 37, Notes (Meaning of Life, Course Recap)

26
27 28

Class 38, Notes
(Site Demos)
Due: Problem Set 8
Out: Final Exam

29

Last day of classes

30 1 May 2 May 3 May

CS 200


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

cs200-staff@cs.virginia.edu
Using these Materials