Description
PEARSON INDIA Discrete Mathematics 1St Edition 2011 by RAJENDRA AKERKAR
Discrete Mathematics provides an introduction to some of the fundamental concepts in modern mathematics. Abundant examples help explain the principles and practices of Discrete Mathematics. The book intends to cover material required by readers for whom mathematics is just a tool, as well as provide a strong foundation for mathematics majors. The vital role that Discrete Mathematics plays in computer science is strongly emphasized as well. The book is useful for students and instructors, and also software professionals.
Table of Content:
Proof Methods and Induction
Symbolic Logic
Set Theory
Relations
Functions and Recursion
Algebraic Structures
Graph Theory
Counting
Combinatorics
Automata
Program Verification
Design of Algorithms
Salient Features:
User-friendly, conversational style of writing
Covers topics such as combinatorics, proof methods, induction, sets, theory of automata
Examples in each chapter bring clarity to the most complex concepts