CS 61B: Lecture Notes and Readings

Fall, 2012

Please try to avoid printing lecture notes (or do it on your own printer), if they are handed out in class. If you must print copies of the lecture notes, please use the printable versions below, which are condensed.


You should do the readings indicated for a given day before the lecture for that day. In the following,

This semester, ETS is doing screencasts of the lectures.

Lecture Date Slides Subject Other files Readings
#1 Fri, 24 Aug on-line or printable Course Introduction - -
#2 Mon, 27 Aug on-line or printable Developing a Simple Program - HFJ , Chapter 1
AJR , §1.1–1.9
#3 Wed, 29 Aug on-line or printable More on Simple Programs Programs from lecture 3 updated 9/1/2012
#4 Fri, 31 Aug on-line or printable Values and Containers Programs from lecture 4 and 5 AJR , Chapter 4
HFJ , Chapter 3
#5 Wed, 5 Sept on-line or printable Pointer Manipulation Programs from lecture 4 and 5 -
#6 Fri, 7 Sept on-line or printable Arrays Programs from lecture 6 HFJ , Chapter 3
#7 Mon, 10 Sept on-line or printable Object-Based Programming - HFJ , Chapters 2, 4, 5
#8 Wed, 12 Sept on-line or printable Object-Oriented Mechanisms - HFJ , Chapters 8, 9
#9 Fri, 14 Sept on-line or printable Interfaces and Abstract Classes - -
#10 Mon, 19 Sept Abstract Methods and Classes (contd.) - -
#11 Wed, 19 Sept on-line or printable Examples of Interfaces - -
#12 Fri, 21 Sept on-line or printable Misc. support for abstraction; Exceptions - HFJ , Chapters 11, 9
#13 Mon, 24 Sept Misc. support for abstraction, contd. - -
#14 Wed, 26 Sept on-line or printable Numbers - HFJ , Chapter 10,
AJR § 6.2-6.3
#15 Fri, 28 Sept on-line or printable Algorithmic Analysis I - DSIJ, Chapter 1
#16 Mon, 1 Oct Algorithmic Analysis II - -
#17 Wed, 3 Oct on-line or printable Collections overview, sequence implementation - DSIJ, Chapters 2-3
#18 Fri, 5 Oct Continuation of lecture 17 - DSIJ, Chapter 4
#19 Mon, 8 Oct Review (conducted by the TAs) - -
#20 Wed, 10 Oct Test #1 (in class) - -
#21 Fri, 12 Oct on-line or printable Trees - DSIJ, Chapter 5 (skim 6)
#22 Mon, 15 Oct Continuation of lecture 22: Trees, searching - DSIJ, Chapter 6
#23 Wed, 17 Oct on-line or printable Backtracking search, game trees - DSIJ, §6.5
#24 Fri, 19 Oct on-line or printable Generic Programming - AJR Chapter 10
#25 Mon, 22 Oct on-line or printable Priority queues, range queries - DSIJ, § 6.4
#26 Wed, 24 Oct on-line or printable Hashing - DSIJ, Chapter 7
#27 Fri, 26 Oct on-line or printable Sorting - DSIJ, Chapter 8
#28 Mon, 31 Oct Sorting, contd. - -
#29 Wed, 31 Oct on-line or printable Balanced Search Structures - -
#30 Fri, 2 Nov Balanced Search Structures, contd. - -
#31 Mon, 5 Nov on-line or printable Pseudo-Random Sequences - DSIJ, Chapter 11
#32 Wed, 7 Nov Test #2 (in class) - -
#33 Fri, 9 Nov on-line or printable Graphs, Introduction - -
#34 Wed, 14 Nov on-line or printable Graphs: Minimal spanning trees, Union-find - -
#35 Fri, 16 Nov on-line or printable Dynamic Programming - -
#36 Mon, 19 Nov on-line or printable Assorted topics: Enumeration types, Threads and Concurrency - DSIJ, Chapter 10;
AJR , §5.6, Chapter 11
HFJ pp. 489–516, 671–673
#37 Wed, 21 Nov on-line or printable Storage Management - -
#38 Mon, 26 Nov Assorted topics - -
#39 Wed, 28 Nov Assorted topics - -
#40 Fri, 30 Nov on-line or printable Summary, Course Evals - -



[CS61B Home Page]

Page was last modified on Fri Nov 30 14:34:37 2012.
Address comments and questions to cs61b@imail.eecs.berkeley.edu