TY  - BOOK
AU  - Koffman,Elliot B.
AU  - Wolfgang,Paul A.T.
TI  - Objects, abstraction, data structures and design using Java
SN  - 9780471661511
U1  - 005.73 22
PY  - 2005///
CY  - Hoboken, NJ
PB  - John Wiley & Sons, Inc., 
KW  - Java (Computer program language)
KW  - Object-oriented programming (Computer science)
KW  - Application program interfaces (Computer software)
KW  - Data structures (Computer science)
N1  - CONTENT :

Chapter 1  Introduction to software design
1.1 The software challenge
1.2 The software life cycle
1.3 Using abstraction to manage complexity
1.4 Abstract data types, interfaces and pre- and post conditions
1.5 Requirements analysis, use cases and sequence diagrams
etc.

Chapter 2  Program correctness and efficiency
2.1 Program defects and "bugs"
2.2 The exception class hierarchy
2.3 Catching and handling exceptions
2.4 Throwing exceptions
2.5 Testing programs
etc

Chapter 3  Inheritance and class hierarchies
3.1 Introduction to inheritance and class hierarchies
3.2 Method overriding, method overloading and polymorphism
3.3 Abstract classes, assignment and casting in a hierarchy
3.4 Class object, casting and cloning
3.5 Multiple inheritance, multiple interferences and delegation
etc

Chapter 4  Lists and the collection interface
4.1 The list interface and array list class
4.2 Application of array list
4.3 Implementation of an array list class
4.4 Single-linked lists and double-linked lists
4.5 The linked list class and the iterator and list iterator interfaces
etc

Chapter 5  Stacks
5.1 Stack abstract data type
5.2 Stack application
5.3 Implementing a stack
5.4 Additional stack applications

Chapter 6: Queues
6.1 Queue abstract data type
6.2 Maintaining a queue of customers
6.3 Implementing the queue interface 
6.4 Simulating waiting lines using queues 

Chapter 7: Recursion
7.1 Recursive thinking
7.2 Recursive definitions of mathematical formulas
7.3 Recursive array search
7.4 Recursive data structures
etc.

Chapter 8: Trees
8.1 Tree terminology and applications
8.2 Tree traversals
8.3 Implementing a binary tree class
8.4 Binary search
etc.

Chapter 9: Sets and maps
9.1 Sets and the set interface 
9.2 Maps and the map interface 
9.3 Hash tables
9.4 Implementing the hash table 
etc.

Chapter 10: Sorting
10.1 Using Java sorting methods
10.2 Selection sort
10.3 Bubble sort 
10.4 Insertion sort 
etc.

Chapter 11: Self-balancing search trees
11.1 Tree balance and rotation
11.2 AVL tree
11.3 Red-black trees
11.4 2-3 trees
etc.

Chapter 12: Graphs 
12.1 Graph terminology 
12.2 The graph ADT and edge class 
12.3 Implementing the graph ADT 
12.4 Traversals of graphs 
etc.



; Includes index
UR  - http://www.loc.gov/catdir/toc/wiley051/2004303699.html
UR  - http://www.loc.gov/catdir/enhancements/fy0620/2004303699-d.html
ER  -