Java Methods, Second AP Edition Errata ==================================== Page 83, last paragraph: Pascal should be: Python Page 85, table, for Iteration #3 in column "m": 8 should be: 9 Page 100, Question 6: In the sequence is Question 5 should be: In the sequence in Question 5 Page 102, Question 10, Part (c): printTriangle(n) should be: printTriangle(5) page 494, middle: server.listStock(...); should be: exchange.listStock(...); Page 518, first paragraph: Figure 20-6 on page 490 should be: Figure 20-7 on page 475 Page 627, second paragraph: Figure 24-9 on page 604 should be: Figure 24-9 on page 588 Second Printing Page 21, last paragraph, and Page 22: Oracle Corporation completed acquisition of Sun Microsystems in January 2010, so now Oracle owns Java. Page 355, Question 10: Scrabble letter score for 'O' is given as 3; should be 1. First Printing Page 32, Figure 2-7: Comments are out of sync with the code. should be // corner at x = 20, y = 40: ... // Draw a string of text starting at x = 55, y = 65: Page 53, top: 1. An comment at the top should be 1. A comment at the top Page 78, Question 20: the BoxRunner program should be the BugRunner program Page 192, Question 1: GirdWorld should be GridWorld Page 245, makeSale method: @return true for a successful sale, otherwise (boolean) should be @return true for a successful sale, false otherwise (boolean) Pge 291, Question 20: The first twelve digits the country should be The first twelve digits identify the country Page 309, DanceRunner code: (new WaltzNumber()).main(args), (new YMCANumber()).main(args), (new CongaNumber()).main(args) should be WaltzNumber.main(args), YMCANumber.main(args), CongaNumber.main(args), respectively. Page 316, last paragraph; page 317, Figure 11-7 caption: everywhere YMCA should be Waltz Page 341, middle: for (r = 0; r < rows; r++) for (c = 0; c < cols; c++) grid[r][c] = '*'; should be for (int r = 0; r < rows; r++) for (int c = 0; c < cols; c++) grid[r][c] = '*'; Page 359, Question 25: if (scores[iMax2] > scores[iMax1]) { i = iMax1; ____________________________________ ... } for (i = 2; i < n; i++) { if (scores[i] > scores[iMax1]) { _____________________________________ } else if ( _________________________________ ) { _________________________ ... } } should be if (scores[iMax2] > scores[iMax1]) { i = iMax1; ____________________________________ ____________________________________ } for (i = 2; i < n; i++) { if (scores[i] > scores[iMax1]) { _____________________________________ _____________________________________ } else if ( _________________________________ ) { _________________________ } } Page 409, Question 9: Write a recursive implementation of Binary Search. should be Write a recursive implementation of Binary Search with specifications similar to the search method in Question 8. Page 417, bottom: import.java.io.*; import.java.util.Scanner; should be import java.io.*; import java.util.Scanner;