## Data structures & problem solving using Java"The book's unique approach of separating the interface (how to use a data structure) and the implementation (how to program a structure) of each data structure into parts has been hailed by both professors and students as an outstanding and efficient way of teaching data structures. Professor Mark Allen Weiss continues with this approach in the third edition of Data Structures and Problem Solving Using Java by introducing concepts in four parts. Part 1 (tour of Java), Part 2 (Algorithms and Building Blocks), and Part 3 (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples. Implementation of data structures is not shown until Part 4 (Implementations). This practical approach forces the student to think abstractly about the functionality of the data structures before implementing them." "This edition incorporates the many enhancements of Java 5.0. It includes coverage of generic programming and of the design of generic collection classes. The book is appropriate for students who are familiar with basic Java programming concepts or are new to the language and want to learn how it treats data structures concepts."--BOOK JACKET. |

### What people are saying - Write a review

#### Review: Data Structures and Problem Solving Using Java

User Review - Samantha - GoodreadsThis book was ok. Most of its explanations were pretty decent, the only chapter I didn't think was that helpful was the one on graphs. Now I didn't read the first part because its just an overview of ... Read full review

#### Review: Data Structures & Problem Solving Using Java

User Review - Alaa - GoodreadsData Structures and Problem Solving Using Java Read full review

### Common terms and phrases

abstract class allows alpha-beta pruning analysis array base class basic Big-Oh binary search tree boolean Button chapter class method Comparable compiler compute constant constructor contiguous subsequence sum data structures declaration derived class element equal error evaluate example exception function hash table Hashable implementation import information hiding inheritance initial input insertion sort instance IntCell integers interface interpolation search iterations Java javadoc linear linked list logarithm loop maximum contiguous subsequence mergesort Mylnteger node object-oriented programming operator output package parameter performed permutation pivot point2 position primitive types priority queue problem public class public static void quadratic quickselect quicksort random numbers recursive calls reference types reference variable referenced result rithm routine running sequence Shellsort shown in Figure solve sorting algorithm stack statement static int static method static void main stored storedValue System.out.println Theorem throws clause tion toString try block worst-case