Some of these comments correct ERRORS, which should be corrected by hand in your copy. These corrections will be incorporated into a later edition.  Changes and new words are shown below in boldface type.

Section 0.0, Page 1:  What is discrete Mathematics?
Objects are said to be discrete if distances between them are irrelevant.
In this course, we focus on finite sets of numbers or other objects, and we do no calculus at all.

Section 3.1, Page 121, 
Definition 3.3.1  should be Definition 3.1.1
Corollary 3.3.2.1  should be Corollary 3.1.2.1
Theorem 1.3.2  should be Theorem 3.1.2

Section 3.1, Page 129, Practice Exercise 16
Symbol should be spelled cymbal.

Section 3.2, Page 146, Practice Exercise 5
The answer given should be the whole term and should include the appropriate power of x.

Section 4.1, Page 191-2, Practice Exercises
The figure labels are below the figures.

Section 4.5, Page 218, Theorem 4.5.1 Euler's Theorem
If a planar connected graph has V vertices, E edges, and F faces, then V-E+F-2.

Section 5.2, Page 246, Practice Exercises 12, 13
In establishing these identities, be sure to consider de Morgan's laws, complementarity, redundancy, and consensus.