5 of 5 people found the following review helpful:
3.0 out of 5 stars
Buy this one only if you must..., January 4, 2009
This review is from: Data Structures Using C++ (Programming) (Paperback)
I am pursuing a computer science degree through Baker College Online. For all of our "Hardcore" programming courses such as C++, Data Structures and Algorithms, and Java (although I wouldn't really count Java as "Hardcore"), we are using D.S. Malik's books. I must say that after using three of his textbooks, I find them all to be less than adequate at best.
This book is not a total loss. Sometimes the examples provided are a decent overview that clears up topics such as Linked Lists, Stacks, and Queues for newcomers. In fact if I were rating only the first half of the book (aside from the first two chapters, which are actually just rehashes from one of Malik's other books), I would probably give it four stars rather than three. It is in the second half of the book, when covering Binary Trees, AVL Height Balancing, Graphs, and STL Algorithms that Malik's coverage of Data Structures and Algorithms begins to slip into the realm of incoherence. Here, Malik spends too much time with diagrams and not enough with code. Also, when he does include source code, many times the amount of comments he includes are insufficient to really ascertain what he is trying to accomplish without spending extraneous time studying his code. Also, Malik tends to gloss over certain topics such as Kruskal's minimum spanning tree algorithm. Iterators are barely covered - Malik talks about how to use an Iterator, but never covers how one might construct one for their own data structures. The final chapter, which covers some of the STL Algorithms and the Set and Map data structures, is more of a joke than a real coverage of these items. Again, Malik covers how to use a Set or Map without really diving into their inner workings or how one might construct a similar data structure for their own use. I was also disappointed with Malik's coverage of Vectors. As with Sets and Maps, Malik covered how one might use a vector from the STL, but never how to construct one. To me that would seem like one of the most basic topics that any Data Structures and Algorithms text should cover. Finally, this book does not even cover or mention algorithms such as a Union Find or Union Join (which makes sense since he does not cover Kruskal's minimum spanning tree algorithm, which makes use of Union Find and Union Join, typically).
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No
2 of 2 people found the following review helpful:
3.0 out of 5 stars
Good but not great, February 16, 2007
This review is from: Data Structures Using C++ (Programming) (Paperback)
I used this book for my Data Structures course and while it is good it does not have a "meat on the bone". What I mean is that while it does introduce you to a concept, it does not have a lot of examples and expects you to have a good back ground in computer science already. I had to use other books to go furhter into explaining things, or the internet which has a vast array of information to help out where this book falls short. Probably will not even use it as a reference book as sometimes it shows you and sometimes it doesn't.
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No
1 of 1 people found the following review helpful:
5.0 out of 5 stars
Good intermediate C++ book, July 12, 2009
This review is from: Data Structures Using C++ (Programming) (Paperback)
This book is good for teaching big O notation and also using the notation with a standard C++ compiler. Working with data and memory and much of the real C++ standard areas.
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No