 |
GetTextbooks.co.uk
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Data Structures Using C and C++ (2nd Edition) by Yedidyah Langsam, Moshe J. Augenstein, Aaron M. Tenenbaum ISBN-10: 9780130369970 ISBN-10: 0-13-036997-7 ISBN-13: 9780130369970 ISBN-13: 978-0-13-036997-0 Paperback 1995-12-29 Prentice Hall Find Lowest Price |
Editorials | ||
Product Description This introduction to the fundamentals of data structures explores abstract concepts, considers how those concepts are useful in problem solving, explains how the abstractions can be made concrete by using a programming language, and shows how to use the C language for advanced programming and how to develop the advanced features of C++. Covers the C++ language, featuring a wealth of tested and debugged working programs in C and C++. Explains and analyzes algorithms — showing step- by-step solutions to real problems. Presents algorithms as intermediaries between English language descriptions and C programs. Covers classes in C++, including function members, inheritance and object orientation, an example of implementing abstract data types in C++, as well as polymorphism. | ||
Reviews | ||
A rehash of the same book in Pascal and C This book is simply a rehash of the same book that began with Pascal. The coverage of vital concepts is extremely confusing, which leads the reader to believe that the authors are confused about the concepts themselves. Many of the concepts can be much better understood with Sedgewick's book. Clearly, the authors have very limited large-scale programming experience with the language. | ||
Above average breath Many of the criticisms here are justified, but IMHO there are no good DS&A books. I have Binstock's book and it has lots of errors, although code listings on the website that I tried to compile did finally work, the stuff on the disk didn't. Sedgwick's stuff is about as muddled in C as this book is. Knuth is still wedded to his own private assembly language and a half a dozen others I own are so unremarkable I won't mention them. What I like about this book is they mention algorithms that no one else even seems to know about - like the interpolation search. I don't need a lot of hand holding as I have been programming longer than most reviewers have been out of diapers, and it is annoying when stuff you paid for turns out to be nothing more than misdirection, but all of these books seem to be more in the form of some theory and some p-code disguised in some commercial language's syntax, so until editors and buyers insist on quality, use these books as guidelines. When writing an in-memory database about 10 years ago I had to write an interface to a COBOL system that had the most convoluted method for identifying record types imaginable. The next record read could be one of about 300 possible record types. Running the routine that could discriminate between the 300 odd records was very expensive and required some sort of optimization. Observing that the records tended to present themselves in small groups of identical record types I wrote a type of elevator algorithm where a list of recently seen record types was constantly resorted and used to cue the guesses used to interrogate the next record I'd get(). By the time I tackled this problem I had written dozens of sort and search algorithms and had been programming in C for over 5 years for a Wall St banks. This book was the only book on DS&A that suggested this approach. I could give a half dozen other illustrations to demonstrate the value of breath of coverage too, but suffice it to say you only need one gem per book to make it worthwhile buying. FWIW, I found out the hard way that even K&R has errors, and a book like Harbinger and Steele's is still to be preferred to the bloat tomes coming from Wrox. The real problem for writers of these books is professional programmers, with rare exceptions, no longer use DS&A, they use Java, STL, C# (should be C dullard - C without pointers ain't C people! Read the C standard library and get a clue!), or MS's C++ container classes and have no clue what they are doing. (Don't make me think, I have money to make) That leaves students as almost the sole reader group for these books and you can't get into much depth without losing the reader there. | ||
Very good book but not for beginners If you don't have good knowledge about C then this book will be confuse beacuse this book is about DS and NOT about C programming. Certainly it use some C/C++ to write implementations of DS but not for teach C/C++. If you really know C then you can buy it. In my case it was a very good book and I get very good knowledge about DS. By the way, I bought and read this book in spanish, it was a good translation. | ||
Brand new book as said. Very nice seller. Received book in timely manner and in very good condition. Good seller. Fast. | ||
Waste of money This book is probably the worst DS book with c/c++ in the market. The explanation is very convoluted and follows an ancient coding style which you are unlikely to be familiar with. The c++ code is often jumbled with the algorithm/pseudocode part creating code which is neither easy to implement(if it was totally in c/c++) nor understandable(if it was totally in pseudocode). There are many examples masquerading as executable code which in fact do not compile. Beginners should definitely stay away - which is kind of a moo point since the book is geared for that audience. One of the better books is Introduction to Algorithms by Cormen et al. The algorithms explained here are very easy to implement, far more than most books written for any programming language! If you still have trouble implementing algorithms then i suggest that you brush up on C++/C/Java with the How to Program series which cover elementary Data Sructures | ||