Errata, 3rd Edition

• p118, Chapter 2, Self-Check 3 - Expression (o) is a duplicate of expression (b). The expressions are both: 2.5 * 2 + 8 / 5.0 + 10 / 3 . Therefore expression (o) can be ignored or skipped. (Thanks to Katlyn Edwards, TA at University of Washington)
• p186, Chapter 3, Self-Check 18 - There should be a semicolon at the end of line 3 of the code shown. It should read:

  String middle = "T.";
  

• p181, Chapter 3, Self-Check 1 - In answer choice e, the trailing ( parenthesis should be a { curly brace. It should be:

  e. public static void example(int x, int y) {

• p186, Chapter 3, Self-Check 18 - There should be a semicolon at the end of line 3 of the code shown. It should read:

  String middle = "T.";
  

• p187, Chapter 3, Self-Check 19 - This problem refers to the String class's replace method, which is not discussed in the chapter. Therefore the problem may be confusing or unsolvable to many students. We suggest skipping parts (i) - (k) of this problem, or referring students to this Java API documentation on the String replace method. (Thanks to Alan Broder of Yeshiva University)
• p373, Chapter 5, Self-Check 18 - The fifth line of code shown is missing a semicolon. It should be:

  return false;
  

• p379, Chapter 5, Exercise 9 - Exercise 5.9 says at the end, "Your method should print nothing if the empty string ("") is passed." But this text does not make sense for this problem, because the method accepts an int parameter, not a string. This text should be disregarded. (thanks to Richie Sweeney)
• p428, Chapter 6, Self-Check 6 - The description of the problem says, "Given the following line of input, ..." But the input shown is two lines. The description should say, "Given the following lines of input, ..."
• p431, Chapter 6, Exercise 4 - The method's name is listed as cointCoins but it should be countCoins.
• p635, Chapter 9 - Self-Check problem 9.4 asks about various variable declarations and which ones would be legal. But this problem depends on knowledge of polymorphism, which isn't covered until later in the chapter. This problem ought to be listed under a later heading of problems. (Thanks to Alan Broder of Yeshiva University)
• p722, Chapter 11 - Line 25 of the Lottery program should be:

  double prize = PRIZE * Math.pow(2, matches.size());
  

  (Thanks to Chris Middleton of Boston University)
• p791, Chapter 12 - In the code for the explore method, there is a missing right curly brace just before the line that says "return false". The complete code sample should be:

  private static boolean explore(Board b, int col) {
      if (col > b.size()) {
          return true;
      } else {
          for (int row = 1; row <= b.size(); row++) {
              if (b.isSafe(row, col)) {
                  b.place(row, col);
                  if (explore(b, col + 1)) {
                      return true;
                  }
                  b.remove(row, col);
              }
          }
          return false;
      }
  }
  

  (Thanks to Cheng Xing)
• p843, Chapter 13 - The first paragraph of the "Recursive Binary Search" section says, "In the previous section, binary search was implemented using an iterative algorithm with a for loop." It should say, "with a while loop." (Thanks to Barbara Anthony)
• p873, Chapter 14 - The last paragraph on this page says, "The third line of output uses the peek method to report that the top of the stack is "to"." It should say, ... "the top of the stack is "be". (Thanks to Jeff Nyhoff of Calvin College)
• p1088, Chapter 18, Self-Check 12 - There is a missing semicolon after the last line of code. It should be:

  map.put(15, "Daisy");
  

• p1090, Chapter 18, Self-Check 23 - The heap array in the example contains the wrong elements. It should contain:

  [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12]
   12  29  30  39  40  55  64  70  84  91  99
  

• p1091, Chapter 18, Exercise 8 - The final array state shown from the example call is backward. It should be:

  [81, 42, 22, 17, 9, -3]
  

Reporting Errors:

Have you found an error in our textbook? If so, please email us at: