Page	Line	Change	To
vii	13T	Tom and Joan	Tom, Joan, and Abigail Note:  Abby is my sixth grandchild.
31	10B ("B" = bottom,  "T" = top)	1 to MAX_SEATS	0 to MAX_SEATS - 1
100	Above diagrams	the second  "myHours"	myAMorPM
104	1st comment in class Time	Delete it
	Next to last in Fig. 3.5	Remove semicolon below const
110	9 in Fig. 3.7	* operator<< ...	/* operator<< ...
113		Note: If the constructor used in class Time is the one with default arguments described on p. 101, then an expression like          t < 2 where t is of type Time, is legal, because the constructor will construct a Time object from 2 and compare it with t,          t < Time(2) which will be evaluated as          t.operator<(Time(2)) However, an expression like          2 < t is meaningless because 2.operator<(t) is meaningless.     Because this might confuse some users of the Time class, it might be preferable to not make operator<() a member function in this case, so that both expressions are okay.
120	5 below box	str3 > str2	str2 > str3
136	Question 10		After s3.insert("colo", 10); is executed, s3will have the value _____
	Question 13	Delete
	Question 14	Renumber as 13
	Question 15	Renumber as 14
	Question 16	Renumber as 15
	Question 17	Renumber as 16
171	Figure	Remove bottommost "R"
186		Note: With some compilers,, the definition of top() may cause a compilation error because no value is returned in the case that myTop >= 0 is false.,  One way to get around this is to have top() return a "garbage" value such as myArray[STACK_CAPACITY - 1].
190	5T	StringStack.cpp	StringStack.h
192	Last sentence of Ex. 12	pop	push
206	Exercise 67	+ a b * - c d	* + a b - c d
209	4T	LOA	LOAD
224	14B	QueueElement front const();	QueueElement front() const;
234	16B	Delete the line: servicePercent[NUM_LIMITS] = 1;
239	6B	first-in-last-out	first-in-first-out
298	12B	Remove curly brace (}) at end of line Also see the note for p. 186,
332	2T	The last % 10	/ 10
333-4	Exercises 11 - 15	Delete the word  function  in first line of each exercise
	Exercises 16-19	Change to 16-20
334-6	Exercises 20 - 35	Renumber as 21 - 36
345	10 & 11T	if (symbol != ')')   return false;	if (symbol != ')')   return false; else   return true;  or better yet, return (symbol == ')');
355	15B	first < last	first <= last
366	Fig 7.6: Line 3	deque doesn't have to be included  (but it's okay)
371	Line 9 below Table 7.3	Delete "at the Winter Olympics" (Reason: As my dean pointed out to me, figure skating at the olympics is not scored in this way.)
379	Exercise 17 -- Line 3	Exercise 14	Exercise 13
460	Exercises 4 and 5	Renumber as 5 and 6
	1T	Insert new Exercise 4	4. Extend the class Polynomial in Exercise 3 to evaluate a polynomial at a given value.
	Exercise 6	Move to Section 12.3
464	Problem 16	reads values for x and evaluates the polynomial for each value	outputs the polynomial.
	Problem 17	Renumber as Problem 18
	3B	Insert new Problem 17	17. Extend your program from Problem 16 to evaluate polynomials using the modified class Polynomial in Exercise 4.
465	Problem 18	Renumber as Problem 19
	Problem 19	Delete
514	10B	x[loc]	v[loc]
575	15T	X[j]	x[j]
602	16B	(	{
	15B	x[left]	x[first]
651	11T	ElementType value	const ElementType & value
664	end	Add the following problem: 9.  In an ordered list, all operations that modify the list are designed to ensure that the elements remain in ascending order.  Build and test an OrderedList class template derived from class list that exhibits this characteristic.
697	Rightmost tree in diagram below "Insert 59:"	75 in parent of nodes containing 59 and 75	70
743	10T	' (' << g.Data(i) << "}\n"	" (" << g.Data(i) << ")\n"
	1&2 B	}	)
799	2T	setw	setfill
820	Quick Quiz 3.4  Ques. #4	2	3