Product Description

This is a new edition of a successful introduction to discrete mathematics for computer scientists, updated and reorganised to be more appropriate for the modern day undergraduate audience. Discrete mathematics forms the theoretical basis for computer science and this text combines a rigorous approach to mathematical concepts with strong motivation of these techniques via practical examples.

Product Details

• Amazon Sales Rank: #321877 in Books
• Published on: 1998-10-27
• Original language: English
• Number of items: 1
• Binding: Paperback
• 608 pages

Customer Reviews

The best Mathematics book I have ever seen
Being a final year Mathematics degree student, I have seen my fair share of Maths books. Of these, Prof Truss' "Discrete Mathematics for Computer Scientists" is among the best. The definitions are accurate and the structure of the book is highly intuitive. This book has proved to be an extremely useful resource for me over the last two years, covering graph theory, ring theory, logic, computability and more. I would strongly recommend anyone with any interest at all in discrete maths or algebra to obtain a copy of this book.

"Discrete Mathematics for Computer Scientists" covers a number of topics in Mathematics but still goes into considerable detail in each of these. I bought this book hoping it would help me with the mathematical logic module I was studying at the time. Instead, it helped me with my whole degree!

The book that got me through my exams!
For anyone taking any courses in Linear Algebra and Logic, this is the perfect book!It starts with the basics and goes through a lot of examples very clearly!After each topic there are summary pages and all the proofs are in bold! This book definately helped me through my exams!

Useful but dull.
This book has relevant examples but finding the theory and linking the two can be a bit of a struggle. There seems to be a stage missing between the theory and the practical stages.