Data Structures and Problem Solving Using Java / Edition 4

Data Structures and Problem Solving Using Java / Edition 4

5.0 1
by Mark A. Weiss
     
 

ISBN-10: 0321541405

ISBN-13: 9780321541406

Pub. Date: 10/29/2009

Publisher: Pearson

Data Structures and Problem Solving Using Java takes a practical and unique approach to data structures that separates interface from implementation. It is suitable for the second or third programming course.

This book provides a practical introduction to data structures with an emphasis on abstract thinking and problem solving, as well as

Overview

Data Structures and Problem Solving Using Java takes a practical and unique approach to data structures that separates interface from implementation. It is suitable for the second or third programming course.

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.

Product Details

ISBN-13:
9780321541406
Publisher:
Pearson
Publication date:
10/29/2009
Series:
Alternative eText Formats Series
Edition description:
New Edition
Pages:
1024
Sales rank:
122,963
Product dimensions:
7.40(w) x 9.10(h) x 1.60(d)

Table of Contents

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

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >

Data Structures and Problem Solving Using Java 5 out of 5 based on 0 ratings. 1 reviews.
Anonymous More than 1 year ago