Wishlist
Book Summary
A Textbook on Discrete Mathematics by C.V. Sastry and Rakesh Nayak is a comprehensive academic resource covering core discrete math topics like logic, sets, relations, combinatorics, graph theory, and algebraic structures. Designed for undergraduate and postgraduate students, it offers rigorous explanations, worked examples, and exercises to build foundational skills for computer science and mathematics.
This book is not available
Store  |
Condition |
Deals & Coupons | Price |
Est. Shipping |
Total |
Buy |
|---|---|---|---|---|---|---|
| Sorry we could not find any result for “9789386768698” | ||||||
About A Textbook On Discrete Mathematics
This textbook provides a thorough introduction to discrete mathematics, tailored for students in computer science, mathematics, and engineering. It systematically covers essential topics including mathematical logic, set theory, relations and functions, combinatorics, graph theory, and algebraic structures. Each chapter presents clear definitions, theorems, and proofs, followed by illustrative examples and a variety of exercises to reinforce learning. The authors emphasize problem-solving techniques and algorithmic thinking, making the content highly relevant to computing. With its structured approach and pedagogical features, the book serves as a solid foundation for advanced courses and professional practice. It is suitable for self-study and classroom use, offering a balanced mix of theory and application.
Who should read A Textbook On Discrete Mathematics?
This book is ideal for undergraduate and postgraduate students pursuing computer science, mathematics, or engineering degrees. It suits learners who need a rigorous foundation in discrete structures for algorithms, data structures, and theoretical computer science. Instructors can use it as a course text, while self-learners and professionals seeking to refresh their knowledge will find the clear explanations and exercises valuable. It assumes basic mathematical maturity but is accessible to motivated beginners.
Pros & Cons
Pros
- ✓ Comprehensive coverage of core discrete mathematics topics
- ✓ Clear and rigorous explanations with formal proofs
- ✓ Numerous worked examples and exercises for practice
- ✓ Relevant to computer science applications and algorithmic thinking
- ✓ Structured for both classroom use and self-study
Cons
- ✗ May be dense for absolute beginners without prior math background
- ✗ Some topics could benefit from more real-world examples
- ✗ Exercise solutions are not provided, limiting self-assessment
- ✗ Coverage of advanced topics may be brief for specialized needs
- ✗ Lacks supplementary online resources or interactive elements
Similar books
Frequently asked questions
What topics are covered in this textbook?
The book covers mathematical logic, sets, relations, functions, combinatorics, graph theory, algebraic structures, and other core discrete mathematics subjects.
Is this book suitable for self-study?
Yes, the clear explanations and exercises make it suitable for self-study, though some prior mathematical maturity is helpful.
Does it include solutions to exercises?
The book typically does not include solutions to all exercises, so it is best used alongside instructor guidance or for practice.
Which edition is this?
This is the edition with ISBN 9789386768698, published by WindsorBooks.
Is it aligned with computer science curricula?
Yes, the content is highly relevant to computer science programs, covering topics essential for algorithms and theoretical foundations.
At Windsorbooks, we compare prices from trusted sellers so you can buy, rent, or sell textbooks at the best total price — shipping included.
As an Amazon Associate, Windsorbooks.com may earn a small commission on qualifying purchases.