 |
GetTextbooks.co.uk
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Data Structures, Algorithms, and Applications in Java by Sahni ISBN-10: 9780072401271 ISBN-10: 0-07-240127-3 ISBN-13: 9780072401271 ISBN-13: 978-0-07-240127-1 Hardcover 1999-11-01 McGraw-Hill Education Find Lowest Price |
Reviews | ||
Barely Used it I'm currently taking a Data Structures course at UF, and I dislike this text. The descriptions are confusing; I found myself re-reading portions a few times to absorb the concept. His code examples are minimalist (often opting to omit brackets from blocks,etc), but in an instructional text this can often make the code difficult to decipher at best. | ||
Stay away from this I've been placed into the unfortunate circumstance of being forced to read this book for my class and I warn anyone who is considering buying this book voluntarily to consider something else. Although I applaud Sahni's decision to use Java throughout the book, his coding style is sub par and suggests a weak grasp of Java programming conventions. The code for the book that is available from his website further confirms this as it is incredibly unorganized, with source and class files littering package directories in a non-standard way that causes the user to jump through hoops just to get his code to compile. Additionally, the author does a poor job of explaining the math in the book, and the math itself at many times seems questionable in validity. I was particularly shocked when I saw him use two completely different "average count" formulas for essentially the same exact algorithm (see examples 2.13 and 2.14). All in all the book is poorly organized, poorly explained, and definitely not worth your time or money. | ||
Time, and tree pulp waste! Hi, First, I'm a senior CS student and I have not seen a book this bad ever since romance novels were invented. Now, here is why: * The code is confusing and obfuscated at best. * The author is often vague about which of the plethora of examples he is talking about. * The later chapters (the most important) are pretty damn close to being unintelligible. The author is all over the place and the examples are inadequate. As someone mentioned, he tends to give final answers or outputs rather than walking the student through the problem. Overall, don't buy this book unless you MUST. Ask your teacher for reconsideration, if possible. Just an awful book. There's an adage that often good scientists make bad teachers, this is one good example of that. | ||
A beautiful book!! I have worked with Dr.Sahni and taken two classes with him at University of Florida (undergraduate and graduate DataStructures). Needless to say the guy is a LIVING LEGEND in the field of datastructures and algorithms. Like I said I have used this same book for "Intro to datastructures" and I do admit that it requires a little effort to get the hang of it, but once you get hooked on to it you will see how simple and elegant the guy's code and language is (english I mean). I haven't seen a single line of ambiguity in this whole book. He writes exactly what he means in the most terse and simple language. That is why it might be a little dry to some people. Read every chapter twice if you have to, but do not leave this book to gather dust. That will do you a lot of harm. I can bet once you are done reading this book you will be writing much efficient and clean code. This is the kind of book that makes a software engineer out of a programmer. | ||
SUFFIX TREES I saw an presentation of suffix trees online by Dr Sahni. Does anyone know if any of his books contain similar material, that is, in depth material on suffix trees? Thanks. | ||