More New and Used
from Private Sellers
Data Structures and Algorithms in Java, 5th Editionby Michael T. Goodrich (University of California at Irvine); Roberto Tamassia (Brown Univ.)
Only two copies
in stock at this price.
In Stock Usually Ships in 24 Hours.
Currently Available, Usually Ships in 24-48 Hours
Starting at $42.79
Questions About This Book?
Why should I rent this book?
Renting is easy, fast, and cheap! Renting from eCampus.com can save you hundreds of dollars compared to the cost of new or used books each semester. At the end of the semester, simply ship the book back to us with a free UPS shipping label! No need to worry about selling it back.
How do rental returns work?
Returning books is as easy as possible. As your rental due date approaches, we will email you several courtesy reminders. When you are ready to return, you can print a free UPS shipping label from our website at any time. Then, just return the book to your UPS driver or any staffed UPS location. You can even use the same box we shipped it in!
What version or edition is this?
This is the 5th edition with a publication date of 2/1/2010.
What is included with this book?
- The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any CDs, lab manuals, study guides, etc.
- The Used copy of this book is not guaranteed to include any supplemental materials. Typically, only the book itself is included.
- The Rental copy of this book is not guaranteed to include any supplemental materials. You may receive a brand new copy, but typically, only the book itself.
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
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
|Getting Started: Classes, Types, and Objects|
|Simple Input and Output|
|An Example Program|
|Nested Classes and Packages|
|Writing a Java Program|
|Goals, Principles, and Patterns|
|Inheritance and Polymorphism|
|Interfaces and Abstract Classes|
|Casting and Generics|
|Indices, Nodes, and Recursion|
|Singly Linked Lists|
|Doubly Linked Lists|
|Circularly Linked Lists and Linked-List Sorting|
|The Seven Functions Used in This Book|
|Analysis of Algorithms|
|Simple Justification Techniques|
|Stacks, Queues, and Deques|
|List and Iterator ADTs|
|List ADTs and the Collections Framework|
|Case Study: The Move-to-Front Heuristic|
|Tree Traversal Algorithms|
|Heaps and Priority Queues|
|The Priority Queue Abstract Data Type|
|Implementing a Priority Queue with a List|
|Adaptable Priority Queues|
|Hash Tables, Maps, and Skip Lists|
|Binary Search Trees|
|Sorting, Sets, and Selection|
|Studying Sorting through an Algorithmic Lens|
|Sets and Union/Find Structures|
|Strings and Dynamic Programming|
|Pattern Matching Algorithms|
|Text Compression and the Greedy Method|
|Data Structures for Graphs|
|Minimum Spanning Trees|
|Memory Management and B-Trees|
|External Memory and Caching|
|External Searching and B-Trees|
|A Useful Mathematical Facts|
|Table of Contents provided by Publisher. All Rights Reserved.|