Discrete Mathematics

Rajendra Akerkar, Technomathematics Research Foundation,
Rupali Akerkar, The New College
ISBN-8129701189
Adopted in Many University courses  


Softcover
332 Pages
© 2003 Pearson Education India 

Buy This Book
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.
Key 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 

  • Appropriate for students of BE (Computer/IT), BTech (Computers/IT), MCA, MCM, MSc (Mathematics/Computer Science)

  • Incorporates most of the recommendations of the Curriculum Committee on Computer Science/Engineering for Discrete Mathematics

Copyright ©2009 All content
Table of Contents
  1. Proof Methods and Induction
  2. Symbolic Logic
  3. Set Theory
  4. Relations
  5. Functions and Recursion
  6. Algebraic Structures
  7. Graph Theory
  8. Counting
  9. Combinatorics
  10. Automata
  11. Program Verification
  12. Design of Algorithms