Data structures and algorithms with object-oriented design patterns in Java / Bruno R. Preiss.
Publication details: New York ; John Wiley, c2000.Description: xvii, 635 p. : ill. (some col.) ; 25 cmISBN:- 0471346136 (cloth : alk. paper)
- 005.73 22 PRE
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
Book Open Access
|
Engineering Library | 005.73 PRE 1 (Browse shelf(Opens below)) | 1 | Available | BUML23080294 |
CHAPTER ONE : INTRODUCTION
1.1 What this book is about
1.2 Object oriented design
1.3 Object hierarchies and design patterns
etc
CHAPTER 2 : ALGORITHM ANALYSIS
2.1 A detailed model of the computer
2.2 A simplified model of the computer
CHAPTER 3 : ASMPTOTIC NOTATION
3.1 An asymptotic upper bound
3.2 An asymptotic lover bound
3.3 More notation - theta and little oh
3.4 Asymptotic analysis of algorithms
CHAPTER 4 : FOUNDATION DATA STRUCTURE
4.1 Arrays
4.2 Multi- Dimensional array
4.3 Singly linked lists
CHAPTER 5 : DATA TYPES AND ABSTRUCTION
5.1 Abstract data types
5.2 Design patterns
CHAPTER 6 : STACKS, QUEUES AND DEQUES
6.1 Stacks
6.2 Queues
6.3 Deques
CHAPTER 7
7.1 Ordered lists
7.2 Sorted lists
CHAPTER 8 : HASHING HASH TABLES AND SCATTER TABLES
8.1 Hashing - the basic idea
8.2 Hashing methods
8.3 Hash function implementation
etc
CHAPTER 9 : TREES
9.1 Basics
9.2 N-ary trees
9.3 Binary tress
etc
CHAPTER 10 : SEARCH TREES
10.1 Basics
10.2 Searching a search tree
10.3 Average case analysis
10.4 Implementation search trees
etc
CHAPTER 11 : HEAP AND PRIORITY QUEUES
11.1 Basics
11.2 Binary heaps
11.3 Leftist heaps
etc
CHAPTER 12 : SETS, MULTISTS AND PARTITIONS
12.1 Basics
12.2 Array and bit vector sets
12.3 Multists
12.4 Partitions
12.5 Applications
CHAPTER 13 : GARBAGE COLLECTION
13.1 What is garbage
13.2 Reference counting garbage collection
13.4 Mark and sweep garbage collection
13.4 Stop and copy garbage collection
13.5 Mark and compact garbage collection
CHAPTER 14 : ALORITHMS PATTERNS AND PROBLEM SOLVERS
14.1 Brut force and greedy algorithms
14.2 Backtracking algorithms
14.3 Top down algorithms
14.4 Bottom up algorithms
14.5 Randomised algorithms
CHAPTER 15 : SORTING ALGORITHMS AND SORTERS
15.1 Basics
15.2 Sorting and sorters
15.3 Insertion sorting
etc
CHAPTER 16 : GRAPHS AND GRAPHS ALGORITHMS
16.1 Basics
16.2 Implementation graphs
16.3 Graphs traversals
16.4 Shortest path algorithms
etc
Includes bibliographical : p. 624-626 . - index : p. 627-635
There are no comments on this title.