Data Structures and Algorithms | Date: 08 May 2011, 00:27
|
Review
The best introduction to the field - a pleasure to read, Feb 10 2002
By "optimistix" (London, UK):
A textbook by Aho/Hopcroft/Ullman is sort of a guarantee of quality - and this one is no exception. These people are among the greatest researchers and teachers in Computer Science, and this book is a great opportunity to 'learn from the masters'.
As an introduction to the fascinating field of Data Structures and Algorithms, this is perhaps the best textbook you'll find out there. Starting with the basics, the authors develop the concepts in a natural manner. Array, lists and stacks soon give way to binary trees, heaps and then more advanced data structures. All data structures are introduced with proper motivation in terms of the kind of problems that they are useful in solving.
The basic algorithms in searching, sorting, and graphs are then presented in detail, followed by a chapter on algorithm analysis techniques, and one on design paradigms such as dynamic programming, backtracking, divide and conquer, greedy approach, and local search. The book ends with chapters data structures and algorithms for external storage and memory management.
This is a textbook, and therefore you can expect a fair amount of maths in the analysis of algorithms, without which you can only do hand-waving. All algorithms are explained, with detailed examples and illustrations - this is one of the easiest books to follow in theoretical computer science.
All algorithms are presented in pseudocode, which makes it easier to understand things at an abtract level without getting bogged down in language specific technical details, and the pseudocode is very clear and concise, making it an easy task to adapt it to any given language.
An additional plus-point is its size - weighing in at less than 450 pages, this is a 'backpack friendly' book which you can easily carry around, unlike many others on the subject.
The only caveat is that the book is almost 20 years old, so you won't find the more recent topics like red-black trees, skip lists etc.
I'd suggest using this book for an introduction to the basics, with the book by Cormen et al (if you want the maths) or Sedgewick (if you don't want the maths) as excellent supplements as well as advanced references.
I must confess to having a weak spot for this book, since it introduced me to algorithms and i fell in love with the subject. However, i think most people who've read it would agree that it is a classic among Computer Science textbooks which has stood the test of time.
Review:
An okay book!
It is just an okay book, not extraordinary in any way. Especially, this is certainly not for the novice in this topic, i.e., it is certainly not a good introductory book. So if you are new to data structures and algorithms, stay away from this book, go for some good introductory book.
For the advanced readers, it is an okay book. Better books are available, e.g., books by Cormen et al. and Robert Sedgewick.
The book is written in a way not very intersting or engaging. The algorithms are not explained in detail. Often things are left unexplained or assumed that the reader already knows it. Algorithms are presented in pseudocode, which causes problems especially for the readers familiar to some particular programming language.
Review:
Excellent Book
This book explains very clearly the subjects of data structures and algorithms. Its in-depth coverage is very intuitive and easy to follow unlike other literature that is often tedious or esoteric.
The only complaint I have is the choice of the programming language. Pascal is a language of the past. A new edition using C will make this book simply a gem.
Review:
A JEWEL
Perfect book. Nice and small. You can buy it cheap too, it's old. But it's full of the meat and potatoes, no fluffy Java source code. Sure, it uses Pascal, but it's not that hard to understand Pascal code even if you never programmed in Pascal (me n
PassWord: www.freebookspot.com
|
DISCLAIMER:
This site does not store Data Structures and Algorithms on its server. We only index and link to Data Structures and Algorithms provided by other sites. Please contact the content providers to delete Data Structures and Algorithms if any and email us, we'll remove relevant links or contents immediately.
|
 |
|
Comments (0)
All
