Today an increasing proportion of the applications of mathematics involves discrete rather than continuous models. The main reason for this trend is the integration of the computer into more and more of modem society. This book is intended for a one-semester introductory course in discrete mathematics.
Prerequisites Even though a course taught from this book requires few formal mathematical prerequisites, students are assumed to have the mathematical maturity ordinarily obtained by taking at least two years of high school mathematics, including problem-solving and algorithmic skills, and the ability to think abstractly.
Approach This book has a strong algorithmic emphasis that serves to unify the material. Algorithms are presented in English so that knowledge of a particular programming language is not required.
Choice of Topics The choice of topics is based upon the recommendations of various professional organizations, including those of 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.
Flexibility Although designed for a one-semester course, the book contains more material than can be covered in either one semester or two quarters. Consequently, instructors will have considerable freedom to choose topics tailored to the particular needs and interests of their students. Users of previous editions have reported considerable success in courses ranging from freshman-level courses for computer science students to upper-level courses for mathematics majors. The present edition continues to allow instructors the flexibility to devise a course that is appropriate for a variety of different types of students.