Higher Education

shoe image

Discrete Mathematics with Applications

Author(s): Susanna S. Epp

ISBN: 9789355731029

5th Edition

Copyright: 2020

India Release: 2021

₹1125

Binding: Paperback

Pages: 1056

Trim Size: 254 x 203 mm

Refer Book

Order Inspection Copy

DISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, Metric Edition explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. Author Susanna Epp 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 today's science and technology.

 

  • Offers over 2,500 exercises and numerous applied problems across diverse applications.
  • Uses clear, concrete examples to simplify logic and language, aiding students from varied backgrounds.
  • Clearly marked features, definitions, and theorems make it a lasting reference tool.
  • Flexible structure allows instructors to tailor content to different course needs.
  • Includes 500+ worked examples with step-by-step proof strategies for conceptual clarity.
  • Integrates computer science applications to support transition into advanced CS topics.
  • Adds new content on binary search trees, cryptographic hash functions, and message authentication.
  • Expanded sections on quantifiers, proof-writing, and set theory based on classroom feedback.
  • Reorganized and enriched content on mathematical and structural induction with more applications.
  • Introduces strings and graphs early, with the handshake theorem moved to Chapter 4.
  • Simplifies explanations of two’s complement and asymptotic notations (O, Ω, Θ) for better understanding.

1. Speaking mathematically

2. The logic of compound statements

3. The logic of quantified statements

4. Elementary number theory and methods of proof

5. Sequences, mathematical induction, and recursion

6. Set theory

7. Properties of functions

8. Properties of relations

9. Counting and probability

10. Theory of graphs and trees

11. Analysis of algorithm efficiency

12. Regular expressions and finite state automata

Susanna S. Epp

Susanna S. Epp received her Ph.D. in 1968 from the University of Chicago, taught briefly at Boston University and the University of Illinois at Chicago, and is currently Vincent DePaul Professor Emerita of Mathematical Sciences at DePaul University.