Errata, Lecture Slides and Videos


Lecture 1 (Basic Programming Concepts: Built-In Data Types), slide 46

Printed: 2 < 13
Fixed: 2 > 13
Reported by Raj Mukku, 02-Jun-20.

Lecture 2 (Conditionals and Loops: Nesting), slide 34 (pdf only)

Printed: if (t == goal)
Fixed: if (cash == goal)
Reported by Rohan Dhoopar, 27-Sep-15.

Lecture 3.B (Arrays: Examples), slide 18 (video only)

Printed: NOTE: Error on page 92 in 3rd printing of text
Fixed: This errata refers only to the 1st edition of Intro to Programming in Java (August 2009) and not to more recent printings or editions.
Reported by Yukai Chou, 31-Oct-19.

Lecture 3.C (Arrays: Basics), slide 11 (pdf and video)

Printed: java PQ4_1
Fixed: java PQarray1
Reported by Yukai Chou, 31-Oct-19.

Lecture 4.C (Fractal Drawings), 9:36, slide 35

Printed: integrated function systems
Fixed: iterated function systems

Lecture 6.C (Recursion: Foundations), 11:27

Printed: collatz(3*N + 1);
Fixed: else collatz(3*N + 1);
Reported by Patrick Mantout, 13-Dec-19.

Lecture 6.D (Recursion: Avoiding Exponential Waste), 0:15 (slide 36)

Printed: Fn = Fn-1 + Fn-1
Fixed: Fn = Fn-1 + Fn-2
Reported by Patrick Mantout, 19-Dec-19.

Lecture 9.C (Performance: Mathematical models), 7:00 (video only)

Spoken: 5/4 N + 13/4 N + 53/2
Fixed: 5/4 N^2 + 13/4 N + 53/2
Reported by Rohan Tummala, 13-Dec-18.

Lecture 9.B (Creating Data Types: Point charges), slide 10

Printed: It decreases in proportion to the inverse of the distance from the charge (2D).
Fixed: More specifically, we are computing the electric potential in 3D, but restricted to a 2D subspace.
Reported by Benjamin Strekha, 12-Apr-20.

Lecture 9.B (Creating Data Types: Point charges), 2:24 (video only)

Spoken: If it was three dimensions, it would be inverse of distance squared
Fixed: If it was three dimensions, it would be still be inverse of distance
Reported by Rohan Tummala, 13-Dec-18.

Lecture 9.B (Creating Data Types: Point charges), 4:44 (video only)

Spoken: give constructor a potential value
Fixed: give constructor a charge value
Reported by Rohan Tummala, 13-Dec-18.

Lecture 9.D (Creating Data Types: Complex Numbers), slide 46

Printed: the zoomed-in area highlighted with red circle points to wrong location
Fixed: move red circle to correct location
Reported by Anonymous, 21-Apr-20.

Lecture 9.D (Creating Data Types: Complex Numbers), slide 47

Printed: java ColorMandelbrot -.5 0 2 < mandel.txt, -1.5 0 2, -1.5 0 0.002
Fixed: java ColorMandelbrot -1.5 0 2 < mandel.txt, -1.5 0 0.02, -1.5 0 0.002
Reported by Anonymous, 21-Apr-20.

Lecture 11.B (Searching and Sorting: Binary Search), video only (5:55)

Written: return search(... 8, 10)
Fixed: return search(... 8, 11)

Lecture 11.E (Searching and Sorting: Longest Repeated Substring), slide 44 (6:17)

Written: lcp(String s)
Fixed: lcp(String s, String t)

Lecture 11.E (Searching and Sorting: Longest Repeated Substring), slide 49 (14:25)

Written: 1995–2102
Fixed: 1995–2012

Lecture 13.A (Symbol Tables: APIs and clients), slide 7 (pdf and video)

Written: "of" appears before "it" in list of words
Fixed: "of" should appear after "it" in list of words to make list alphabetical order
Reported by Rohan Tummala, 13-Dec-18.

Lecture 14.B (Regular Expressions), slide 8

Printed: Amino acids: CAVLIMCRKHDENQSTYFWP (replace second C with G)
Fixed: Amino acids: ACDEFGHIKLMNPQRSTVWY
Reported by Zhijin Liu, 02-May-20.

Lecture 14.C (Theory of Computing: DFAs), slide 25-26 (pdf and video)

Printed: Which of the following strings does this DFA accept?
Fixed: Which of the following languages does this DFA recognize?
Reported by Kathleen Emerson, 23-Nov-15.

Lecture 14.C (Theory of Computing: DFAs), slide 30 (11:03)

Printed: Which of the following strings does this DFA accept?
Fixed: Which of the following languages does this DFA recognize?
Reported by Kathleen Emerson, 23-Nov-15.

Lecture 15.B (Universality and Computability: A simple model of computation), slide 18 (pdf and video)

Printed: Second stack: 1 1 + 1 0 0 1
Fixed: Second stack should contain : 1 1 + 1 0 1 0
Reported by Amy Hudson, 14-Apr-16.

Lecture 15.D (Universality and Computability: Computability), slide 36 (pdf and video)

Printed: Card 2 has BAB as top string
Fixed: Card 2 should have X as top string
Reported by Kathleen Emerson, 24-Nov-15.

Lecture 17.B (A Computing Machine: Data types), slide 17 (pdf and video)

Printed: 1111111100001101
Fixed: 1111111100001011
Reported by Madeleine Cheyette, 08-Mar-16.

Lecture 17.D (A Computing Machine: Operating the machine), slides 39 (pdf and video)

Printed: The title is CS.11.D.MachineI.Operating
Fixed: The title should be CS.17.D.MachineI.Operating
Reported by Kevin Wayne, 18-Mar-16.

Lecture 18.A (von Neumann Machine: Perspective, slide 9 (10:16)

Printed: 512 17-bit words (8074 bits)
Fixed: 512 17-bit words (8704 bits)

Lecture 18.C (von Neumann Machine: Practical Implications), slide 26 (pdf and video)

Printed: TOY comment for instruction AA02 is R[A] <- mem[R[A]]
Fixed: TOY comment should be R[A] <- mem[R[2]]
Reported by Bartosz Kaczmarski, 18-Mar-16.

Lecture 20.D (CPU: Components and Connections), slide 39 (9:27)

Printed: halt instructions ON when EXECUTE WRITE is ON
Fixed: halt instructions ON when EXECUTE is ON