About The Book: Bruno Preiss presents readers with a modern, object-oriented perspective for looking at data structures and algorithms, clearly showing how to use polymorphism and inheritance, and including fragments from working and tested programs. The book uses a single class hierarchy as a framework to present all of the data structures. This framework clearly shows the relationships between data structures and illustrates how polymorphism and inheritance can be used effectively.
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
The design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich, Tomassia and Goldwasser's approach to this classic topic is based on the object-oriented paradigm as the framework of choice for the design of data structures. For each ADT presented in the text, the authors provide an associated Java interface. Concrete data structures realizing the ADTs are provided as Java classes implementing the interfaces. The Java code implementing fundamental data structures in this book is organized in a single Java package, net.datastructures. This package forms a coherent library of data structures and algorithms in Java specifically designed for educational purposes in a way that is complimentary with the Java Collections Framework.
In this book, Bruno Preiss presents the fundamentals of data structures and algorithms from a modern, object-oriented perspective. He 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.
The design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich, Tomassia and Goldwasser's approach to this classic topic is based on the object-oriented paradigm as the framework of choice for the design of data structures. For each ADT presented in the text, the authors provide an associated Java interface. Concrete data structures realizing the ADTs are provided as Java classes implementing the interfaces. The Java code implementing fundamental data structures in this book is organized in a single Java package, net.datastructures. This package forms a coherent library of data structures and algorithms in Java specifically designed for educational purposes in a way that is complimentary with the Java Collections Framework.
This book offers a thorough introduction to the concepts and practices of object-oriented programming in Java. It also introduces the most common data structures and related algorithms and their implementations in the Java collections framework. Chapters 1 14 follow the syllabus of the AP Computer Science in Java course. They will prepare you well for the AP CS exam. Chapters 15-18 on file input and output, graphics, graphical user interfaces, and events handling in Java will give you a better sense of real-world Java programming; this material also makes case studies, labs, and exercises more fun. Chapters 19-26 deal with more advanced data structures and algorithms. Chapter 27, Design Patterns, introduces more intricate aspects of object-oriented design and serves as an introduction to design patterns. The last chapter, Computing in Context, discusses creative, responsible, and ethical computer use.
If you’re a student studying computer science or a software developer preparing for technical interviews, this practical book will help you learn and review some of the most important ideas in software engineering—data structures and algorithms—in a way that’s clearer, more concise, and more engaging than other materials. By emphasizing practical knowledge and skills over theory, author Allen Downey shows you how to use data structures to implement efficient algorithms, and then analyze and measure their performance. You’ll explore the important classes in the Java collections framework (JCF), how they’re implemented, and how they’re expected to perform. Each chapter presents hands-on exercises supported by test code online. Use data structures such as lists and maps, and understand how they work Build an application that reads Wikipedia pages, parses the contents, and navigates the resulting data tree Analyze code to predict how fast it will run and how much memory it will require Write classes that implement the Map interface, using a hash table and binary search tree Build a simple web search engine with a crawler, an indexer that stores web page contents, and a retriever that returns user query results Other books by Allen Downey include Think Java, Think Python, Think Stats, and Think Bayes.
Special Features: · Discussion of object-oriented design and the Java programming language, including the Collections Framework and Design Patterns· Coverage of Internet-related topics, including hashing and text processing· Hundreds of exercises categorized by Reinforcement, Creativity, and Projects get students thinking like programmers and applying what they've learned· Offers a unique multimedia format for learning the fundamentals of Data Structures & Algorithms· Outstanding writing style presents even the most difficult mathematical concepts clearly· Animations and powerful art program illustrate data structures and algorithms in a clear visual manner About The Book: · Entirely new chapter on recursion· Additional exercises on the analysis of simple algorithms· New case study on parenthesis matching and HTML validation· Expanded coverage of splay trees· Added examples and programming exercises throughout
