Spring 2015
Last update: 10 Feb.
Date | Reading | ||
---|---|---|---|
Jan 13 | CL preamble, CL1 / A1 | Introduction; historical background | |
15 | CN1, CN2 | Algorithms; representing data, numerals | |
22 | Binary numerals Lab 0: Data | ||
24 | Numerals Finish Lab 0: Data | ||
27 | CN3a | Logic and circuits | |
29 | CN3b | Quiz Lab 1: Circuits | |
Feb 3 | Faculty development workshop | ||
5 | Modules; circuit technologies Lab 2: Modules, ALU | ||
10 | Time and feedback in circuits Finish Lab 2: Modules, ALU | Lab 1 due | |
12 | Memories Lab 3: Sequential circuits, memories | Lab 2 due | |
17 | CN4 | Computer organization, hardware and software | Quiz 1 rework due |
19 | CN5 | Programming languages, programs | Lab 3 due |
24 | CN6 | Intellectual property; review | |
26 | Exam | ||
Mar 3 | CL3 / A6 | algorithms and complexity | |
5 | complexity | ||
9-13 | Spring break | ||
17 | A9 | automata and Turing machines | |
19 | Lab 4: machines | ||
24 | universality | ||
26 | correctness | ||
31 | CL2 / A8 | computability | |
Apr 2 | CL4 / A7 | intractability | |
7 | CL6 / A12 CN7 | cryptology | |
9 | Lab 5: cryptology | ||
14 | social issues | ||
16 | Exam | ||
21 | CL7 / A15 | ||
23 | Turing | Turing's paper | |
28 | AI "essay" | ||
30 | review; final thoughts | ||
1:30-3:30 Wed 6 May | Final exam |