A Textbook of Discrete Mathematics provides an introduction to fundamental
concepts in Discrete Mathematics, the study of mathematical structures which are fundamentally discrete, rather than continuous. It explains how concepts of discrete mathematics are important and useful in branches of computer science, such as, computer algorithms, programming languages, automated theorem proving and software development, to name a few. Written in a simple and lucid style, it hasa balanced mix of theory and application to illustrate the implication of theory. It is designed for the students of graduate and postgraduate courses in computer science and computer engineering. The students pursuing IT related professional
courses may also be benefitted.
1. A Brief Survey of Discrete Mathematics
2. Mathematical Logic
3. Boolean Algebra and Logic Circuits
4. Set Theory
5. Matrices
6. Number Theory
7. Relation
8. Function
9. Posets and Lattices
10. Combinatorics
11. Recurrence Relation and Generating Function
12. Group Theory
13. Rings and Fields
14. Graph Theory - I
15. Graph Theory - II
16. Trees
17. Language, Grammar and Automata
18. Time Complexity of Algorithm
19. Vector Spaces
20. Elements of Coding Theory
• References
• Index
• Nearly 1000 solved examples throughout the book to facilitate understanding of
concepts
• More than 250 figures and 60 tables help explain the concepts lucidly and
illustrate the implications of theory
• More than 1000 practice set questions with answers presenting a mixture of
straight forward application to ideas of chapter to challenging problems and
nearly 500 multiple choice questions with answers at the end of each chapter to
test the reader's understanding and grasp over the topic
Be the first one to review