Data Structures Using C++ Review

Average Reviews:

(More customer reviews)Are you looking to buy Data Structures Using C++? Here is the right place to find the great deals. we can offer discounts of up to 90% on Data Structures Using C++. Check out the link below:

>> Click Here to See Compare Prices and Get the Best Offers

Data Structures Using C++ ReviewI 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).Data Structures Using C++ OverviewNow in its second edition, D.S. Malik brings his proven approach to C++ programming to the CS2 course. Clearly written with the student in mind, this text focuses on Data Structures and includes advanced topics in C++ such as Linked Lists and the Standard Template Library (STL). The text features abundant visual diagrams, examples, and extended Programming Examples, all of which serve to illuminate difficult concepts. Complete programming code and clear display of syntax, explanation, and example are used throughout the text, and each chapter concludes with a robust exercise set.

Want to learn more information about Data Structures Using C++?

>> Click Here to See All Customer Reviews & Ratings Now