Data structures & algorithm analysis in Java / Mark Allen Weiss.
Publication details: Reading, Mass. ; Tokyo ; Bonn : Addison-Wesley Longman, Inc., c1999.Description: xviii, 542 p. : ill. ; 25 cmISBN:- 9780201357547
- 0201357542
- Data structures and algorithm analysis in Java
- 005.73 22 WEI
Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|
Book Open Access | Engineering Library | 005.73 WEI 1 (Browse shelf(Opens below)) | 1 | Available | BUML23111894 |
Browsing Engineering Library shelves Close shelf browser (Hides shelf browser)
005.73 NAP 1 Introduction to data structures with PASCAL / | 005.73 PRE 1 Data structures and algorithms with object-oriented design patterns in Java / | 005.73 TEN 1 Data structures using Pascal / | 005.73 WEI 1 Data structures & algorithm analysis in Java / | 005.73 WYK 1 Data structures and C programs / | 005.74 DAT. 1 An introduction to database systems / | 005.74 DAT 1 Data mining VIII : data, text, and web mining and their business applications / |
CONTENT :
Chapter 1 Introduction
1.1 Whats the book about ?
1.2 Mathematics review
1.3 A brief introduction to recursion
1.4 Generic objects in java
1.5 Exceptions
etc.
Chapter 2 Algorithm analysis
2.1 Mathematical background
2.2 Model
2.3 What to analyze
2.4 Running time calculations
etc.
Chapter 3 Lists,Stacks and queues
3.1 Abstract data types (ADTs )
3.2 The list ADT
3.3 The stack ADT
3.4 The queue ADT
etc.
Chapter 4 Trees
4.1 Preliminaries
4.2 Binary trees
4.3 The search tree ADT- Binary search trees
4.4 AVL Trees.
etc.
Chapter 5 Hashing
5.1 General idea
5.2 Hash function
5.3 Separate chaining
5.4 Open addressing
5.5 Rehashing
5.6 Extendible hashing
Chapter 6: Priority queues
6.1 Model
6.2 Simple implementations
6.3 Binary heap
6.4 Applications of priority queues
etc.
Chapter 7: Sorting
7.1 Preliminaries
7.2 Insertion sort
7.3 A lower bound for simple sorting algorithms
7.4 Shellsort
etc.
Chapter 8: The disjoint set ADT
8.1 Equivalence relations
8.2 The dynamic equivalence problem
8.3 Basic data structure
8.4 Smart union algorithms
etc.
Chapter 9: Graph algorithms
9.1 Definitions
9.2 Topological sort
9.3 Shortest-path algorithms
etc.
Chapter 10: Algorithms design techniques
10.1 Greedy algorithms
10.2 Divide and conquer
10.3 Dynamic programming
etc.
Chapter 11: Amortized analysis
11.1 An unrelated puzzle
11.2 Binomial queues
11.3 Skew heaps
etc.
Chapter 12: Advanced data structures and implementation
12.1 Top-down splay trees
12.2 Red-black trees
12.3 Deterministic skip lists
etc.
Includes bibliographical references and index.
There are no comments on this title.