The authors avoid skipping logical steps, making abstract mathematical proofs accessible to engineering students who may not have a pure mathematics background.
Print copies feature comprehensive index tables and appendices that remain highly valuable for open-book examinations and library reference.
Having built a strong theoretical framework, the book moves into more specialized and applied areas. and Chapter 9, "Boolean Algebras," are fundamental to the design and theory of digital logic circuits, which form the basis of all computer hardware. Chapter 10, "Graphs," and Chapter 11, "Trees," introduce the graph theory concepts that are the backbone of network analysis, routing algorithms, data structures (like binary search trees), and modern social network analysis. Chapter 12, "Models of Computers and Computation," bridges the gap between mathematics and theoretical computer science by introducing finite automata and formal languages. Chapter 13, "Additional Topics," provides glimpses into other important areas like coding theory and cryptography. Finally, Chapter 14, "Matrices," (a key addition in the second edition) equips students with the tools for solving systems of linear equations, which are ubiquitous in computer graphics, machine learning, and scientific computing. The authors avoid skipping logical steps, making abstract
"Discrete Mathematics" by N. Chandrasekaran and M. Umaparvathi is a well-established textbook designed for undergraduate and postgraduate students. In its second edition, the book is described as providing "an exhaustive presentation of the fundamental concepts of discrete mathematical structures and their applications in computer science and mathematics". Its primary goal is to develop students' ability to apply mathematical reasoning to solve computation-related problems. The book is a collaborative effort between two distinguished academics from India.
Graded exercises allow students to test their understanding and prepare thoroughly for university examinations. Digital Availability: PDFs and PHI Learning Resources and Chapter 9, "Boolean Algebras," are fundamental to
In the world of academic legends, by N. Chandrasekaran and M. Umaparvathi
It is ideal for BCA, MCA, B.Sc./M.Sc. Mathematics, and B.E./B.Tech Computer Science students. The book is also suitable for:
Each chapter concludes with a diverse set of problems, from basic to advanced, facilitating thorough practice.
Complex mathematical proofs are broken down into logical, text-based prose rather than skipping intermediate steps.
The book "Discrete Mathematics" by N. Chandrasekaran and M. Uma Parvathi is designed for undergraduate students of computer science, mathematics, and engineering. The book is also suitable for: