Rating: 
Summary: Quite complete and clear
Review: Aho is one of the most respected authors in Computer science and he makes it clear why in this book. With the aid of step-by-step algorithms, schematics, good examples and exercises he accomplishes one of the most complete and clear books in CS for beginner students. The text is sometimes too extensive but it is never confusing or inadequate.
Rating: 
Summary: Informative, but terribly unclear
Review: As a computer science major in Brigham Young University, this book is required for 2 of my Sophomore classes. I am impressed by how much information this book contains. However, it is by no means clearly written. The wording is poor, the examples are vague, and the exercises are especially unmeaningful. Obviously, the author of this book is a computer scientist, but this shouldn't be the excuse for writing such a terrible book. Two third of my class hate this book, and we are thinking about having a festival to burn them together after this semester is over. we are asking for a better book which will hopefully contain the same amount of information, but better wording and examples.
Rating:
Summary: Probably the best book of this kind I have
Review: I have quite a few. Nevertheless, if you're just starting, or if you plan to buy only one book on data--make sure that's the one <g>. It simply fits the bill (under the conditions I mentioned above) better than the other ones. I also like it for the heck of it. It ain't no Knuth with his mix, you can read and use this one w/o burning sugar on some ridiculous stuff no one needs. Oh, also, it's good for self-study.
Rating: 
Summary: Good Mix of Discrete Math And Programming
Review: I'm not sure what the reviewers giving it 1-2 stars are complaining about? Maybe they just don't get it. I've been programming professionally for 8 years and I have yet to see a better book that ties Discrete Math with Computer Science. I think it gives a great example of how Induction and Recursive thinking are linked. I bought this book 3 years ago and I occasionally re-visit it to do all the exercises.... There's a lot but they are good. It's like going to the gym for a good workout but in the context of Computer Science.No, it's not introductory, but if you're having a hard time with Discrete Math and have a solid programming background, are willing to sit down and "Work out" the excercises, then this book is for you.
Rating:
Summary: Good Mix of Discrete Math And Programming
Review: I'm not sure what the reviewers giving it 1-2 stars are complaining about? Maybe they just don't get it. I've been programming professionally for 8 years and I have yet to see a better book that ties Discrete Math with Computer Science. I think it gives a great example of how Induction and Recursive thinking are linked. I bought this book 3 years ago and I occasionally re-visit it to do all the exercises.... There's a lot but they are good. It's like going to the gym for a good workout but in the context of Computer Science. No, it's not introductory, but if you're having a hard time with Discrete Math and have a solid programming background, are willing to sit down and "Work out" the excercises, then this book is for you.
Rating:
Summary: An always useful reference
Review: I've used this book for the namesake course at university, 2 years ago. It proved to be perfectly adequate at that time. It was very readable and complete. And this would be enough for me to give it a five stars rate.
But there's more. After these two years I've collected many other books in various areas of CS, but when I need a quick reference on any specific topic or I don't remember the formal definition of a concept, I always find this book in my hands. It is one of the references I use most often.
It has been my first book by the couple Aho-Ullman. Now I've understood that whenever these two "emeritus guys" writes something, it always worths time and money to read them.
Rating:
Summary: A great book for learning real computer science.
Review: Lots of interesting stuff in here if u r a learner. Still haven't finished the book yet after a year and a half.
Rating:
Summary: Huge book
Review: Lots of interesting stuff in here if u r a learner. Still haven't finished the book yet after a year and a half.
Rating:
Summary: Awesome book
Review: Makes me glad that I have taken CS. Keeps your brain alive and thinking
Rating:
Summary: Excellent book, even for experienced readers
Review: Overall, I think this book is an excellent book that anyone serious about computer science should own. I think that this book is good both for those new to computer science and those who have been involved in computer science for several years. For those new to computer science, I would not use this as a first book (this is made clear in the introduction, as well). The expectation is that the reader will already understand the basics of programming, so prior experience or an introductory course in computer science would be appropriate. Many of the examples make use of pointers, which can occasionally be confusing to students unfamiliar with programming, so it would definitely be a good idea for the reader to be familiar with a language like C or Pascal before starting this book. Once that foundation is in place, this is an excellent book to learn the basics of the field of computer science. For more experienced readers, this book serves as an amazing review and does a good job of collecting lots of information in one place. Explanations are solid, so the book can serve as a good reference for multiple topics. Note that the level of detail is not appropriate if you are just interested in one thing -- if you are interested only in details of algorithms, a book like the MIT Press Algorithms book would be more appropriate.
| 
