COS 126 Lectures, Spring 2004

Here is a tentative schedule of lectures for Spring, 2004. We will update this page regularly.

#	DATE	TOPIC	INTRO CS	READINGS
1	2/3	Introduction	1	King 1.0 - 2.3
2	2/5	Intro to Java	2.1, 2.2	King 2.4 - 2.9, 4.1 - 4.5
3	2/10	Conditionals and Loops	2.3	King 2.12, 4.6 - 4.8, 4.10
4	2/12	Input and Output	2.4	-
5	2/17	Arrays	2.5	King 5.1 - 5.6
6	2/19	Functions	2.6	King 7.3, 7.4
7	2/24	Recursion	2.7	Sedgewick 5.0 - 5.3
8	2/26	TOY I	5.1, 5.2, 5.3	King 9.0 - 9.5
9	3/2	TOY II	5.4, 5.5	-
10	3/4	Combinational Circuits	6	Notes on Circuits link from Booksite
11	3/9	Sequential Circuits	6	Notes on Circuits link from Booksite
12	3/11	Machine Architecture	6	Lecture Notes
13	3/23	Data Types	3.1	King 3.0 - 3.10, 4.10
14	3/25	Modular Programming	3.2	King 10.0 - 10.10
15	3/30	Linked Structures	4.1, 4.2	Sedgewick 3.3, 3.4, 5.4 - 5.7
16	4/1	Encapsulation	3.3, 4.2, 4.4	Sedgewick 4.0, 4.1, 4.7
17	4/6	Small World Phenomenon	4.5	-
18	4/8	Theory of Computation	7.1, 7.2	-
19	4/13	Universality and Computability	7.3, 7.4	Harel 1 - 2
20	4/15	Analysis of Algorithms	10.1, 10.2	Sedgewick 2.0 - 2.3
21	4/20	Intractability	10.3	Harel 3 - 5
22	4/22	Cryptography	10.4	Harel 6
23	4/27	Artificial Intelligence	-	-
24	4/29	Review, Cool demos, Fun	-	-

Errata. Here is a list of reported errors in the lecture notes.

References:

D. Harel, Computers Ltd.: What They Really Can't Do, Oxford University Press, 2000.
K. N. King, Java Programming: From the Beginning, W.W. Norton & Company, 2000.
R. Sedgewick, Algorithms in Java, Third Edition, Parts 1-4, Addison-Wesley, 2002.
R. Sedgewick and K. Wayne, Introduction to Computer Science.