Discrete Mathematics, Second Edition by Chandrasekaran, N., Umaparvathi, M
Discrete Mathematics, Second Edition by Chandrasekaran, N., Umaparvathi, M
DESCRIPTION
Wrien with a strong pedagogical focus, this second edion of the book connues to provide an
exhausve presentaon of the fundamental concepts of discrete mathemacal structures and their
applicaons in computer science and mathemacs. It aims to develop the ability of the students to
apply mathemacal thought in order to solve computaon‐related problems. The book is intended not
only for the undergraduate and postgraduate students of mathemacs but also, most importantly,
for the students of
of Computer
Computer Science & Engineering and Computer Applicaons.
The introductory chapter presents an overview of the founda ons of the subject, consisng of topics
such as logic, set theory, relaons, funcons, algebraic structures, and graphs. The subsequent
chapters provide detailed coverage of each of these topics as well as major areas of discrete
mathemacs such as combinatorics, laces and Boolean algebras. Major applicaons such as
computer models and computaon, coding theory, cryptography and databases are dealt with in the
final chapters of the book. In addion to this, a new chapter on matrices is included in this edion of
the book, which forms a part of
of MCA
MCA course curriculum.
The book is replete with features which enable the building of a firm foundaon of the underlying
principles of the subject and also provide adequate scope for tesng the comprehension acquired by
the students. Each chapter contains numerous worked‐out examples within the main discussion as well
as several chapter‐end Supplementary Examples for revision. The Self ‐Test and Exercises at the end of
each chapter provide large numbers of of objec
objecve type quesons and problems respecvely. Answers to
objecve type quesons and hints to exercises are also provided. All these pedagogic features,
together with thorough coverage of of the
the subject maer
er,, make this book a readable text for beginners as
well as advanced learners of
of the
the subject.
CONTENTS
N. Chandrasekaran, Ph.D., has been Professor of Mathemacs at St. Joseph’s College, Tiruchirappalli.
Prof. Chandrasekaran has many years of
of experience
experience in teaching mathemacs at the undergraduate and
postgraduate levels in reputed instuons. He is the co‐author of Theory of Computer Science
Science::
Automata, Languages and
and Computa
Computa on,
on, published by PHI Learning, Delhi.
M. Umaparvathi, M.Phil., has been Professor of Mathemacs at Seethalakshmi Ramaswami College,
Tiruchirappalli. Prof. Umaparvathi has a decade of experience in teaching mathemacs at the
undergraduate and postgraduate levels.