
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Discrete Mathematics is a textbook designed for the students of computer science engineering, information technology, and computer applications to help them develop their foundations of theoretical computer science.With a detailed introduction to the propositional logic, set theory, and relations, the book in further chapters explores the mathematical notions of functions, integers, counting techniques, probability, discrete numeric functions and generating functions, recurrence relations, algebraic structures, poset and lattices. The discussion ends with the chapter on theory of formal and finite automata, graph theory and applications of discrete mathematics in various domains.Adopting a solved problems approach to explaining the concepts, the book presents numerous theorems, proofs, practice exercises, and multiple choice questions.
This text investigates the foundational mathematical principles required for students pursuing degrees in computer science, information technology, and computer applications. Authors H. S. Dhami and R. K. Bisht provide a structured pedagogical framework that bridges abstract mathematical theory with practical computational logic. By utilizing a solved-problems approach, the authors demonstrate how discrete structures serve as the bedrock for algorithms, data analysis, and formal systems in modern computing.
What You Will Find
This textbook is recognized as a standard resource for undergraduate students seeking a rigorous introduction to the mathematical foundations of computer science. Experts highlight the inclusion of numerous solved problems and practice exercises as a primary strength for students preparing for examinations and technical coursework.
Page Count:
600
Publication Date:
2015-01-01
Publisher:
Oxford Univ Pr
ISBN-10:
0199452792
ISBN-13:
9780199452798
No comments yet. Be the first to share your thoughts!