CS 62 Lectures & Readings

(Back to the main course website)

Readings listed are from Java Structures which is available for free at that link.

The homework exercises are optional and will not be turned in; do them to get a better grasp of the class material. Trying these exercises will improve your scores on the midterms and final, even if you just look up the answers, which are provided in the textbook.

Note: links below may be broken until the day before each lecture.

Day Date Topic Reference Reading Homework Quiz

W

Jan. 18

Introduction Print

-

Ch 0 & 1,
Appendix B.3.2

1.1, 1.3

F

Jan. 20

How Does Java Work? (guest)

-

2.1, 2.3

-none-

M

Jan. 23

Java Structure and Style Print

Ratio Cards Random

Ch 2

2.1, 2.3

W

Jan. 25

Assertions/Java Graphics (guest)

GraphicsDemo PostIt

Standard Java Graphics,
Using Assertions

-

F

Jan. 27

Events & ArrayLists Print

Association PostIt

Ch 3 & 4

3.7

Preconditions & Assertions

M

Jan. 30

ArrayList Implementation Print

ArrayIndexList

Ch 3 & 4

3.5, 3.7

W

Feb. 1

Analysis of Algorithms Print

SortingAlgorithms

Ch 5.1

5.5, 5.9, 5.11

F

Feb. 3

Induction/Sorting Print

SortingAlgorithms FastPower

Ch 5.2–5.3, Ch 6

5.21, 5.23

ArrayList
Big-O

M

Feb. 6

Strong Induction & Mergesort (guest; slides Print )

-

Ch 6

6.7

W

Feb. 8

Iterators Print

IterableArrayIndexList AlphabetSoup

Ch 8

8.4

F

Feb. 10

Linked Lists 1 Print

-

Ch 9

9.5

Mergesort

M

Feb. 13

Linked Lists 2 Print

-

Ch 9

9.15

W

Feb. 15

Stacks Print

-

Ch 10.1

10.3

F

Feb. 17

Queues Print

-

Ch 10.2

10.5

Linked List Insert

M

Feb. 20

Binary Trees 1 Print

-

Ch 12.1–12.5

12.3, 12.7

W

Feb. 22

Binary Trees 2 Print

AnimalApp

Ch 12.6–12.10

12.11

F

Feb. 24

Priority Queues Print

-

Ch 13.1–13.4.1

13.1, 13.2

Binary Tree Sizes

M

Feb. 27

Heaps & Heapsort Print

-

Ch 13.4.2–13.6

W

Mar. 1

Binary Search Trees Print

-

Ch 14.1–14.8

14.3, 14.5, 14.11

F

Mar. 3

Midterm 1

-midterm-

M

Mar. 6

Balanced BSTs Print

Demo

W

Mar. 8

Parallelism 1 Print

ParallelSum

Handout §2, 3

F

Mar. 10

Parallelism 2 Print

ParallelSum
(D&C; ED&C)

Handout §4

Binary Search Tree Insert/Lookup

Mar. 13-17

Spring Break

M

Mar. 20

Parallelism 3 Print

Comparison

Handout §5

W

Mar. 22

Parallelism 4 Print

-

Handout §5

F

Mar. 24

Concurrency 1 Print

BankAccount.java BankTest.java

Handout §6

Speedup from Parallelism

M

Mar. 27

Concurrency 2 Print

-

Handout §7

W

Mar. 29

Concurrency 3 Print

Promises.java

Handout §8, 9

Sample Problems

Race Conditions

F

Mar. 31

Ceaser Chavez Day

-holiday-

M

Apr. 3

Maps & Hashing Print

-

Ch 15.1–15.3

W

Apr. 5

Hashing continued Print

Maps

Ch 15.4–15.7

15.3, 15.9

F

Apr. 7

Midterm 2

-midterm-

M

Apr. 10

Intro to C Print

hello.c

W

Apr. 12

Pointers & Functions Print

sum.c vector.c big.c whereami.c

F

Apr. 14

Malloc & Compiling Print

-

Pointers

M

Apr. 17

Arrays in C Print

-

W

Apr. 19

C Langauge “Features” Print

goto.c union.c

F

Apr. 21

Discussion: Data and Ethics Print

-

Malloc a 2D Array

M

Apr. 24

Graph Basics Print

-

Ch 16

16.1, 16.3

W

Apr. 26

Search & Connectivity Print

bfs.c dfs.c

Ch 16

16.7

F

Apr. 28

Dijkstra’s Algorithm Print

-

Ch 16

Dijkstra’s Algorithm questions

Runtime of search

M

May 1

Minimum Spanning Trees Print

-

Ch 16

W

May 3

Course Summary Print