Big Java Early Objects, 5th ed. / Java Concepts, 7th ed.

Bug Report Page

.  .

How to Tell which Printing You Have

On the copyright page (facing the first page of the Preface), there is a printing history of the book. The printing history is a row of numbers that—at the 1st printing—looks like this:

10 9 8 7 6 5 4 3 2 1

At each subsequent printing, one number is removed from the end of this row of numbers to indicate which printing of the book you have. For example, the last number in the row of numbers in the 2nd printing is 2, and so on.

When an error is fixed in a reprint, it is marked with a code such as [B3C2] = fixed in Big Java's 3rd printing, Java Concepts 2nd printing.

Page 80 [B2C2]
Change box.move(1, 1) to box.translate(1, 1)
Page 301 [B2C2]
Change “switching to the host’s choice” to “switching to the third door”
Page 335
Change 
else if (scores.size() == 1)
to 
else if (scoresSize == 1)
Page 357 [B2C2]
Remove the line Scanner in = new Scanner(System.in); from the ScoreTester1 class.
Page 416 P8.3 [B2C2]
The table for the bar codes has several wrong entries. Digit 3 should be 0 0 1 1 0, digit 4 should be 0 1 0 0 1, digit 5 should be 0 1 0 1 0, digit 7 should be 1 0 0 0 1, and digit 8 should be 1 0 0 1 0.
Page 429 [B2C2]
Change question.addChoice("Canada", true); to choiceQuestion.addChoice("Canada", true);
Page 481 [B2C2]
"average class" -> "average method"
Page 501
Below 
scene.setFocusable(true);
add 
scene.requestFocus();
Page 526 Self Check 8 [B2C2]
Change 6E6 6,995.00 to 6E6 $6,995.00
Page 533 Change the URL http://theory.lcs.mit.edu/~rivest/rsapaper.pdf to http://people.csail.mit.edu/rivest/Rsapaper.pdf
Page 557 [B2C2]
Change “Because a comma is not considered a part of a floating-point number to “Because a dollar sign is not considered a part of a floating-point number”
Page 598 [B2C2]
Self Check 8. Change “Of course, it would be inefficient to set up an actual array of the remaining values. Which recursive helper method can solve the problem?” to “Design a recursive helper method to solve this problem.”
After Self Check 9, add: “Why is this less efficient?”
Page 627 [B2C2]
Change the answer to Self Check 8 to: “The method sumHelper(int[] a, int start) adds a[start] and sumHelper(a, start + 1)”.
Change the answer to Self Check 9 to: “sum(a) can make a new array smaller containing a[1]...a[a.length - 1] and compute a[0] + sum(smaller). But it is inefficient to make a copy of the array in each step.”
Page 649/650 [B2C2]
Change the array to
[0] [1] [2] [3] [4] [5] [6] [7] [8] [9]
1 4 5 8 9 12 17 20 24 32

In the next paragraph, change a[3] to a[4]. Change the next array to

[0] [1] [2] [3] [4] [5] [6] [7] [8] [9]
1 4 5 8 9 12 17 20 24 32

Change “Now the last value of the first half of this sequence is 17” to “The middle element of this sequence is 20”. Change the next two arrays to

[0] [1] [2] [3] [4] [5] [6] [7] [8] [9]
1 4 5 8 9 12 17 20 24 32

and

[0] [1] [2] [3] [4] [5] [6] [7] [8] [9]
1 4 5 8 9 12 17 20 24 32

In the paragraph below, change a[5] to a[6].

Thanks to Reva Abramson, Kathleen O'Brien, Adam Cannon, Rick Giles, Carolyn Rosiene, David Ruminer, Edwin St.Hilaire, David Taylor, Tan Tran, Thomas Wulf, and (your name might go here) for their bug reports and suggestions

Please report any remaining bugs in this edition on the bug report form.