- Hardcover: 372 pages
- Publisher: Prentice Hall (1989)
- Language: English
- ASIN: B00101Y58Q
- Package Dimensions: 9.4 x 7 x 1 inches
- Shipping Weight: 1.8 pounds
- Average Customer Review: 7 customer reviews
- Amazon Best Sellers Rank: #4,016,009 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
DATA STRUCTURES - AN ADVANCED APPROACH USING C (Prentice Hall Software Series) Hardcover – 1989
Top 20 lists in Books
View the top 20 best sellers of all time, the most reviewed books of all time and some of our editors' favorite picks. Learn more
Customers who bought this item also bought
What other items do customers buy after viewing this item?
Classic work about using c and data structures with many example applications, including a small Lisp interpretor, and a simple line editor.
Browse award-winning titles. See more
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
Book itself is old fashioned but informative. If you are looking for a comprehensive guide on data structures-this may not be for you. Its more of a guidebook/refresher than intro/learning guide.
All the tips this book has is implemented in the examples and it shows how easy and advantageous it is to use polymorphic data types, macros, function organization, etc.
Their concept of Lists are phenomenal and this topic is only expanded on greatly as the chapters go on. Their technique of reusing old code while keeping implementation independence and only slightly changing it for future implementations is the backbone of the book.
Programs developed range from complex, rational and polynomial code, graphical display list, graphical region filling, standard and complex parenthesis checker using stacks, infix to postix algorithm, operating system simluator, applying header nodes, circular list concepts developing a Lisp subset interpreter, line editor, expression evaluator, trees of all sorts and their counterpart graphs and their applications to a four-in-a-row game, Dijkstra's algorithm, and from sets to sorting, and many many more, there's even more they suggest for you to write in their exercises.
Do not buy this book unless you're serious about taking on it's seriously 'advanced' approach, or unless it's required by your course. It assumes a level of maturity as the book goes on by leaving out components to their programs for your interpretation and development on your own. Exercises are just that, exercises - there are no answers given. You are to interpret what they have and run with it.
I also minus a point due to K&R C. It was the only nuisance in the book. Otherwise, enjoyable read and the learning process from this book has been a worthwhile experience.
The only downside to the book is that it uses old K&R C, so the syntax for function declarations is not compatible with strict ANSI C compilers.