Enter your mobile number below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
Getting the download link through email is temporarily not available. Please check back later.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

Discrete Mathematics for Computer Scientists (International Computer Science Series) 2 Revised Edition

3.0 out of 5 stars 2 customer reviews
ISBN-13: 978-0201175646
ISBN-10: 0201175649
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Have one to sell? Sell on Amazon
Buy used
$1.39
Condition: Used - Good
In Stock. Sold by greener_books_london
Condition: Used: Good
Comment: **We ship within 24hrs. 98% of orders are received in the USA within 7 - 12 days. We believe you will be completely satisfied with our quick and reliable service. All orders are dispatched as swiftly as possible! Buy with confidence!
Access codes and supplements are not guaranteed with used items.
14 Used from $1.39
+ $3.99 shipping
More Buying Choices
7 New from $25.00 14 Used from $1.39
--This text refers to an out of print or unavailable edition of this title.

Windows10ForDummiesVideo
Windows 10 For Dummies Video Training
Get up to speed with Windows 10 with this video training course from For Dummies. Learn more.
click to open popover

Editorial Reviews

From the Back Cover

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.

Key Features
  • Thorough coverage of all area of discrete mathematics, including logic, natural numbers, coding theory, combinatorics, sets, algebraic functions, partially ordered structures, graphs, formal machines & complexity theory
  • Special emphasis on the central role of propositional & predicate logic
  • Full chapters on algorithm analysis & complexity theory
  • Introductory coverage of formal machines & coding theory
  • Over 700 exercises
  • Flexible structure so that the material can be easily adapted for different teaching styles.
New to this Edition
  • Improved treatment of induction
  • Coverage of more 'basic' algebra
  • List of symbols including page references for definition/explantion
  • Modern text design and new exercises to aid student comprehension


0201360616B04062001 --This text refers to an out of print or unavailable edition of this title.

About the Author

John Truss has taught at Oxford University, Paisley College of Technology and currently at the University of Leeds. He has been a committee member of the British Logic Colloquium since 1990, and has recently been appointed an editor of the Journal of the London Mathematical Society. He wrote Foundations of Mathematical Analysis in 1997 and has authored 40 research papers.



0201360616AB04062001 --This text refers to an out of print or unavailable edition of this title.
NO_CONTENT_IN_FEATURE

New York Times best sellers
Browse the New York Times best sellers in popular categories like Fiction, Nonfiction, Picture Books and more. See more

Product Details

  • Series: International Computer Science Series
  • Paperback: 688 pages
  • Publisher: Addison-Wesley; 2 Revised edition (August 1991)
  • Language: English
  • ISBN-10: 0201175649
  • ISBN-13: 978-0201175646
  • Product Dimensions: 1.2 x 6.8 x 9.2 inches
  • Shipping Weight: 2 pounds
  • Average Customer Review: 3.0 out of 5 stars  See all reviews (2 customer reviews)
  • Amazon Best Sellers Rank: #4,066,161 in Books (See Top 100 in Books)

Customer Reviews

5 star
50%
4 star
0%
3 star
0%
2 star
0%
1 star
50%
See both customer reviews
Share your thoughts with other customers

Top Customer Reviews

By Paul on December 12, 2000
Format: Paperback
I am a teacher's assistant for an undergraduate computer science course that uses this book. I have to say that it really is a terrible book for students to learn from who have never had much exposure to non-calculus math and the concept of the "mathematical proof". It skims over topics without providing enough exposition on the topics to allow students to have a fair grasp on the subject. This may just be the nature of teaching discrete math, but there seem to be far too many topics that Truss is trying to squeeze into too small of a space. He tries to throw in some more advanced topics such as formal machines and complexity theory, but only at the cost of having the overall quality of the material be watered down. Sadly, though, from what I have heard, this is the best current intro discrete math book out there.
3 Comments 8 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback
I will have to agree with the other reviewer that it seems as if Truss is trying to cram lots and lots of discrete mathematics into an indiscrete stack of 500pp but i think he has done very well. At least in addressing those who need to skim over the material quickly, though they would love instead to relish on Grimaldi's.

:)
Comment One person found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Pages with Related Products. See and discover other items: discrete math