I was asked to refer three books
- Forauzan and Gilberg
- Schaum’s Series
- DS by Yeshwant Kanitkar
Book analysis for the topics- quick sort, linked list and exercises
QUICK SORT-
For the topic quick sort, after referring three books - best
explanation in schaum’s series.
Schaum’s series, has a good example explaining the process of sorting. It also has clearly mentioned the directions to scan the elements of an array to be sorted .it also explain about the positions of interchanged elements. Even the algorithm explained is understandable, if once gone through.
In the other reference, forouzan the topic is explained good as well. it will be useful to refer it if one wishes to look on more details on quick sort method. This book explains about the method of finding the median of three, median left.
A figure 11-16 –quick sort operation explains gives a idea of dividing the array and then comparing the elements with pivot element and then again dividing into sub lists.
While in yeshwant kanitakar, the explanation of quick sort is merely explained in words but no supportive example.
LINKED LIST-
In forouzan, the linked list is given in a good manner . it has first, a short description of all algorithms and then explaining them in details. Algorithms to create list, insert node, delete node, empty list etc. are given .it proves to be a useful reference.
In kanitakar,linked list is given in such a way that it explains about the various operations on linked list by giving programs for each operation while the algorithms are explianed only through figures.
Linked list in schaum’s series is also given good. It has algorithms on various operations. No programs are given for it but .
EXERCISE –
looking for the exercise on linked list ,it can be said that forouzan holds different type of questions based on different situation in linked list. And the programming questions are also given. And similarly in schaum’s series the exersices are equally good . it covers figure based questions, programs for different operations on linked list .
so , the conclusion is , the choice is yours..but I recommend forouzan to refer the data structures for this semester . I feel this book will be useful in every aspect .
Just now was flipping through-Forauzan and Gilberg, this is a good book for beginner's in coding because this book has a different approach than the others ! Pseudo Code approach, the book has only pseudo codes instead of C codes.....!
ReplyDeleteHappy Structures !
A Robert Christopher
Hello people,
ReplyDeleteI have purchased the Data Structures – Schaum’s Series and here is a small review about it. . .
For students looking for a quick nuts-and-bolts overview, it would have to be Schaum's Easy Outline series. . . With an emphasis on clarity, each new title features a streamlined and updated essence of the subject, presented in a concise and readily understandable form. . .
This book treats Data Structure algorithms in a form that is machine and language independent. . .It adopts an elementary approach to the subject matter with many examples and diagrams and is designed as a textbook or supplement for effective self-study. . . Special features include the presentation of algorithms in pseudo-code, and a detailed discussion on AVL Search Trees, m-way Search Trees and B Trees. . .
The content related to the Complexity of algorithms, Linked Lists, queues, Sorting techniques are neatly explained with examples where and when necessary. . .The Pseudo-codes are neatly presented as and when required. . .
Enjoy Data Structures !!
Shashanka