Error Information for Data Structures and Algorithm Analysis in Java


Here is the errata list for Data Structures and Algorithm Analysis in Java, by Mark Allen Weiss. Some of the errors affect the source code; updates to the code are done automatically.

Click here to report a new error.

I'm very backlogged on these.
Please be patient for a reply. Thanks!

Second printing

--------  ---  ---  ----------------------------------------------------------
10/07/01  008  XB   At end of largest paragraph, change "doesn't work for any
                    value" to "doesn't work for any nonnegative value"
07/24/00  014  JV   Line 3, change "uninitialized" to "initialized to null"
                    (with null in monospace font).
07/28/99  015  RWL  Section 1.4.3, paragraph 3, last sentence, change
                    Figure 1.10 to 1.11. The discussion is also more confusing
                    than I intended because Fig 1.10 does not have lessThan
                    as a member. It would be better to just write the entire
                    paragraph and code in terms of compareTo instead of lessThan.
02/19/99  016  DM   In Figure 1.11, the return type of compareTo should be int.
01/28/02  018  MAW  Overflow and Underflow should probably be RuntimeExceptions
                    and thus would not need to be specified in a throws list.
                    This would affect the code, mostly for StackAr and QueueAr
                    in Chapter 3.
02/19/99  046  DM   Footnote: the BigInteger class does arbitrary integers.
                    (BigDecimal does arbitrary decimals).
09/26/01  057  MAW  In first paragraph, the statement that "arrays are generally
                    not used to implement lists" is incorrect (e.g. ArrayList)
                    and should be replaced with "simple arrays are not
                    apprpriate in some situations".
01/27/01  063  DC   In paragraph 1, add a remark that remove could be done in O(1)
                    if we add a routine along the lines of remove(LinkedListItr prev).
07/14/04  091  CS   Change "error calls" to "error checks"
11/05/02  105  BT   Line 9, change "binary tree has at most two children"
                    to "binary tree node has at most two children"
12/01/99  118  AS   Change .328 to 1.328.
07/16/01  129  TO   In second sentence, change "rotateWithLeftChild is" to
                    "rotateWithRightChild is"
07/14/04  130  AS2  In Sec 4.5, paragraph 2, line 2, change "as long at it" to "as long as it"
03/27/99  141  DH   Line 14, item 5, change "L children" to L "data items"
04/06/99  142  DH   Line 15, change "first level could " to "next level could"
02/19/99  151  DM   In Exercise 4.51, mention that N is the number of nodes.
02/19/99  179  DM   In Exercise 5.11 preamble, change the last false to true.
07/14/04  198  AS2  In Secion 6.6, line 2, change O(N) to o(N).
01/31/05  248  CS   PAge 248, last line before eqn (7.12), change (7.7) to (7.8)
04/17/99  253  KQ   Remove "insertion" from caption in Figure 7.17.
01/31/05  256  CS   IN the last table at the bottom, change "51" to "41"
03/29/01  262  GS   In Exercise 7.21 (b), change "nondistinct" to "distinct".
07/14/04  279  MR   In first paragraph after the definition of alpha(M,N),
                    change "grows slower then" to "grows slower than"
11/21/01  295  WH   In Figure 9.5, change "find...DegreeZero" to "find...IndegreeZero"
11/06/02  296  DL   Line 18, change "all edges adjacent to v" to
                    "all vertices adjacent to v"                           
07/14/04  334  KE   Change "visits I and J" to visits "J and I"
09/13/02  365  DM2  Change "this bound is tight", to "this ratio, 2, is tight"
11/27/01  375  GO   In Figure 10.33, change "coordinates differ" to
                    "y-coordinates differ"
07/02/02  407  ???  In the first oval it says x1=0, x5=10 but
                    it should say x1=0, x6=10 
07/14/04  413  CA   Not an error... but note that leaf node with value 68 can 
                    also be pruned from the game tree, with the predecessors at
                    ply 4, 3, and 2 returning 50. This figure was not intended
                    to show all possible pruning; just some examples.
07/14/04  455  KE   Change "it wil contain the root of the right tree at
                    the end" to "... left tree ..."
12/18/00  456  DF   Change second "zig-zag" to "zig-zig"
01/31/01  462  TS   In second paragraph of 12.2.2, add remark that if X is the root,
                    after the color flip, it will be red, but can be
                    made black immediately to restore property 2.
01/07/99  520  MAW  The Collections API has some minor changes from the Beta. In
                    Figure B.3, line 14, use entrySet instead of entries.
                    Page 518, Section B.5.2, requires a similar change.
10/23/01  536  CL   The index entry Lazy deletion-linked list should be removed.

First printing

--------  ---  ---  ----------------------------------------------------------
10/01/98  115  AEM  In the two-children case, the recursive call to
                    remove should have t.element as a parameter instead of x.
10/01/98  422  MAW  Change D_t to d_t in Figure 10.79.
11/07/98  457  MAW  Insert four spaces before the } on the last line of code.


CA   Chris Adams
XB   Xuan Baldauf
DC   Donald Chinn
KE   Kjell Ellingsen
DF   David Fu
DH   Dennis Hamilton
WH   Weseung Hwang
RWL  Robert W. Lindeman
CL   Chuanquan Liu
DM   Dylan McNamee
DM2  Doug McIlroy
AEM  Alvaro E. Monge
GO   Greg Ozbirn
KQ   Ke Qiu
TO   Tim Oates
MR   Matthew Renzelmann
AS2  Ashish Sabharwal
CS   Chen Shuo
TS   Tim Snyder
GS   Gary Sutton
AS   Ari Stern
BT   Bob Toltzis
JV   Jean Vaucher

Printing History

First Printing: October 1998
You can see which printing you have by looking at the bottom of the copyright page for a sequence of numbers. If you see
1 2 3 4 5 6 7 8 9 10
you have the first printing.