 |
GetTextbooks.com
Compare Prices & Save up to 90% |
|
|
|
| Login | Sign up | My Wish List |
 | | Data Structures and Algorithms with Object-Oriented Design Patterns in Java (Worldwide Series in Computer Science) by Bruno R. Preiss ISBN-10: 9780471346135 ISBN-10: 0-471-34613-6 ISBN-13: 9780471346135 ISBN-13: 978-0-471-34613-5 Hardcover 1999-08-02 Wiley Find Lowest Price |
Editorials | ||
Product Description Create sound software designs with data structures that use modern object-oriented design patterns! Author Bruno Preiss presents the fundamentals of data structures and algorithms from a modern, object-oriented perspective. The text promotes object-oriented design using Java and illustrates the use of the latest object-oriented design patterns. Virtually all the data structures are discussed in the context of a single class hierarchy. This framework clearly shows the relationships between data structures and illustrates how polymorphism and inheritance can be used effectively. Key Features of the Text * All data structures are presented using a common framework. This shows the relationship between the data structures and how they are implemented. * Object-oriented design patterns are used to demonstrate how a good design fits together and transcends the problem at hand. * A single Java software design is used throughout the text to provide a better understanding of the operation of complicated data structures. * Just-in-time presentation of mathematical analysis techniques introduces students to mathematical concepts as needed. Visit the Text's Web Site A comprehensive web site is available for users of the text at www.wiley.com/college/preiss. The site includes: * The Web Book (a hypertext version of the complete book) * Links to the Java Source Code (all the program examples from the text) * Opus5 Package (a Java package comprised of all the source code from the text) * Documentation (source code documentation) * Demo Applets (various Java applets that illustrate data structures and algorithms from the text) * Archive (JAR format archive of the source code from the text) * Front Matter (table of contents and preface) * Solutions Manual (password required) * Errata | ||
Reviews | ||
Terribly written I have taken several math and computer programming courses. This it the worst book I have ever been forced used. I had a hard time recalling some of the math that is used immediately, the explanations are terrible to say the least. I tried for hours to figure it out using just that book. When I got home I found a different reference and had it figure out in one minutes. So basically the problems I am assigned I have to learn from another source to do... that shouldn't be. Find another author that cares if he makes sense or not, one that doesn't assume you will understand it regardless of how it is explained.... "such is higher education these days" I wish I could slap that guy. | ||
Average and TOO much mathematics The initial sections of the book focus on too much mathematical formula without providing plain English examples especially in the asymptotic analysis sections. Isn't there a book out there which explains in plain simple English? It also uses misleading terms like "external nodes" and "internal nodes" when it comes to trees. I wouldn't recommend this book. (I'm only using it because it is the university text, now I wish I had my money back) | ||
Not so much in quality I know this book is used as a textbook in some computer engineering courses at my school. However, I do not belong to engineering, but I am a computer science undergraduate. :-) I've tried to help my friends who were having a lot of trouble implementing a binary tree. So to follow what they learned, I've looked at the book. Hmm. I sat there, and said "I'm lucky that my profs don't teach me algorithms like this." Some implementations did not make quite intuitive sense to me. Although I understood what the book was trying to illustrate, but I didn't see why such implementation would be intuitive and useful. | ||
I used this book at school Hi, as an undergrad engineering student, I had this book for the coursebook in my algorithms course. Honestly speaking, it's good , very readable text. I never used any of the code examples fom the book in my assignments, yet they proved rather helpfull in understanding the material. Something, that I think is missing from this book is the answeres to the problems at the end of the chapter that are not programming projects. Ading them to the book could help students a lot ( no need to relay on TA's ) | ||
decent for soft eng, bad for data structures As a second year student, the use of design patterns (see chapter 5) bothers me. It really detracts from what the author is trying to convey. It's extremely hard to ignore them because you have to backtrack to previous chapters frequently which creates more confusion. This book may be useful to learn the basics of software engineering. But given complexity of the design patterns in this book, it could be glossed over in one lecture. ... | ||