Functional mappings, injective/surjective properties, and applications. 3. Algebraic Structures
The book "Discrete Mathematics" by N. Chandrasekaran and M. Uma Parvathi has received positive reviews and ratings from students and professionals. The book has been praised for its clear and concise explanations, comprehensive coverage of topics, and numerous solved examples and exercises.
Comprehensive Guide to "Discrete Mathematics" by N. Chandrasekaran and M. Umaparvathi (PHI Learning)
Basics of counting, permutations with repetition, and the pigeonhole principle. Chandrasekaran and M
This public link is valid for 7 days and shares a thread, including any personal information you added. This link or copies made by others cannot be deleted. If you share with third parties, their policies apply. Can’t copy the link right now. Try again later.
The book is structured systematically to transition students from foundational logic to complex algebraic and computational structures. 1. Mathematical Logic and Propositional Calculus
: Later chapters delve into computer models and computation, coding theory, cryptography, and databases. Third Edition Updates : The newest edition (2022) includes a Question Bank Comprehensive Guide to "Discrete Mathematics" by N
Truth tables, tautologies, logical equivalences, and normal forms (DNF and CNF).
Spanning trees, rooted trees, binary trees, and traversal algorithms (DFS and BFS).
with university examination questions and updated chapters on Boolean algebra and graphs to align with current Indian university syllabi. Google Books Key Features for Students Worked Examples published by PHI Learning
An comprehensive academic review of , published by PHI Learning , highlights its role as a core textbook for computer science and mathematics students. Textbook Overview Title : Discrete Mathematics Authors : N. Chandrasekaran and M. Umaparvathi Publisher : PHI Learning Private Limited
It balances theoretical depth with practical applications.