# Errata List

Unfortunately, despite our best efforts in testing our book, just like any software program, our book still has a few faults. While we wish there were none, we would rather know about the ones that are there and encourage our readers to let us know if you find mistakes. Unless you ask us not to, we will credit you with the mistake that you found. The responsibility for the errors, of course, lies with my co-author.

The corrections are ordered by page numbers in the book and each correction includes the date it was added to this list and who found it.

Quick chapter index: cover | preface | ch 1 | ch 2 | ch 3 | ch 4 | ch 5 | ch 6 | ch 7 | ch 8 | ch 9 | ch 10 | ch 11 | ch 12 | ch 13 | ch 14 | References

Cover

• Back Cover, 21-Mar-2017: Missing acknowledgement: "Cover art by Peter Hoey and Maria Hoey".
Found by the authors, George Mason University.

Preface

Chapter 1

Chapter 2

Chapter 3

Chapter 4

Chapter 5

Chapter 6

Chapter 7

• Page 130, 21-Mar-2017: Exercises, Section 7.2.3, number 1, Graph III: The specification of the set of final nodes (Nf) is missing. It should be exactly as for Graph II. (The student and instructor solutions are correct.)
Found by SWE 637 Class, George Mason University.
• Pages 145-146, 21-Mar-2017: Exercises, Section 7.3, number 8:
change "java.util.AbstractList" to "java.util.AbstractList<E>";
change "`ListIterator e1 = listIterator();`" to "`ListIterator<E> e1 = listIterator();`"
change "`ListIterator e2 = ((List) o).listIterator();`" to "`ListIterator<?> e2 = ((List<?>) o).listIterator();`"
part (a): change "node number" to "node numbers";
part (b): change "\$\parallel\$" to "||";
Found by SWE 637 Class, George Mason University.

Chapter 8

• Page 179, 15-Apr-2017: last paragraph: The phrase "Predicate Coverage for the above clause could also be satisfied..." should be "Predicate Coverage for the above predicate could also be satisfied..."
Found by Kien Nguyen, George Mason University.
• Page 196, 28-Mar-2017: Exercises, Section 8.1, number 4(c): The sentence "Write the complete truth table for each clause." should be "Write the complete truth table for the predicate."
Found by SWE 637 Class, George Mason University.

Chapter 9

• Page 249, 30-Apr-2017: Definition of COR: "or-k" should be "or-||" and "or with no conditional evaluation-j" should be "or with no conditional evaluation-|".
Found by Andrew Yuen, George Mason University.
• Page 250, 30-Apr-2017: Definition of LOR: "bitwise or(j)" should be "bitwise or(|)"
Found by Andrew Yuen, George Mason University.

Chapter 10

Chapter 11

Chapter 12

Chapter 13

Chapter 14

References

 Back