 | |
| |
Fundamentals of Sequential and Parallel Algorithms
 |
Author: Kenneth A. Berman, Ken Berman, Jerome Paul
List Price: $103.95
Our Price: Click to see the latest and low price
ISBN: 0534946747
Publisher: Brooks Cole (23 August, 1996)
Edition: Hardcover
Sales Rank: 547,017
Average Customer Rating: 1 out of 5
|
Customer ReviewsRating: 1 out of 5
Explains nothing, condenses 1000s pages material into 100s
This book makes so many assumptions and explains so little it may as well be written in greek (which most of it actually is since it uses so many symbols). This book might make a great graduate or doctorate level book if you already know most of what is in the book but which to examine it more in depth. This book is horrible on its own and any professor using it as an undergrad book must be friends with Berman and Paul. Like someone else noted it is full of things refering you to problems and proofs as examples. Like in Chapter 14 it will say "based upon the proof you did in problem. 2.14" instead of explaining what they are talking about and often even asking you to prove or figure out something on your own as basis for another proof or problem.
Rating: 1 out of 5
This incomplete text is a poor learning tool
In several places in this book, there are concepts central to the field of algorithms left completely out. On numerous occasions, the book will be missing a vital proof useful for many of the problem sets. The proof will be mentioned, but only in its own problem, expecting the user to derive the proof on his or her own. That would not be a problem if this text, like most GOOD texts, included an answer key so the student could learn. There are entire bodies and methods of proofs only to be found in the problem sets, with no examples in the text. It is difficult to learn and do the work when it is never stated what is expected.
Rating: 1 out of 5
Too many assumptions
I had to purchase this book for a class, taught by the authors no less - and I must say the book is put together very well visually. There are some parts of the book that are elegantly written, and explain some things in good detail, but they seem to be in the minority. On the whole, there seem to be way to many assumptioms made while going through the book. When explaining something, they point to an excercise for further detail, in which they ask you to proove what you were going to look up more information on, instead of actually giving the information you were requesting. If you have to buy the book there's no real way around it, but if you're interested in learning about algorithms and have no prior knowledge, I would not recommend this book.
| | | | | |
| |
