# Discrete mathematics with applications

Material type: TextPublication details: Belmont : Thomson-Brooks, ©2004Edition: 3rd edDescription: xix, 775, 116, 13 p. : ill. ; 27 cmISBN:- 9780534490966

- 510 EPP-D

Item type | Current library | Collection | Call number | Status | Notes | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|---|

Books | IIITD General Stacks | Mathematics | 510 EPP-D (Browse shelf(Opens below)) | Available | Gifted by Dr. Samaresh Chatterjee | G02716 |

Includes index.

Chapter 1 : The logic of compound statements

Chapter 2 : The logic of quantified statements

Chapter 3 : Elementary number theory and methods of proof

Chapter 4 : Sequences, mathematical induction, and recursion

Chapter 5 : Set theory

Chapter 6 : Properties of functions

Chapter 7 : Properties of relations

Chapter 8 : Counting and probability

Chapter 9 : Theory of graphs and trees

Chapter 10 : Analysis of algorthm efficiency

Chapter 11 : Regular expressions and finite-state automata

Chapter 12 : Appendix A Properties of the real Numbers

This 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.

There are no comments on this title.