Data Structures and Abstractions with Java

by ;
  • ISBN13:


  • ISBN10:


  • Edition: 4th
  • Format: Hardcover
  • Copyright: 8/21/2014
  • Publisher: Pearson

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $59!
    Your order must be $59 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
  • We Buy This Book Back!
    In-Store Credit: $61.82
    Check/Direct Deposit: $58.88
  • eCampus.com Device Compatibility Matrix

    Click the device icon to install or view instructions

    Apple iOS | iPad, iPhone, iPod
    Android Devices | Android Tables & Phones OS 2.2 or higher | *Kindle Fire
    Windows 10 / 8 / 7 / Vista / XP
    Mac OS X | **iMac / Macbook
    Enjoy offline reading with these devices
    Apple Devices
    Android Devices
    Windows Devices
    Mac Devices
    iPad, iPhone, iPod
    Our reader is compatible
    Android 2.2 +
    Our reader is compatible
    Kindle Fire
    Our reader is compatible
    10 / 8 / 7 / Vista / XP
    Our reader is compatible
    Our reader is compatible
List Price: $174.40 Save up to $87.20
  • Rent Book $87.20
    Add to Cart Free Shipping


Supplemental Materials

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 access cards, study guides, lab manuals, CDs, etc.
  • The Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.


Data Structures and Abstractions with Java is suitable for one- or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems. This book is also useful for programmers and software engineers interested in learning more about data structures and abstractions.


This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters — each with pedagogical tools to help students master each concept. Using the latest features of Java, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.


Teaching and Learning Experience

This book will provide a better teaching and learning experience—for you and your students. It will help:

  • Aid comprehension and facilitate teaching with an approachable format and content organization: Material is organized into small segments that focus a reader’s attention and provide greater instructional flexibility.
  • Support learning with student-friendly pedagogy: In-text and online features help students master the material.

Table of Contents

1 Introduction
2 Prelude: Designing Classes
3 Bags
4 Java Interlude 1: Generics
5 Bag Implementations That Use Arrays
6 Java Interlude 2: Exceptions
7 A Bag Implementation That Links Data
8 The Efficiency of Algorithms
9 Stacks
10 Stack Implementations
11 Recursion
12 Java Interlude 3: More About Generics
13 An Introduction to Sorting
14 Faster Sorting Methods
15 Java Interlude 4: More About Exceptions
16 Queues, Deques, and Priority Queues
17 Queue, Deque, and Priority Queue Implementations
18 Lists
19 A List Implementation That Uses an Array
20 A List Implementation That Links Data
21 Java Interlude 5: Iterators
22 Iterators for the ADT List
23 Java Interlude 6 Mutable and Immutable Objects
24 Sorted Lists
25 Java Interlude 7: Inheritance
26 Inheritance and Lists
27 Searching
28 Java Interlude 8: Generics 3
29 Dictionaries
30 Dictionary Implementations
31 Introducing Hashing
32 Hashing as a Dictionary Implementation
33 Trees
34 Tree Implementations
35 Java Interlude 9: Cloning
36 A Binary Search Tree Implementation
37 A Heap Implementation
38 Balanced Search Trees
39 Graphs
40 Graph Implementations
41 Appendix A Documentation and Programming Style
42 Appendix B Java Basics (online)
43 Appendix C Java Classes (online)
44 Appendix D Creating Classes from Other Classes (online)
45 Appendix E File Input and Output (online)

Rewards Program

Write a Review