Data Structures and Abstractions with Java

Name: Data Structures and Abstractions with Java
Price: 94.99 USD
Availability: InStock
ISBN: 9780134831695

by Frank M. Carrano, Timothy M. Henry

5th Edition

Publisher: Pearson

(0 reviews)

Computers

Compare Prices

VitalSourceLifetime Access$94.99 AmazonKindle$59.80 Best PriceeTextShelfPDF$38.00

Book Details

Print ISBN	9780134831695
eText ISBN	9780134872353
Publisher	Pearson
Publishing Year	2019
Edition	5th Edition
Language	English
Pages	960

Data Structures and Abstractions with Java, 5th Edition provides a comprehensive foundation in data organization for students and instructors in introductory CS-2 courses. The textbook explicitly separates abstract data type specifications from concrete Java implementations, ensuring that learners master core data management concepts prior to analyzing specific coding details.

The curriculum advances logically through primary data structures and computational methods. Early units cover bags, array structures, and linked memory representations before introducing linear abstractions like stacks, queues, deques, and priority queues. Later sections examine list variations, custom iterators, searching, sorting techniques, dictionaries, hashing strategies, trees, binary search trees, heaps, and graph implementations.

To assist students and instructors with step-by-step learning, the volume divides its material into 30 chapters, each containing short numbered segments that concentrate on single concepts. This targeted structure establishes an accessible learning framework for computer science students pursuing foundational software design skills.

Chapter Introduction: Organizing Data
Chapter Prelude: Designing Classes
Chapter 1: Bags
- • Java Interlude 1 Generics
Chapter 2: Bag Implementations That Use Arrays
- • Java Interlude 2 Exceptions
Chapter 3: A Bag Implementation That Links Data
Chapter 4: The Efficiency of Algorithms
Chapter 5: Stacks
Chapter 6: Stack Implementations
- • Java Interlude 3 More About Exceptions
Chapter 7: Queues, Deques, and Priority Queues
Chapter 8: Queue, Deque, and Priority Queue Implementations
Chapter 9: Recursion
Chapter 10: Lists
Chapter 11: A List Implementation That Uses an Array
Chapter 12: A List Implementation That Links Data
- • Java Interlude 4 Iterators
Chapter 13: Iterators for the ADT List
Chapter 14: Problem Solving With Recursion
- • Java Interlude 5 More About Generics
Chapter 15: An Introduction to Sorting
Chapter 16: Faster Sorting Methods
- • Java Interlude 6 Mutable and Immutable Objects
Chapter 17: Sorted Lists
- • Java Interlude 7 Inheritance and Polymorphism
Chapter 18: Inheritance and Lists
Chapter 19: Searching
- • Java Interlude 8 Generics Once Again
Chapter 20: Dictionaries
Chapter 21: Dictionary Implementations
Chapter 22: Introducing Hashing
Chapter 23: Hashing as a Dictionary Implementation
Chapter 24: Trees
Chapter 25: Tree Implementations
- • Java Interlude 9 Cloning
Chapter 26: A Binary Search Tree Implementation
Chapter 27: A Heap Implementation
Chapter 28: Balanced Search Trees
Chapter 29: Graphs
Chapter 30: Graph Implementations
Chapter A: Documentation and Programming Style
Chapter B: Java Classes
Chapter C: Creating Classes from Other Classes
Chapter Supplement 1: Java Basics
Chapter Supplement 2: File Input and Output
Chapter Supplement 3: Glossary
Chapter Supplement 4: Answers to Study Questions