Data Structures and Algorithms in Java, 5th Edition
by Michael T. Goodrich (University of California at Irvine); Roberto Tamassia (Brown Univ.)Edition: 5th
Format: Hardcover
Pub. Date: 2010-02-01
Publisher(s): Wiley
Other versions by this Author
-
This Item Qualifies for Free Shipping!*
*Excludes marketplace orders.
List Price: $184.91
Rent Textbook
Select for Price
New Textbook
We're Sorry
Sold Out
Used Textbook
We're Sorry
Sold Out
eTextbook
We're Sorry
Not Available
How Marketplace Works:
- This item is offered by an independent seller and not shipped from our warehouse
- Item details like edition and cover design may differ from our description; see seller's comments before ordering.
- Sellers much confirm and ship within two business days; otherwise, the order will be cancelled and refunded.
- Marketplace purchases cannot be returned to eCampus.com. Contact the seller directly for inquiries; if no response within two days, contact customer service.
- Additional shipping costs apply to Marketplace purchases. Review shipping costs at checkout.
Summary
This newest edition examines fundamental data structures by following a consistent object-oriented framework that builds intuition and analysis skills of data structures and algorithms Presents new figures, simpler language, and more practical motivations from real-world scenarios Numerous illustrations, Web-based animations, and simplified mathematical analyses help readers quickly learn important concepts
Author Biography
Professors Goodrich and Tamassia are well-recognized researchers in data structures and algorithms. Michael Goodrich received his Ph.D. in Computer Science from Purdue University. He is currently a professor in the Department of Computer Science at the University of California, Irvine. Roberto Tamassia received his Ph.D. in Electrical and Computer Engineering from the University of Illinois at Urbana-Champaign. He is currently a professor in the Department Science at Brown University. Both professors are winners of numerous teaching awards for their teaching of data structures and algorithms.
Table of Contents
| Java Primer | |
| Getting Started: Classes, Types, and Objects | |
| Methods | |
| Expressions | |
| Control Flow | |
| Arrays | |
| Simple Input and Output | |
| An Example Program | |
| Nested Classes and Packages | |
| Writing a Java Program | |
| Exercises | |
| Object-Oriented Design | |
| Goals, Principles, and Patterns | |
| Inheritance and Polymorphism | |
| Exceptions | |
| Interfaces and Abstract Classes | |
| Casting and Generics | |
| Exercises | |
| Indices, Nodes, and Recursion | |
| Using Arrays | |
| Singly Linked Lists | |
| Doubly Linked Lists | |
| Circularly Linked Lists and Linked-List Sorting | |
| Recursion | |
| Exercises | |
| Analysis Tools | |
| The Seven Functions Used in This Book | |
| Analysis of Algorithms | |
| Simple Justification Techniques | |
| Exercises | |
| Stacks, Queues, and Deques | |
| Stacks | |
| Queues | |
| Double-Ended Queues | |
| Exercises | |
| List and Iterator ADTs | |
| Array Lists | |
| Node Lists | |
| Iterators | |
| List ADTs and the Collections Framework | |
| Case Study: The Move-to-Front Heuristic | |
| Exercises | |
| Trees | |
| General Trees | |
| Tree Traversal Algorithms | |
| Binary Trees | |
| Exercises | |
| Heaps and Priority Queues | |
| The Priority Queue Abstract Data Type | |
| Implementing a Priority Queue with a List | |
| Heaps | |
| Adaptable Priority Queues | |
| Exercises | |
| Hash Tables, Maps, and Skip Lists | |
| Maps | |
| Hash Tables | |
| Ordered Maps | |
| Skip Lists | |
| Dictionaries | |
| Exercises | |
| Search Trees | |
| Binary Search Trees | |
| AVL Trees | |
| Splay Trees | |
| (2,4) Trees | |
| Red-Black Trees | |
| Exercises | |
| Sorting, Sets, and Selection | |
| Merge-Sort | |
| Quick-Sort | |
| Studying Sorting through an Algorithmic Lens | |
| Sets and Union/Find Structures | |
| Selection | |
| Exercises | |
| Strings and Dynamic Programming | |
| String Operations | |
| Dynamic Programming | |
| Pattern Matching Algorithms | |
| Text Compression and the Greedy Method | |
| Tries | |
| Exercises | |
| Graph Algorithms | |
| Graphs | |
| Data Structures for Graphs | |
| Graph Traversals | |
| Directed Graphs | |
| Shortest Paths | |
| Minimum Spanning Trees | |
| Exercises | |
| Memory Management and B-Trees | |
| Memory Management | |
| External Memory and Caching | |
| External Searching and B-Trees | |
| External-Memory Sorting | |
| Exercises | |
| A Useful Mathematical Facts | |
| Bibliography | |
| Index | |
| Table of Contents provided by Publisher. All Rights Reserved. |
An electronic version of this book is available through VitalSource.
This book is viewable on PC, Mac, iPhone, iPad, iPod Touch, and most smartphones.
By purchasing, you will be able to view this book online, as well as download it, for the chosen number of days.
Digital License
You are licensing a digital product for a set duration. Durations are set forth in the product description, with "Lifetime" typically meaning five (5) years of online access and permanent download to a supported device. All licenses are non-transferable.
More details can be found here.
A downloadable version of this book is available through the eCampus Reader or compatible Adobe readers.
Applications are available on iOS, Android, PC, Mac, and Windows Mobile platforms.
Please view the compatibility matrix prior to purchase.