This comprehensive textbook offers a rigorous yet accessible introduction to fundamental concepts in discrete mathematics, designed for undergraduate and graduate students in computer science, computer engineering (including diploma and degree levels), BCA, MCA, and other IT-related professional programs.
Beginning with a survey of discrete mathematics and its importance, the book progresses through core areas such as mathematical logic, Boolean Algebra, Set Theory, Matrices and Number Theory. It also explores Relations, Functions, Posets, Lattices and Combinatorics, building a solid understanding of these crucial structures. Further chapters delve into Recurrence Relations, Generating Functions, Group Theory, Rings and Fields. A thorough treatment of graph theory, including graph coloring and matching, is provided, followed by an introduction to trees and their applications. The book concludes with chapters on vector spaces and an introduction to coding theory.
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. Vector Spaces
18. Elements of Coding Theory
Index
Chapters On Web:
19. Language, Grammar and Automata
20. Time Complexity of Algorithm
21. Probability
Zoom
Reviews
There are no reviews yet.