Java software structures : designing and using data structures / John Lewis & Joseph Chase.
Publication details: Boston ; Singapore ; Hong Kong : Pearson/Addison Wesley, c2004.Description: xxix, 666 p. : col. ill. ; 24 cmISBN:- 9780201788785
- 0201788780
- 005.133 22 LEW
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
Book Open Access
|
Engineering Library | 005.133 LEW 1 (Browse shelf(Opens below)) | 1 | Available | BUML23100928 |
Chapter 1 Software engineering
1.1 Software development
1.2 Software quality
1.3 Development life cycle models
1.4 The unified modeling language (UML)
1.5 Error handling
etc.
Chapter 2 Collections
2.1 Introduction to collections
2.2 A bag collection
2.3 Using a bag: bingo
2.4 Implementing a bag: with arrays
etc.
Chapter 3 Linked structures
3.1 References as a links
3.2 Managing linked lists
3.3 Elements without links
3.4 Implementing a bag: with links
etc.
Chapter 4 Recursion
4.1 Recursive thinking
4.2 Recursive programming
4.3 Using recursion
4.4 Analyzing recursion algorithms
etc.
Chapter 5 Searching and sorting
5.1 Searching
5.2 Sorting
Chapter 6 Stacks
6.1 A stack ADT
6.2 Using stacks: Evaluating posifix expressions
6.3 Using stacks: Simulating recursion
6.4 Implementing stack: with arrays
etc.
Chapter 7 Queues
7.1 A queue
7.2 Using queues: Code keys
7.3 Using queues: Ticket counter simulation
7.4 Using queues: Radix sort
7.5 Implementing queues: with arrays
etc.
Chapter 8 Lists
8.1 List ADT
8.2 Using ordered lists: tournament maker
8.3 Using index lists: the josephus problem
8.4 Implementing lists : with links
etc.
Chapter 9 Trees
9.1 Tree classifications
9.2 Strategies for implementing trees
9.3 Tree traversals
9.4 Implementing binary trees
9.5 Using binary trees: expression tree
Chapter 10 Binary search trees
10.1 A binary search tree
10.2 Implementing binary search tree: with links
10.3 Using binary search trees: implementing ordered lists
10.4 Balanced binary search trees
etc.
Chapter 11 Heaps
11.1 A heap
11.2 Using heaps: heap sort
11.3 Using heaps: Priority Queues
11.4 Implementing heaps: with arrays
etc.
Chapter 12 Multi-way search trees
12.1 Combining tree concepts
12.2 2-3 trees
12.3 2-4 trees
12.4 B-trees
etc.
Chapter 13 Hashing
13.1 A hashing
13.2 Hashing functions
13.3 Resolving collisions
13.4 Deleting elements from a hash table
etc.
Chapter 14 Un-directed graphs
14.1 Undirected graphs
14.2 Directed graphs
14.3 Networks
14.4 Common graph algorithms
etc.
Includes bibliographical references and index.
There are no comments on this title.