Discrete Mathematics with Proof, 2nd Edition

Emphasizes proof (combinatorial and non-combinatorial) throughout in the text and exercises, and homework problems have been designed to reinforce the book's main concepts

Contains many examples that are not present in most discrete mathematics books, including the deferred acceptance algorithm, the Boyer-Moore algorithm for pattern matching, Sierpinski curves, Persian rugs, adaptive quadrature, the Josephus problem, the five color theorem, and relational databases

Includes Quick Check problems at critical points in the reading, and it is intended for these problems to be solved before moving on to the next section in the chapter.  Also, many worked examples can be found throughout, which are used to motivate the presented theorems and illustrate the conclusion of a theorem.

Features many important examples from the field of computer science, including the Halting problem, Shannon's mathematical model of information, XML, and Normal Forms in relational databases