Essential for understanding networking, social maps, and pathfinding.
Prof. M. Umaparvathi is a Professor of Mathematics at Seethalakshmi Ramaswami College, also in Tiruchirappalli. Like her co-author, Prof. Umaparvathi brings over three decades of experience in teaching mathematics at the undergraduate and postgraduate levels. Her deep understanding of the student's perspective shapes the book's accessible and student-friendly approach. The collaboration of these two seasoned academicians results in a text that is both theoretically sound and practically applicable.
Understanding logical connectives (AND, OR, NOT, Implication, Bi-conditional).
, published by , is a comprehensive textbook designed to provide a firm foundation in discrete mathematical structures. Primarily intended for undergraduate and postgraduate students in computer science, engineering, and mathematics, the book balances theoretical rigor with practical applications. Core Topics Covered Umaparvathi is a Professor of Mathematics at Seethalakshmi
Below is a scannable blog post reviewing the book and detailing its importance in computer science.
The authors have implemented several features to aid both self-study and classroom learning:
Specialized chapters on coding theory, cryptography, computer models, and databases. Her deep understanding of the student's perspective shapes
Discrete Mathematics by N. Chandrasekaran and M. Umaparvathi. Publisher: PHI Learning Private Limited (Eastern Economy Edition). Format: PDF / Textbook.
The authors, both former professors from Tiruchirappalli, bring years of teaching experience to the page. Their work is specifically tailored to bridge the gap between abstract mathematical theory and its practical applications in computer science.
Are you preparing for a or a competitive test like GATE ? and hashing functions.
Definition, properties, distributive and complemented lattices.
: Details binary relations, equivalence relations, partial orderings, and hashing functions.