 |
GetTextbooks.co.uk
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Data Structures: An Advanced Approach Using C (Prentice-Hall Software Series) by Jeffrey Esakov ISBN-10: 9780131988477 ISBN-10: 0-13-198847-6 ISBN-13: 9780131988477 ISBN-13: 978-0-13-198847-7 Paperback 1989-01-22 Prentice Hall Find Lowest Price |
Editorials | ||
Product Description A modern treatment of data structures using the C programming language. Emphasizes such programming practices as dynamic memory allocation, recursion, data abstraction, and "generic" data structures. Appropriate for sophomore level data structures courses that use C, taking advantage of the flexibility that C provides. (vs. VanWyck, Korsh/Garrett) | ||
Reviews | ||
Don't trust this product It says it's a hardcover but I got a softcover -- a really flimsy softcover. It looks like something someone made in their basement with a photocopier. I am sure the technical merits of this text stand on their own, but the quality of this reproduction are not worth the price. I have contacted amazon and asked them to correct the product page (if necessary) -- certainly I'd be cautious about ordering this product. | ||
small book, but packs a big punch! After finishing this course for our 2nd semester in CS, covering data structures, I was taken back by how much this book has in it. I totally did not expect to see so much inside a book this small when I first glanced at it the day I received it. 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. | ||
Excellent introduction to data structures using K&R C This was the book that made things click for me. It has a nice introduction to pointers and memory management using malloc(), then goes on to show how to implement stacks, queues, singly-linked lists, doubly-linked lists, circular lists, trees, and graphs. The example applications include a tiny line-oriented text editor (like UNIX's ed or DOS's edlin) and a lisp interpreter. 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. | ||