Sets, Logic and Maths for Computing...
Wishlist
This easy-to-follow textbook introduces the mathematical language, knowledge and problem-solving skills that undergraduates need to study computing. The language is in part qualit…
Book Summary
A concise, example-driven textbook that teaches the finite mathematics underpinning computer science: sets, relations, functions, recursion, induction, counting, probability, and logic. Makinson emphasizes intuition and problem-solving over abstraction, making it ideal for undergraduates who need a solid foundation before tackling algorithms, databases, or programming theory. The book includes exercises with selected solutions and highlight boxes that address common confusions.
This book is not available
Store  |
Condition |
Deals & Coupons | Price |
Est. Shipping |
Total |
Buy |
|---|---|---|---|---|---|---|
| Sorry we could not find any result for “9781447124993” | ||||||
About Sets, Logic and Maths for Computing...
David Makinson's 'Sets, Logic and Maths for Computing' is a carefully balanced introduction to the mathematical language of computing. It covers qualitative concepts like sets, relations, functions, and recursion/induction alongside quantitative topics such as counting and finite probability, all interwoven with fundamental logic for representation and proof. The book's intuitive approach, rich with examples, brings out the interplay between abstract principles and concrete applications. Highlight boxes raise common queries and clear up confusions, while numerous exercises with selected solutions reinforce learning. This textbook is designed to teach finite math as a language for thinking, not just a set of skills, making it an excellent foundation for computing undergraduates.
Who should read Sets, Logic and Maths for Computing...?
Undergraduate students in computer science, information systems, or related fields who need a solid mathematical foundation will benefit most. It suits those starting algorithms, data structures, databases, or discrete mathematics courses. Self-learners and professionals seeking to refresh their understanding of sets, logic, and finite math will also find it valuable. The intuitive style and examples make it accessible to readers with basic algebra, while the exercises support deeper practice.
Pros & Cons
Pros
- ✓ Clear, intuitive explanations with abundant examples
- ✓ Balances abstract concepts with concrete applications
- ✓ Highlight boxes address common confusions
- ✓ Exercises with selected solutions reinforce learning
- ✓ Covers both qualitative and quantitative topics essential for computing
Cons
- ✗ Assumes some mathematical maturity, may challenge absolute beginners
- ✗ Limited coverage of advanced topics beyond finite math
- ✗ Selected solutions only, not full solutions for all exercises
- ✗ Some readers may find the logic section dense
- ✗ Not a substitute for a dedicated discrete math or logic text
Similar books
Frequently asked questions
Is this book suitable for self-study?
Yes, the intuitive approach, examples, and selected solutions make it well-suited for self-learners, though some mathematical maturity is helpful.
Does it cover probability?
Yes, it includes principles of counting and finite probability, integrated with logic and set theory.
Are there exercises with answers?
Yes, numerous exercises are provided, with selected solutions at the end of the book.
What background is needed?
Basic high school algebra is sufficient; no prior programming or advanced math is required.
Is this book up-to-date for modern computing curricula?
The mathematical foundations are timeless, and the topics remain core to computing, though specific applications may vary.
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.