Errata

Print Print Icon

Submit your own errata for this product.


The errata list is a list of errors and their corrections that were found after the product was released.

The following errata were submitted by our customers and have not yet been approved or disproved by the author or editor. They solely represent the opinion of the customer.

Color Key: Serious Technical Mistake Minor Technical Mistake Language or formatting error Typo Question



Version Location Description Submitted By
Printed Page 1
page 137 Figure 6-1

The image shows examples of Graphs. There are three examples
(A) House of Tudors
(B) Airline Schedule
(C) Computer network


The book mixes up B and C in the description as it matches a picture of the United States with "Computer Network" and a LAN with "Airline Schedule"

First Edition
978-0-596-51624-6

 Matt Kelly 
PDF Page 15
2nd paragraph from the bottom of the "The Effect of Encoding on Performance" sidebar

Missing 'i' in 'manipulaton' of 'using string manipulaton operations.'

 Kyungwon Chun 
Printed Page 24
Example 2-1

while (high - low <= 2)

should actually be

while (high - low >= 2)

 John Leitch 
Printed Page 25
2nd paragraph

f'(x)=x*cos(x)+sin(x)-5-sin(x)=x*cos(x)-5

should be

f'(x)=x*cos(x)+sin(x)-5+sin(x)=x*cos(x)+2*sin(x)-5

 Kyungwon Chun 
Printed Page 36
Example 2-7

The square brackets should be parentheses and helper function sub1 is not defined in Example A-6 or the code repository. Thus the Example 2-7 should be as follows.

(define (TwoToTheN n)
(let loop ((i n)
(result 1))
(if (= i 0)
result
(loop (- i 1) (* 2 result)))))

 Kyungwon Chun 
Printed Page 36
Table 2-6

The elapsed time of op1 at the input size of 100,000 on the implementation A is reduced compared to one at the input size of 1,000.

 Kyungwon Chun 
Printed Page 48
1st paragraph

"For a float, the bias is 126" correctly attributed to Venners, 1996.
Venners, at the website in the chapter reference contains the same (mis)information.

IEE 754-1985, in table 3.5 (contained in page 25 of my copy of the standard) shows the bias as 127 for 32-bit float. Other references also list the bias value as 127.

Venners article discusses Java, and makes the claim that it follows IEE-754 standard, but also lists the bias number as 126. For 64-bit floats, Venners correctly states bias of 1023.
Finally, it makes more sense for the bias to be an odd number...

 GoSpitfires 
Printed Page 68
1

Best Median Sort speed is not equal O(nlogn).I think it is equal O(n).

 Newton 
Printed Page 71
3rd paragraph from the last

if k > p+1
The k-th element of A is the (k-p)th element of A[p+1, right].

should be changed to

if k > p+1
The k-th element of A is the (k-p-1)th element of A[p+1, right].

 Diko Dong-il Ko 
Printed Page 71
2nd paragraph from the bottom

the k=8th largest element
should be
the k=8th (smallest) element

 Kyungwon Chun 
Safari Books Online 87
Fig 4-14 line 9

There is no variable i in this function. It should be idx instead of i.

Now: Swap A[i] and A[largest]
Correct: Swap A[idx] and A[largest]

;-)

 marstein1 
Printed Page 89
7th line of Example 4-9

/* Find largest element of A[idx], A[left], and A[right]. *

should be

/* Find largest element of A[idx], A[left], and A[right]. */

 Kyungwon Chun 
Printed Page 109
Example 5-3 and the paragraph above it.

'SEQUENTIAL SORT' should be 'SEQUENTIAL SEARCH'.

 Kyungwon Chun 
Printed Page 120
Last paragraph

I assuming "upcming" was intended to read "upcoming".

 Jon Bauman 
Printed Page 123
1st line

approximately 4.6 times
should be
approximately 3.6 times

 Kyungwon Chun 
Printed Page 135
the last reference

Redundant quotation mark on the last reference.
"GPERF: A Perfect Hash Function Generator," Proceedings of the Second C++ Conference":
->
"GPERF: A Perfect Hash Function Generator," Proceedings of the Second C++ Conference:

 Kyungwon Chun 
Printed Page 137
Figure 6-1 caption

(b) is the computer network and (c) is the airline schedule

 Jon Bauman 
Safari Books Online 137
Figure 6-1

Figure 6-1. (b) computer network, (c) airline schedule

should be

Figure 6-1. (b) airline schedule, (c) computer network

 junyoung 
Printed Page 137
last paragraph

The explanation of the last graph type is rather close to a multigraph.

 Kyungwon Chun 
Printed Page 139
in <Storage Issues>

On page 139 in "Algorithms in a nutshell" (George T. Heineman) is a mistake:
in <Storage Issues> ... of 256MB, creating a two-dimensional matrix new int[4096][4096 exceeds ...

int[4096][4096] => 4096*4096*4 (4 bytes for integer in java) gives total 64MB, and not 256MB and DOESN'T exceed the availabe memory!!

 Anonymous 
Printed Page 144
line 1 of depthFirstSearch(G,s) in the Figure 6-9

foreachv&#8712;V do
should be
foreach v&#8712;V do

 Kyungwon Chun 
Printed Page 151
Figure 6-12

According to the last line of p.149, the vertex 3 should be black.

 Kyungwon Chun 
Printed Page 168
The first line in the block comment at Example 6-8

Output path as vector of vertices ...
should be
Output path as a list of vertices ...

 Kyungwon Chun 
Printed Page 171
At the small example of Figure 6-19

'process 4' and 'process 3' should be interchanged.

 Kyungwon Chun 
Printed Page 191
Text

"dark-gray" board states referred to in diagram should be light grey.

 Rixs 
Printed Page 201
last row, 2nd column of Table 7-3

Ignore blank cell.
is better to be
Ignore center cell.

 Kyungwon Chun 
Printed Page 205
title row of table 7-4 and the equations below the table

sDFS2(n) and DFS2(n)
should be
sDFS(2n) and DFS(2n)
,respectively.

 Kyungwon Chun 
Printed Page 219
the lower-right text in the Figure 7-21

'X can at least force --2 score ...'
should be
'X can at least force -2 score ...'

 Kyungwon Chun 
Printed Page 229
In the description of network flow criteria

The mathematical representations of ‘capacity constraint(0&#8804;f(u,v)&#8804;c(u,v))’ and ‘skew symmetry(f(u,v)=-f(v,u))’ are conflict each other.

 Kyungwon Chun 
Printed Page 245
Image associated with Iteration 4 for Maximum Flow (the left column)

There is a small typo in the final image associated with Iteration 4 of Ford-Fulkerson in computing the network flow. Specifically, there should be 200 units flowing from vertex 1 to vertex 3.

 George T. Heineman
George T. Heineman
O'Reilly AuthorO'Reilly Blogger 
Printed Page 282
diagram

Diagram of kd-tree omits labels on lines V, H.

Rixs 
Printed Page 312
Page break p311-p312

p311 - p312: Confusing non-sequiteur of topic due to page break.

Rixs 
Printed Page 319
Text

Reference to chapter 11 should be chapter 10.

Rixs 
Printed Page 324
the eqn. to calculate a standard deviation

the RHS of the eqn. should be square rooted.

 Kyungwon Chun 
Printed Page 330
The paragraph above Example A-6

(used in Chapter 1)
should be
(used in Chapter 2)

 Kyungwon Chun 
Printed Page 332
Example A-8

The square brackets should be parentheses and helper function sub1 is not defined in Example A-7 or the code repository. Thus the largeAdd function in Example A-8 should be as follows.

(define (largeAdd probSize)

(let loop ((i probSize)

(total 0))

(if (= i 0)

total

(loop (- i 1) (+ i total)))))

 Kyungwon Chun 
Printed Page 333
The last sentence of the 1st paragraph

The "spike" can be seen in the histogram table. So, the last sentence should be
'seen in this case in Table A-4.'

 Kyungwon Chun