On the copyright page (facing the first page of the Preface), there is a
printing history of the book. The printing history is a row of numbers
that—at the 1st printing—looks like this:
10 9 8 7 6 5 4 3 2 1
At each subsequent printing, one number is removed from the end of this row of
numbers to indicate which printing of the book you have. For example, the last
number in the row of numbers in the 2nd printing is 2, and so on. In the list
below, [n] means that an error is fixed in the nth printing.
if statement consists of
a single statement” to “When a branch of an if
statement consists of a single statement”fabs to absvoid firstlast(const double a[], int size, double[] result)
to
void firstlast(const double a[], int size, double result[])
cin.get(ch), where ch is a variable
of type char. Use input redirection (Special Topic
4.3).”Whenever you put data to the stream, the get position
becomes undefined. Call seekg when you switch back to
reading. Similarly, call seekp when you switch from reading
to writing.
#include <string>
stream.seekg(start); // Go to the start of the pixels
to
int pos = start;
Change
int pos = stream.tellg(); // Go to the start of the pixel
to
stream.seekg(pos); // Go to the next pixel
Add the following into a line after stream.put(red);
pos = pos + 3;
(Why these changes? Some C++ systems are more user-hostile than others
and forget the get position when they write data.)
temp\output.dat or
c:emp\output.dat” to
“c:\temp\output.dat”.cctime to ctimedouble fabs(double x)to
int abs(int x)double abs(double x)BinarySearchTree; to BinarySearchTree
tree; and change tree.add to tree.insert
(5x)Thanks to Cindy Johnson, Evan Gallagher, Stephen Gilbert, Brent Seales, Jonathan Tolstedt and (your name might go here) for their bug reports and suggestions
Please use this form to report any bugs that you find. Please check the list of known bugs and the list of frequently asked questions first before you report a bug. Unfortunately, I do not have the time to respond personally to every report, but I do read them all and will post updates to this page. Thank you!