CS 60 Slides
(Section 2: Professor Chris Stone)
|
Topic
|
Date
|
Handouts
|
| Introduction |
9/5 (W) |
slides |
| Information and Data Structures |
9/7 (F) |
slides |
| Trees and rex Functions |
9/10 (M) |
slides |
| Higher-Order Functions |
9/12 (W) |
slides |
| Anonymous Functions, Decomposition |
9/14 (F) |
slides |
| Lower-Level Functional Programming |
9/17 (M) |
slides |
| Low-Level Implementations |
9/19 (W) |
slides |
| Guards and Computing Functions |
9/21 (F) |
slides |
| Currying and Graph Algorithms |
9/24 (M) |
slides |
| Imperative vs. Functional |
9/26 (W) |
slides |
| Reintroduction to Java |
9/28 (F) |
slides |
| Polya and the Polylist class |
10/1 (M) |
slides |
| List Implementations |
10/3 (W) |
slides |
| Java Graphics |
10/5 (F) |
slides |
| Linked Lists and Interfaces |
10/8 (M) |
slides |
| Objects and Classes |
10/10 (W) |
slides |
| More Classes |
10/12 (F) |
slides |
| Finishing up Java |
10/15 (M) |
slides |
| Nim |
10/19 (F) |
slides |
| States and Transitions |
10/24 (W) |
slides |
| BFS and Turing Machines |
10/26 (F) |
slides |
| Turing Machines and Undecidability |
10/29 (M) |
slides |
| Inductive Definitions and Grammars |
10/31 (W) |
slides |
| Parsing |
11/2 (F) |
slides |
| Propositional Logic |
11/5 (M) |
slides |
| More Binary Encodings |
11/7 (W) |
slides |
| Logic Synthesis |
11/9 (F) |
slides |
| Circuit Simplification |
11/12 (M) |
slides |
| Circuits Concluded |
11/14 (W) |
slides |
| Predicate Logic |
11/16 (F) |
slides |
| Prolog |
11/19 (M) |
slides |
| More Prolog |
11/21 (W) |
slides |
| Finite State Machines |
11/26 (M) |
slides |
| Regular Expressions and NFAs |
11/28 (W) |
slides |
| Regular Languages |
11/30 (F) |
slides |
| State Machines in Hardware |
12/3 (M) |
slides |
| ISC Assembly |
12/5 (W) |
slides
|
| Assembly and Architecture |
12/7 (F) |
slides |