Data Structures and Program Design In C (2nd Edition) | 
 enlarge | Authors: Robert L. Kruse, Bruce P. Leung, Clovis L. Tondo
Publisher: Prentice Hall
Category: Book
List Price: $115.40
Buy Used: $1.38
You Save: $114.02 (99%)
New (10) Used (25) from $1.38
Avg. Customer Rating:  34 reviews
Sales Rank: 734490
Media: Paperback
Edition: 2
Number Of Items: 1
Pages: 671
Shipping Weight (lbs): 2.6
Dimensions (in): 9.1 x 7.4 x 1.6
ISBN: 013288366X
Dewey Decimal Number: 005.133
EAN: 9780132883665
ASIN: 013288366X
Publication Date: July 27, 1996
Availability: Usually ships in 1-2 business days
Shipping: Expedited shipping available
Shipping: International shipping available
Condition: Book Bent Or Slightly Warped;Slight Water Damage Our feedback rating says it all: Five star service and fast delivery! We've shipped four million items to happy customers, and have one MILLION unique items ready to ship today!
|
| Also Available In:
|
| Similar Items:
|
| Editorial Reviews:
Amazon.com Review
In a surprisingly lively textbook-style treatment, Data Structures and Program Design in C++ delivers expertise and plenty of sample programs for the working C++ programmer or computer science student. While some books on data structures stress theory and mathematical concepts over real-world sample code, this guide illustrates its tour of data structures--such as stacks, lists, queues, trees, and graphs--with clear, engaging samples. Throughout, the authors make use of built-in C++ features (such as the Standard Template Library [STL] and templates) where appropriate. Early chapters use such interesting examples as Conway's Game of Life, chess and game programming, a simple calculator, and an airport simulation. Along the way, the reader will learn about lists, stacks, and queues. In later chapters, covering thornier topics such as sorting algorithms, trees, and graphs, the authors do not skimp on the mathematical underpinnings for measuring efficiency. Instead, they take extreme care to introduce everything required to understand such conventions as the "Big O" notation and principles of logarithms. The book closes with a case study that combines several data structures and strategies. (The example, a Polish notation expression parser, is a difficult and common real-world sample.) -- Richard Dragan
Product Description
Progressing from the concrete to the abstract — and using numerous, substantial case studies and sample programs — this book explores structured problem solving, data abstraction, software engineering principles, and the comparative analysis of algorithms as fundamental tools of program design. Emphasizes principles of top-down refinement, program design, review, and testing. Uses the C programming language throughout. Offers Internet access to the source code for all the programs and program extracts printed in the book.
|
| Customer Reviews: Read 29 more reviews...
 Horrible May 27, 2008
Some parts of this book could have been written the same way by a monkey. It is typical of computer science profs to know their material, but be completely inept at communicating it. Kruse/Ryba are no exception. The sections on binary search tress and AVL trees are written in nearly impenetrable prose, for example. The attempt at describing some of the rebalancing operations is laughable. 10 minutes on the wikipedia entries for trees can save you a few wasted hours with this text. When it comes to introducing some of the mathematical analysis of some of the algorithms, they assume the audience knows many kinds of proofs and theorems and don't bother to give reminders along the way in deriving their formulas. Thus, the mathematical proofs for algorithm analysis appear to take great jumps if you're not familiar with the math behind the proofs. I would love to see how a skilled teacher actually communicates these ideas because I'm sure it would be far less dense than this book. Way to go Kruse/Ryba, in making yet another inaccessible computer science book that turns the audience off to the subject.
 Great book. October 14, 2006
I believe this book is a great introduction to algorithms and data structures. It's so clear and well-written that you can actually sit down and read it just for fun.
If you are looking for a book from which you can copy the code line-by-line and paste it in your compiler, then it's NOT the book for you.
 Decent Book on Data Structures August 21, 2005
4 out of 4 found this review helpful
I just finished an online course on data structures at UMass, Lowell (secured an A grade without any problem) and this is the textbook used for this course. I agree with some of the comments made by the reviewers here - that typedef's are used beyond reason, code is presented in fragments. I must strongly disagree with the reviewers who said - the book is not worth the money (it's cheap if you buy a used one), it is a bad book, useful only as a paper weight. The strong plus point for this book is that it presents theory well - there are many figures using which it is easy to understand complicated stuff. The other plus point is that it also analyzes the performance of algorithms and I felt the book does a great job of explaining this part in clear terms. The main drawback is that the code is fragmented and spread out, which is certainly frustating. Also, in order to get the code to work on a compiler (I used Microsoft VC++ version 6), you will need to "fill in the gaps" as most code examples (I tried 90% of the examples in the text on MVC++ compiler) are by no means complete but this was not difficult. You can download the code from the publisher's website and the code is actually not organized into different files (sorted by chapter and example) but it comes in a few files where examples from different chapters are mixed. You will have to search and find the part you need. I do agree usage of dummy functions creates confusion. This book has a rocky start with the life game example, which was not very easy to follow with the explanation provided. While I was frustated with the first two chapters, the rest of the chapters are presented well. To the reviewer who said that the code has bugs (which certainly isn't true), my guess that the gaps are not properly filled. I patiently tested most of the code on the computer (after filling in the gaps of course!) and find absolutely no problems with it. This however took lot of time since significant effort is needed from the student to fill the missing code to make it work. I have supplied working code to my fellow students who were facing difficulties in getting the code to run. In a couple of places in the text, the author surprised me with C syntax I did not know was legal (I consider myself intermediate programmer).
I suspect the reason why many readers have problems with this book is two-fold: 1.The code is not available in a format that can be tested on the compiler. Having read a lot of CS books which supply with readily usable code, this book gets annoying. I was wondering why the authors did not give downloadable working code for all examples in the text (which is a definite minus point) 2. The reader will have to go back and forth between the chapters as some functions developed in former chapters are used in later chapters. This does get irritating. I have read books that do this to a ridiculous level but this book stays with in tolerable bounds.
I will not rate this book as the best one on the subject out there but it is definitely good enough to learn data structures. I have used another book as a supplement: Data Structures & Algorithms in Java (Mitchell Waite Signature Series) (Hardcover) By Mitchell Waite, Robert Lafore ISBN: 1571690956. This book has lot of applets that show step by step how algorithms work. I am a visual learner and this helped tremendously. However, I felt that Waite Series book did not present the theory as thoroughly as Robert Kruse's text.
In summary, I consider this book as "decent". I was very much concerned when I first purchased this text because of so many bad reviews. As it turns out, those that can understand C and are willing to sit in front of the computer to make the code samples in this book work need not have any fear. As I said earlier, the theory is presented well, and all it needs is patience and diligence from the student to go through the code examples on a compiler. I believe that I now have a good understanding of the subject and I can move on books that deal with it at more depth. There are a plethora books on this topic out there and there may be better books than the ones mentioned in this review.
Excellent book. April 18, 2005
This is a great book! I don't know why other reviewers are so aggravated with it, but I find it to be one of the clearest and ideally arranged books on data structures that are out there. It is also useful to mention that the great illustrations relaxed my eyes and worked a great deal on strengthening the point, making sure I understood the concept behind the algorithm.
Programming Book from Hell May 8, 2004
0 out of 2 found this review helpful
This book is horrible. It's badly written code wise and also in a literary sense. The author takes good examples and ruins them. Also he makes up his own terms to replace supposedly bad ones. The code is poorly written and contradicts the authors supposed "style." He make use of breaks when ever possible, and then tells you that the use of breaks is not good practice. He also typedef's beyond reason. I would strongly recommending NOT buying this book. I unfortunately had an equally idioic teacher who requried this book.. be warned steer clear.
|
|
|
