CS 61B: Schedule and Lecture Notes

Summer 2006


Note: Many of these notes were inspired to varying degrees by notes from JRS. lec26.pdf
Class Day Date Topic Notes Other
#1 Mon. 26 June Introduction, Java basics, Objects lec1.pdf -
#2 Tue. 27 June Objects and classes, Primitives, Arrays lec2.pdf -
#3 Wed. 28 June Using objects, constructors, the Java API lec3.pdf example from class
#4 Thur. 29 June Basic I/O, Access modifiers, Packages, Encapsulation, Inner classes lec4.pdf -
#5 Mon. 3 July Object equality, "static", "final", Advanced looping constructs lec5.pdf -
#6 Wed. 5 July Inheritance and Polymorphism lec6.pdf -
#7 Thur. 6 July Exceptions lec7.pdf -
#8 Mon. 10 July Java internals - the stack and heap lec8.pdf HW2 due 11:59pm
#9 Tue. 11 July Exam 1 - Project 1 Out
#10 Wed. 12 July Linked Lists lec10.pdf -
#11 Thur. 13 July Trees - representation and traversals lec11.pdf -
#12 Mon. 17 July Asymptotic analysis lec12.pdf HW3 due 11:59pm
#13 Tue. 18 July Sorting (I) lec13.pdf -
#14 Wed. 19 July Sorting (II) (13 cont) Project 1 Due 11:59 pm
#15 Thur. 20 July Sorting (III) (13 cont) -
#16 Mon. 24 July Stacks, Queues, Priority queues lec16.pdf HW4 due 11:59 pm
#17 Tue. 25 July Binary Search Trees lec17.pdf -
#18 Wed. 26 July Balanced Trees (AVL, Splay) lec18.pdf -
#19 Thur. 27 July More balanced trees (Splay, B-trees) (18 cont) -
#20 Mon. 31 July Exam 2 - -
#21 Tue. 1 Aug Tries, Huffman coding lec21.pdf Project 2 Out
#22 Wed. 2 Aug Game Trees lec22.pdf -
#23 Thur. 3 Aug Hashtables lec23.pdf -
#24 Mon. 7 Aug Amortized and randomized analysis lec24.pdf -
#25 Tue. 8 Aug Graphs- basics lec25.pdf -
#26 Wed. 9 Aug Shortest-path algorithms (Dijkstra) HW5 due 11:59 pm
#27 Thur. 10 Aug More shortest-path algs. (Bellman-Ford, Floyd-Warshall) (26 cont.) -
#28 Mon. 14 Aug String matching (notes updated on 8/14) lec28.pdf Project 2 Due 11:59 pm
#29 Tue. 15 Aug Minimum spanning tree algorithms lec29.pdf -
#30 Wed. 16 Aug Disjoint data sets (Union-find) lec30.pdf HW6 due 11:59 pm
#31 Thur. 17 Aug Final Exam - -


[CS61B Home Page]