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.

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)