An ever-increasing percentage of mathematic applications involve discrete rather than continuous models. Driving this trend is the integration of the computer into virtually every aspect of modern society. Intended for a one-semester introductory course, the strong algorithmic emphasis of Discrete Mathematics is independent of a specific programming language, allowing students to concentrate on foundational problem-solving and analytical skills. Instructors get the topical breadth and organizational flexibility to tailor the course to the level and interests of their students.Approach: A strong algorithmic emphasis serves to unify the material. Algorithms are presented in English, eliminating the need for knowledge of a particular programming language. Choice of Topics: Based upon the recommendations of respected professional organizations--the MAA's Panel on Discrete Mathematics in the First Two Years, the NCTM's Principles and Standards for School Mathematics, and the CBMS's recommendations for the mathematical education of teachers-this text offers a solid, comprehensive introduction to discrete mathematics. Flexible Design: The wealth of material in Discrete Mathematics gives instructors the freedom to tailor their course to suit the interests and level of their students. The relative independence of chapters along with an optional review of logic and proof in the appendix allows for considerable flexibility in structuring a course. Exercises: Straightforward computational and algorithmic exercise sets follow each chapter section immediately reinforcing material and providing valuable hands-on practice with core concepts. Further exercises extend chapter material and introduce new concepts, and more challenging, advanced exercises are identified as such. Supplementary Exercises: Ending each chapter, these sets of supplementary exercises reprise the most important concepts and techniques of the chapter and explore new ideas not covered elsewhere. Computer Projects: Computer Projects, included at the end each chapter, challenge students to apply chapter content to actual applications and underscore the connection between computing and discrete mathematics. These are purposely stated in general terms for use with any number of computing systems and languages. Historical Notes: New and enhanced Historical Notes have been added to each chapter. These compelling portraits of influential mathematicians tell the story behind the theories and concepts in the chapter. Changes in the Fifth Edition Coding Theory: A new chapter 3 has been added that includes material on Matrix Codes, Error Correcting Codes, Congruence, Euclidean Algorithm and Diophantine Equations, and the RSA Algorithm.