Order from a Major Online Bookstore
Ultimate Book Price Comparison Engine
Save Your Time And Money
| AnyBook4Less.com | Order from a Major Online Bookstore |
|
| Home | Store List | FAQ | Contact Us | | ||
| Ultimate Book Price Comparison Engine Save Your Time And Money |
||
 |
Title: Concrete Mathematics: A Foundation for Computer Science by Ronald L. Graham, Donald Knuth, Oren Patashnik ISBN: 0-201-14236-8 Publisher: Addison-Wesley Pub Co Pub. Date: 01 September, 1988 Format: Hardcover Volumes: 1 List Price(USD): $49.95 |
Average Customer Rating: 4.27 (22 reviews)
Rating: 4
Summary: Fear first, love later
Comment: I used this book while studying Combinatorics at the University of Warwick, a leading British institution for mathematicians. At the time, the book was a little bit overwhelming - Knuth doesn't waste any time in getting to the point of solving problems in the book. Thus, if you're the type of person who needs lots of worked examples, I would supplement this with another book, for example, Grimaldi's Discrete and Combinatorial Mathematics. But this book does belong on the bookshelf - it is a great reference, particularly because it prepares one to read The Art of Computer Programming, also by Knuth. TAOCP is the definitive series on computer science, respected by computer scientists everywhere. I guess the best way to describe Concrete Mathematics is that if you are a graduate student in CS, you should own this book. If you are a mathematically-oriented undergraduate, this book will make you really understand anything that your professors will throw at you. But, if you are not a math-lover, you will want a backup and a really nice professor :)
Rating: 2
Summary: Fragmented writing style of some advanced math topics
Comment: This statement from a previous review:
"Very bright high school students have gotten through this text with little difficulty"
I dare you to present Hypergeometric functions in front of a highschool student... Most graduate students would be challenged with that!
This text is neither beautiful or elegant, and the little cutesy notes in the margins are distracting and childish.
(they are more memorable than the actual text)
Once the simplistic Towers of Hanoi and Josephus problem are presented, the authors totally ignore any problem solving and just blast into pure mathematical manipulations that are uninitiated. Why bother with a trivial example at first, and no examples for the remaining most difficult concepts?
Throughout the text are statements like "Some sequences of numbers arise so often that we give them special names"
Oh really? Where and why do they occur?
What about the sequences that do not occur frequently? The authors see no need to explain this. (Knuth: check out my expensive 3 book series, and dig for a few months)
And statements in the middle of chapters like:
"We now come to the most important idea in the whole book: generating functions."
Oh really? Why are they so important? (this is never explained) If so, why doesn't it have its own chapter, instead of being buried in a chapter on binomial coefficients without a lead-up?
Find a closed form for:
f[n] = f[n-f[n-1]] + f[n-f[n-2]]; where f[n] = n/2
(You could memorize and learn all the math in this book, and it would never help to solve this. It handily skirts the tough fundamental questions about math.)
I've never read a more fragmented presentation than this book, for important concepts.
You get the distinct impression of little kids "tee hee, look at the cool manipulations I can do, and you cant...see how smart I am??"....Knuth is laughing all the way to the bank.
Rating: 3
Summary: Only one problem with this textbook
Comment: Basically, I like this textbook. The material is interesting, the way the authors presented the material is inspiring, and they provided a lot of jokes to make even studying for exams not that boring. But there is one big problem which made me decided to rate this book only 3 stars instead of 5 stars: the authors like to use non-standard notations. For example: m\n means "m>0 and n=mk for some integer k". One of the worst thing in scientific world is writing things others cannot read, and the authors did this by introducing many strange notations. These things makes the good work sometimes almost unreadable. This is not computer systems in which we use "cp" for the copy command and "cd" for change directory command.
What a pity the authors did that. This textbook will be perfect without those strange notations....
 |
Title: The Art of Computer Programming, Volumes 1-3 Boxed Set by Donald E. Knuth ISBN: 0201485419 Publisher: Addison-Wesley Pub Co Pub. Date: October, 1998 List Price(USD): $164.99 |
 |
Title: Introduction to Algorithms, Second Edition by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein ISBN: 0262032937 Publisher: MIT Press Pub. Date: 01 September, 2001 List Price(USD): $79.95 |
 |
Title: An Introduction to the Analysis of Algorithms by Robert Sedgewick, Philippe Flajolet ISBN: 020140009X Publisher: Addison-Wesley Professional Pub. Date: 30 November, 1995 List Price(USD): $59.99 |
 |
Title: Introduction to the Theory of Computation by Michael Sipser ISBN: 053494728X Publisher: Brooks Cole Pub. Date: 13 December, 1996 List Price(USD): $103.95 |
 |
Title: A Course in Combinatorics by Jacobus Hendricus Van Lint, R. M. Wilson ISBN: 0521006015 Publisher: Cambridge University Press Pub. Date: 15 December, 2001 List Price(USD): $50.00 |
Thank you for visiting www.AnyBook4Less.com and enjoy your savings!
Copyright� 2001-2021 Send your comments
