ISBN-10:
0321541405
ISBN-13:
9780321541406
Pub. Date:
10/21/2009
Publisher:
Pearson
Data Structures and Problem Solving Using Java / Edition 4

Data Structures and Problem Solving Using Java / Edition 4

by Mark A. Weiss

Paperback

View All Available Formats & Editions
Current price is , Original price is $176.0. You
Select a Purchase Option (New Edition)
  • purchase options
    $154.00 $176.00 Save 12% Current price is $154, Original price is $176. You Save 12%.
  • purchase options

Product Details

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

About the Author

Mark Allen Weiss is a Professor in the School of Computing and Information Sciences at Florida International University in Miami Florida. He received his Bachelor's Degree in Electrical Engineering from The Cooper Union in 1983, and his Ph.D. in Computer Science from Princeton University in 1987, working under Bob Sedgewick. He has been at FIU since 1987, and was promoted to Professor in 1996. His interests include data structures, algorithms, and education, and he is most well-known for his highly-acclaimed Data Structures textbooks, which have been used at hundreds of universities worldwide.

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

Most Helpful Customer Reviews

See All Customer Reviews

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