Susanna Epp's DISCRETE MATHEMATICS, THIRD EDITION provides a clear introduction to discrete mathematics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. This book presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography, and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to the science and technology of the computer age. Overall, Epp's emphasis on reasoning provides students with a strong foundation for computer science and upper-level mathematics courses.

Benefits:

NEW!-Coverage of new topics suggested by the IEEE/CS and ACM joint committee on computing curriculum, including probability axioms and expected value, conditional probability and Bayes theorem, modular arithmetic, the Chinese remainder theorem, and RSA cryptography. Regular expressions and finite-state automata are also included, as recommended in by the ACM and IEEE-CS joint committee on the software engineering curriculum.

A flow-chart shows the prerequisite relations among the chapters, and most sections are divided into subsections so that instructors can easily tailor the book to meet the needs of their courses.

NEW!-Applications involving the Internet.

NEW!-Refinements to the exposition and exercises for improved pedagogy.

NEW!-Many new problems.

Every concept in the book is applied in at least one and often many different ways to motivate students. Eleven sections are explicitly devoted to applications to computer science, and additional applications are included in most sections.

A spiral approach, in which a number of concepts appear in increasingly more sophisticated forms, provides useful review and develops mathematical maturity in natural stages.

The book presents the unspoken logic and reasoning that underlie mathematical thought in a way that can be understood by typical freshman and sophomore college students.

In showing students how to discover and construct proofs and disproofs, Epp describes the kind of approaches that mathematicians use when confronting challenging problems in their own research.

A wealth of examples written in problem-solution form, and a large variety of exercises at all levels of difficulty are provided.

Susanna Epp's DISCRETE MATHEMATICS, THIRD EDITION provides a clear introduction to discrete mathematics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision. This book presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography, and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to the science and technology of the computer age. Overall, Epp's emphasis on reasoning provides students with a strong foundation for computer science and upper-level mathematics courses.

Benefits:

NEW!-Coverage of new topics suggested by the IEEE/CS and ACM joint committee on computing curriculum, including probability axioms and expected value, conditional probability and Bayes theorem, modular arithmetic, the Chinese remainder theorem, and RSA cryptography. Regular expressions and finite-state automata are also included, as recommended in by the ACM and IEEE-CS joint committee on the software engineering curriculum.

A flow-chart shows the prerequisite relations among the chapters, and most sections are divided into subsections so that instructors can easily tailor the book to meet the needs of their courses.

NEW!-Applications involving the Internet.

NEW!-Refinements to the exposition and exercises for improved pedagogy.

NEW!-Many new problems.

Every concept in the book is applied in at least one and often many different ways to motivate students. Eleven sections are explicitly devoted to applications to computer science, and additional applications are included in most sections.

A spiral approach, in which a number of concepts appear in increasingly more sophisticated forms, provides useful review and develops mathematical maturity in natural stages.

The book presents the unspoken logic and reasoning that underlie mathematical thought in a way that can be understood by typical freshman and sophomore college students.

In showing students how to discover and construct proofs and disproofs, Epp describes the kind of approaches that mathematicians use when confronting challenging problems in their own research.

A wealth of examples written in problem-solution form, and a large variety of exercises at all levels of difficulty are provided.