Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more

Discrete Mathematics for Computer Scientists (International Computer Science Series) Paperback

ISBN-13: 978-0201175646 ISBN-10: 0201175649 Edition: 2 Revised

See all 3 formats and editions Hide other formats and editions
Amazon Price New from Used from Collectible from
Paperback
"Please retry"
$28.33 $11.46
--This text refers to an out of print or unavailable edition of this title.

NO_CONTENT_IN_FEATURE
NO_CONTENT_IN_FEATURE

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: #3,021,323 in Books (See Top 100 in Books)

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.

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

3.0 out of 5 stars
5 star
1
4 star
0
3 star
0
2 star
0
1 star
1
See both customer reviews
Share your thoughts with other customers

Most Helpful Customer Reviews

1 of 2 people found the following review helpful By Zak Goichmann on August 28, 2005
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 Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again
4 of 8 people found the following review helpful 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 Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Product Images from Customers

Search
ARRAY(0x9d5042f4)

What Other Items Do Customers Buy After Viewing This Item?