Errata for the CS60 TextBook by Robert Keller, edition of August 1997

These are errors in the printed textbook. The on-line version will be corrected as the errors are found.

• page 11: "perseverance" should be "perserverance"
• Sec. 2.7, page 31: Line 3, "old_mail" should be "current_mail" and "older_mail" should be "old mail" [Andrew Cosand]
• Sec. 2.7: "apple icon" should be "yin-yang icon" in a couple of figure captions [Andrew Cosand]
• Sec 2.7, page 42: There is no exercise #2 [James Brooks]
• Page 51, 2nd para, line 1: "reference" should be "references"
• Sec 3.1, page 61: mid-page, "once cannot" should be "one cannot" [Andrew Cosand]
• Sec 3.1, page 62: Third sentence should read "It is difficult to present functional programming..." instead of "functionally programming." [James Brooks]
• Sec. 3.16: "no duplicates have been removed" should be "all duplicates have been removed"
• Page 70 (Exercise #1 grammar) - "definitions" should be "definition" [James Brooks]
• Page 155, second definition of 'find' (breadth-first case) should be

          find(P, [Node | Nodes], Graph, Seen) =>
                  Targets = get_targets(Node, Graph),
                  New = difference(Targets, Seen),
                  Find(P, append(Nodes, New), Graph, [Node | Seen]);
  

  (the arguments of difference were reversed, rather than those of append, as stated in the text) [Roy Pollock]
• Page 156, exercise 2, "tree" should be "graph"
• Page 188, opening sentence of 4.5: "to implement" should be "may be used to "implement" [Steve Rayhawk]
• Page 198, exercise 2; omit, since polys have not been covered in the text [Steve Rayhawk]
• Page 199, first display: the & notation means "address of" and was not introduced before this point (it is from C++)
• Page 219, exercise 2 should come after exercise 6.
• Page 271, 2nd line, "re;atively" should be "relatively"
• Page 271, 2nd para, 4th line, delete "as soon as possible." [Wynn Yin]
• Page 273, last para, 5th line, delete "while." [Wynn Yin]
• Page 274, exercise 1, "bias.." should be "bias." [Steve Rayhawk]
• Page 283, before last display, "type of data they contain" should be "the type of data each contains". [Steve Rayhawk]
• Page 292, 2nd para., "an Enumeration" should be "Enumerations (and interfaces in general)" [Steve Rayhawk]
• Page 292, 2nd para., "method be" should be "method may be" [Steve Rayhawk]
• Page 293, Item labeled "2.", "later" should be "latter" [Wynn Yin]
• Page 294, Sec 7.23, 2nd para, 2nd line, "have to used" should be "have to use" [Steve Rayhawk]
• Page 294, Sec 7.23, 2nd para, 5th line, "take" should be "takes", "return" should be "returns" [Steve Rayhawk]
• Page 360, 2nd display, the word "downward" belongs on the previous line, after "bit"
• Page 364, the headers are really botched.
• Page 366, first display, the left node labeled 101 should be 100 [Ian Weiner]
• Page 366, second display, there is an unlabeled node, which should be labelled 1011. Also, that node should be connected to 1011. [Ian Weiner]
• Page 367, third display from the bottom, the headers aren't aligned properly
• Page 458, 1st paragraph, 5th line. "square" should be "squared". [Wyn Yin]
• Page 485 in the table: N log N for 10000 should be 132877, not 13287. [Kris Jurka]
• Page 547, diagram. The top arrow from state c to state a should be from d to a instead. [Wyn Yin]
• Page 577, first table. The entries for the input values should be shifted over to the right so that they are aligned with the labels "0" and "1". [Wyn Yin]