Wk |
Date |
Topic |
Homework Due (before your lab begins) |
Reading Due |
1 |
6-22 M |
Welcome and Intro to Java pdf, ppt
|
|
|
6-23 Tu |
Loops and Conditionals
|
|
HFJ ch 1 & ch 2
DSA 10.1-10.14
Scheme to Java
General info about CS61BL
|
LECTURE - objects pdf, ppt
|
6-24 W |
Java Objects
|
Homework 01
|
HFJ ch 3, ch 4 & ch 9 except pages 250-255
PUT ch 1 & ch 2
DSA 10.15-10.19
Boxes and Arrows
Connecting From Home
|
6-25 Th |
Objects and Arrays; Testing
|
Homework 02
|
HFJ ch 5
|
LECTURE - arrays, static, public pdf, ppt
|
2 |
6-29 M |
Arrays and Collection Classes
|
Homework 03
|
HFJ pages 273-287 and 292-293
PUT 3.1-3.3 & ch 4 & ch 5
|
6-30 Tu |
Loop/Data Invariants and Iterators
|
Homework 04
|
HFJ ch 6 & ch 10 & appendix B: sec. 2 & 7
|
LECTURE - inheritance pdf, ppt
|
7-01 W |
Inheritance, Callbacks and Interfaces
|
Homework 05
|
HFJ ch 7 & ch 8
DSA ch 2 & ch 3
|
7-02 Th |
More Inheritance and a Case Study
|
Homework 06
|
HFJ pages 250-255 & ch 11
HFJ Appendix B #4
DSA Appendix B
Bowling Scores Case Study
|
LECTURE - interfaces and abstract classes pdf, ppt
|
3 |
7-05 Sun |
Review Session 1-4pm - 306 Soda - notes here
|
|
|
7-06 M |
More Inheritance and review
|
Homework 07
|
|
7-07 Tu |
Linked Lists and Algortithm Analysis
|
Homework 08
|
DSA chapters 3-9, 13 & 14
Notes on Linked Data Structures
|
EXAM 1: 5pm-6pm 10 Evans
exam,
solution
|
7-08 W |
More Linked List (and time for Proj. 1)
|
Homework 09
|
|
7-09 Th |
Destructive List Manipulation
|
Homework 10
|
|
LECTURE - Big Oh pdf, ppt
|
4 |
7-13 M |
Linked List Finale
|
Homework 11; Project 1 due at 10:00pm
|
|
7-14 Tu |
Trees
|
Homework 12
|
DSA chapters 21, 22, 26, & 27
|
LECTURE - trees pdf, ppt
|
7-15 W |
More Trees
|
Homework 13
|
|
7-16 Th |
Binary Search Trees
|
Homework 14
|
|
LECTURE pdf, ppt
|
5 |
7-20 M |
Time for Project 2
|
Homework 15
|
|
7-21 Tu |
Tree Wrap-up and Maps
|
Homework 16
|
HFJ ch 16
DSA ch 17 & ch 18
|
LECTURE TreeMap and HashMap pdf, ppt
|
7-22 W |
Hashing Part 1
|
Homework 17
|
DSA ch 19 & ch 20
|
7-23 Th |
Hashing Part 2
|
Homework 18
|
|
LECTURE pdf, ppt
|
7-24 F |
|
Project 2 due at 10:00pm
|
|
6 |
7-25 Sat |
Review Session 1-4pm - 306 Soda here
|
|
|
7-27 M |
Midterm Review
|
Homework 19
|
|
7-28 Tu |
Priority Queues and Binary Heaps
|
Homework 20
|
DSA ch 23, ch 24 & ch 28
|
Exam 2: 5pm-6pm 10 Evans
|
7-29 W |
Graphs
|
Homework 21
|
DSA ch 30 & ch 31
|
7-30 Th |
Graphs Algorithms and Applications
|
Homework 22
|
|
LECTURE pdf, ppt
|
7 |
8-03 M |
Graph Finale
|
Homework 23
|
|
8-04 Tu |
Sorting Algorithms
|
Homework 24
|
DSA ch 12
|
LECTURE pdf, ppt
|
8-05 W |
More Sorting
|
Homework 25
|
|
8-06 Th |
Balanced Search Trees
|
Homework 26
|
DSA ch 29
|
LECTURE pdf, ppt
|
8 |
8-09 Sun |
Review Session 1-4pm - 306 Soda
|
|
|
8-10 M |
Review and Project Work
|
Homework 27
|
|
8-11 Tu |
Practice Final
|
Project 3 due at 10:00pm
|
|
LECTURE pdf, ppt
|
8-12 W |
Review
|
Homework 29
|
|
8-13 Th |
Review
|
|
|
FINAL: 5pm-8pm 10 Evans
|