Data Structures and Problem Solving Using Java, 4th edition

Published by Pearson (July 14, 2021) © 2010

  • Mark A. Weiss

eTextbook on Pearson+

ISBN-13: 9780137593354 (2021 update)
per month
Pay monthly or
pay undefined one-time
Buy nowOpens in a new tab
Instant access

eTextbook rental includes

  • Instant access to eTextbook
  • Search, highlight, and notes
  • Create flashcards
Products list
$170.66

Price Reduced From: $213.32

Details

  • A print text

This product is expected to ship within 3-6 business days for US and 5-10 business days for Canadian customers.

For the second or third programming course.

A practical and unique approach to data structures that separates interface from implementation.

This book provides a practical introduction to data structures with an emphasis on abstract thinking and problem solving, as well as the use of Java. It does this through what remains a unique approach that clearly separates each data structure’s interface (how to use a data structure) from its implementation (how to actually program that structure). Parts I (Tour of Java), II (Algorithms and Building Blocks), and III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, while Part IV (Implementations) focuses on implementation of data structures. This forces the reader to think about the functionality of the data structures before the hash table is implemented.

The Fourth Edition features many new updates as well as new exercises.

PART ONE: TOUR OF JAVA

Chapter 1: Primitive Java

Chapter 2: Reference Types

Chapter 3: Objects and Classes

Chapter 4: Inheritance

 

PART TWO: ALGORITHMS AND BUILDING BLOCKS

Chapter 5: Algorithm Analysis

Chapter 6: The Collections API

Chapter 7: Recursion

Chapter 8: Sorting Algorithms

Chapter 9: Randomization

 

PART THREE: APPLICATIONS

Chapter 10: Fun and Games

Chapter 11: Stacks and Compilers

Chapter 12: Utilities

Chapter 13: Simulation

Chapter 14: Graphs and Paths

 

PART FOUR: IMPLEMENTATIONS

Chapter 15: Inner Classes and Implementation of ArrayList

Chapter 16: Stacks and Queues

Chapter 17: Linked Lists

Chapter 18: Trees

Chapter 19: Binary Search Trees

Chapter 20: Hash Tables

Chapter 21: A Priority Queue: The Binary Heap

 

PART FIVE: ADVANCED DATA STRUCTURES

Chapter 22: Splay Trees

Chapter 23: Merging Priority Queues

Chapter 24: The Disjoint Set Class

 

APPENDIX A: Operators

APPENDIX B: Graphical User Interfaces

APPENDIX C: Bitwise Operators

 

This publication contains markup to enable structural navigation and compatibility with assistive technologies. Images in the publication MAY NOT be fully described, which is a barrier to those who rely on alternative text descriptions. The publication supports text reflow and contains no content hazards known to cause adverse physical reactions.

Need help? Get in touch