A Textbook of Discrete Mathematics (LPSPE), 9/e

A Textbook of Discrete Mathematics (LPSPE), 9/e


  • ISBN
  • Pages
  • Binding
  • Language
  • Imprint
  • List Price
Buy e-book online :

Save 25%, Apply coupon code SCHAND25 during checkout


About the Author

He is currently Professor and Head, MCA Department, Meghnad Saha Institute of Technology (a Unit of Techno India Group), Kolkata. He did his M.Sc. in Applied Mathematics from Jadavpur University, Kolkata, M.Tech. from IIT, Kharagpur and was awarded Ph.D. from BIT, Mesra, Ranchi. He has worked in St. Edmunds College/Shillong, a renowned college in North Eastern Region and Indian Railways Institute of Mechanical & Electrical Engg./Jamalpur, one of the premier institutes of the nation. He has more than 45 years of teaching experience in reputed degree and engineering colleges. He was selected and deputed from Indian Railways for a one-year course in U.K. in the field of Training Management under British Council. He has published several papers in national and international journals. He has to his credit authorship of following books:
1. Engineering Mathematics I & II for WBUT
2. Mathematical Foundation for Computer Science for JNTU
3. Mathematics for Computing for WBUT
4. Elements of Computer Science
5. Numerical Methods & Programming for WBUT

About the Book

A Textbook of Discrete Mathematics provides an introduction to fundamental
concepts in Discrete Mathematics, the study of mathematical structures which are fundamentally discrete, rather than continuous. It explains how concepts of discrete mathematics are important and useful in branches of computer science, such as, computer algorithms, programming languages, automated theorem proving and software development, to name a few. Written in a simple and lucid style, it hasa balanced mix of theory and application to illustrate the implication of theory. It is designed for the students of graduate and postgraduate courses in computer science and computer engineering. The students pursuing IT related professional
courses may also be benefitted.


1. A Brief Survey of Discrete Mathematics
2. Mathematical Logic
3. Boolean Algebra and Logic Circuits
4. Set Theory
5. Matrices
6. Number Theory
7. Relation
8. Function
9. Posets and Lattices
10. Combinatorics
11. Recurrence Relation and Generating Function
12. Group Theory
13. Rings and Fields
14. Graph Theory - I
15. Graph Theory - II
16. Trees
17. Language, Grammar and Automata
18. Time Complexity of Algorithm
19. Vector Spaces
20. Elements of Coding Theory
• References
• Index

Key Features

• Nearly 1000 solved examples throughout the book to facilitate understanding of
• More than 250 figures and 60 tables help explain the concepts lucidly and
  illustrate the implications of theory
• More than 1000 practice set questions with answers presenting a mixture of
  straight forward application to ideas of chapter to challenging problems and
  nearly 500 multiple choice questions with answers at the end of each chapter to
  test the reader's understanding and grasp over the topic