Data Structures and Algorithms with Object-Oriented Design Patterns in Java / Edition 1 available in Paperback
- Pub. Date:
Create sound software designs with data structures that use modernobject-oriented design patterns! Author Bruno Preiss presents thefundamentals of data structures and algorithms from a modern,object-oriented perspective. The text promotes object-orienteddesign using Java and illustrates the use of the latestobject-oriented design patterns. Virtually all the data structuresare discussed in the context of a single class hierarchy. Thisframework clearly shows the relationships between data structuresand illustrates how polymorphism and inheritance can be usedeffectively. Key Features of the Text* All data structures are presented using a common framework. Thisshows the relationship between the data structures and how they areimplemented.* Object-oriented design patterns are used to demonstrate how agood design fits together and transcends the problem at hand.* A single Java software design is used throughout the text toprovide a better understanding of the operation of complicated datastructures.* Just-in-time presentation of mathematical analysis techniquesintroduces students to mathematical concepts as needed.Visit the Text's Web Site A comprehensive web site is available forusers of the text at www.wiley.com/college/preiss. The siteincludes:* The Web Book (a hypertext version of the complete book)* Links to the Java Source Code (all the program examples from thetext)* Opus5 Package (a Java package comprised of all the source codefrom the text)* Documentation (source code documentation)* Demo Applets (various Java applets that illustrate datastructures and algorithms from the text)* Archive (JAR format archive of the source code from thetext)* Front Matter (table of contents and preface)* Solutions Manual (password required)* Errata
|Product dimensions:||7.68(w) x 9.47(h) x 1.21(d)|
About the Author
Bruno R. Preiss is an Associate Professor in the Department of Electrical and Computer Engineering at the University of Waterloo, Canada. He is a member of the Parallel and Distributed Systems Group, the Computer Communications Networks Group, and the VLSI Research Group. After earning a B.A.Sc. degree in Engineering Science, Professor Preiss received an M.A.Sc. and Ph.D. in Electrical Engineering from the University of Toronto, Canada.
Table of Contents
Algorithm Analysis.Asymptotic Notation.Foundational Data Structures.Data Types and Abstraction.Stacks, Queues, and Deques.Ordered Lists and Sorted Lists.Hashing, Hash Tables, and Scatter Tables.Trees.Search Trees.Heaps and Priority Queues.Sets, Multisets, and Partitions.Garbage Collection.Algorithmic Patterns and Problem Solvers.Sorting Algorithms and Sorters.Graphs and Graph Algorithms.Appendices.Bibliography.Index.