Wishlist
Book Summary
Mathematical Structures for Computer Science by Judith L. Gersting is a classic textbook that bridges discrete mathematics and computer science. It covers logic, proofs, sets, relations, functions, graphs, and combinatorics with a focus on applications. This edition, while older, remains a solid foundation for students seeking rigorous mathematical underpinnings for computing.
This book is not available
Store  |
Condition |
Deals & Coupons | Price |
Est. Shipping |
Total |
Buy |
|---|---|---|---|---|---|---|
| Sorry we could not find any result for “9780716713050” | ||||||
About Mathematical Structures for Compute...
Judith L. Gersting's Mathematical Structures for Computer Science is a comprehensive textbook designed for undergraduate computer science students. It introduces essential discrete mathematical concepts—logic, proof techniques, sets, relations, functions, graphs, trees, combinatorics, and Boolean algebra—with a clear emphasis on their relevance to computing. The book balances formal rigor with practical examples, helping readers develop problem-solving skills and mathematical maturity. Although this particular edition (ISBN 9780716713050) is dated, its core content remains timeless and foundational. The text includes numerous exercises and selected solutions, making it suitable for self-study or classroom use. It is not a workbook or test prep guide but a primary textbook that builds the theoretical framework necessary for advanced courses in algorithms, data structures, and computer architecture.
Who should read Mathematical Structures for Compute...?
This book is ideal for undergraduate computer science students taking a discrete mathematics or mathematical structures course. It also suits self-learners who need a rigorous introduction to the mathematical foundations of computing, and instructors seeking a classic, well-organized textbook. Readers should have basic algebra proficiency. While the edition is older, it remains valuable for those who want a thorough grounding in logic, proofs, and discrete structures without the distractions of newer, more expensive editions.
Pros & Cons
Pros
- ✓ Clear and thorough explanations of core discrete mathematics topics.
- ✓ Strong emphasis on applications to computer science, aiding motivation.
- ✓ Abundant exercises with selected solutions for practice.
- ✓ Well-structured progression from logic to advanced structures.
- ✓ Timeless content that remains relevant despite the book's age.
Cons
- ✗ Older edition may lack modern examples or updates.
- ✗ Some notation and references may feel dated to contemporary readers.
- ✗ No coverage of newer topics like machine learning mathematics.
- ✗ Limited online supplements or interactive resources.
- ✗ Print quality and availability may vary for this edition.
Similar books
Frequently asked questions
Is this book suitable for self-study?
Yes, the clear explanations and exercises with selected solutions make it usable for independent learning, though some mathematical maturity is helpful.
Does this edition cover Boolean algebra?
Yes, Boolean algebra is included as part of the logical structures covered, with applications to computer circuitry.
Is this a workbook or test prep book?
No, it is a primary textbook for a discrete mathematics course, not a workbook or test prep guide.
How does this compare to Rosen's Discrete Mathematics?
Both cover similar topics; Gersting's book is more concise and focused on computer science applications, while Rosen's is more encyclopedic.
Is the content still relevant given the book's age?
Yes, the mathematical foundations of computer science have not changed, so the core material remains highly relevant.
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.