Discrete Mathematics and Applications, Second Edition is intended for a one-semester course in discrete mathematics. Such a course is typically taken by mathematics, mathematics education, and computer science majors, usually in their sophomore year. Calculus is not a prerequisite to use this book.



Part one focuses on how to write proofs, then moves on to topics in number theory, employing set theory in the process. Part two focuses on computations, combinatorics, graph theory, trees, and algorithms.









Emphasizes proofs, which will appeal to a subset of this course market



Links examples to exercise sets



Offers edition that has been heavily reviewed and developed



Focuses on graph theory



Covers trees and algorithms