This carefully structured text provides a comprehensive, straightforward treatment of discrete mathematics. The author's traditional, deductive approach avoids unnecessary abstraction and covers a wide range of topics, from graph theory and combinatorics to number theory, coding theory and algebraic methods. Abundant examples and exercises help students gain a solid understanding of the subject. The revised edition incorporates changes suggested by instructors already using the text. The new material includes descriptions of algorithms that closely resemble a real programming language for easier implementation by students of both mathematics and computer science.