Book - Data Structures and Algorithms with Object-Oriented Design Patterns in Java - Notemonk

Login with Facebook

Login

Books

Data Structures and Algorithms with Object-Oriented Design Patterns in Java ( 1 Like

Like

, 0 Unlike

Unlike

, 1 Follow

Follow

0

Flag as inappropriate

)

Share

add note

CONTENTS - PREFACE

Chapter - 1 - Introduction
- 1.1 What This Book Is About
- 1.2 Object - Oriented Design
- 1.3 Object Heirarchies and Design Patterns
- 1.4 The Features of Java You Need to Know
- 1.5 How This Book Is Organized
Chapter - 2 - Algorithm Analysis
- 2.1 A Detailed Model of the Computer
- 2.2 A Simplified Model of the Computer
- Exercises
- Programmming Projects
Chapter - 3 - Asyptotic Notation
- 3.1 An Asymptotic Upper Bound -----Big Oh
- 3.2 An Asymptotic Lower Bound -----Omega
- 3.3 More Notation------Theta and Little Oh
- 3.4 Asymptotic Analysis of Algorithms
- Exercises
- Programming Projects
Chapter - 4 - Foundation Data Structures
- 4.1 Arrays
- 4.2 Multi-Dimensional Arrays
- 4.3 Singly - Linkes Lists
- Exercises
- Programming Projects
Chapter - 5 - Data Types and Abstraction
- 5.1 Abstarct Data Types
- 5.2 Design Patterns
- Exercises
- Programming Projects
Chapter - 6 - Stacks,Queues ,and Deques
- 6.1 Stacks
- 6.2. Queues
- 6.3 Deques
- Exercises
- Programming Projects
Chapater - 7 - Ordered Lists and Sorted Lists
- 7.1 Ordered Lists
- 7.2 Sorted Lists
- Exercises
- Programming Projects
Chapter - 8 - Hashing,Hash Tables ,and Scatter Tables
- 8.1 Hashing ------The Basic Idea
- 8.2 Hashing Methods
- 8.3 Hash Function Implementations
- 8.4 Hash Tables
- 8.5 Scatter Tables
- 8.6 Scatter Tables using Open Adderssing
- 8.7 Applications
- Exercises
- Programming Projects
Chapter - 9 - Trees
- 9.1 Basics
- 9.2 N--ary Trees
- 9.3 Binary Trees
- 9.4 Trees Traversals
- 9.5 Expression Trees
- 9.6 Implementing Trees
- Exercises
- Programming Projects
Chapter - 10 - Search Trees
- 10.1 Basics
- 10.2 Searching a Search Tree
- 10.3 Average Case Analysis
- 10.4 Implementing Search Tree
- 10.5 AVL Search Tree
- 10.6 M-Way Search Tree
- 10.7 B-Tree
- 10.8 Applications
- Exercises
- Programming Projects
Chapter - 11 - Heaps and Priority Queues
- 11.1 Basics
- 11.2 Binary Heaps
- 11.3 Leftist Heaps
- 11.4 Binomial Queues
- 11.5 Applications
- Exercises
- Programming Projects
Chapter - 12 - Sets, Multisets, and Partitions
- 12.1 Basics
- 12.2 Array and Bit-Vector Sets
- 12.3 Multisets
- 12.4 Partitions
- 12.5 Applications
- Exercises
- Programming Projects
Chapter - 13 - Garbage Collection
- 13.1 What is Garbage?
- 13.2 Reference Counting Garbage Collection
- 13.3 Mark-and-Sweep Garbage Collection
- 13.4 Stop-and-Copy Garbage Collection
- 13.5 Mark-and-Compact Garbage Collection
- Exercises
- Programming Projects
Chapter - 14 - Algorithmic Patterns and Problem Solvers
- 14.1 Brute-Force and Greedy Algorithms
- 14.2 Backtracking Algorithms
- 14.3 Top-Down Algorithms: Divide-and-Conquer
- 14.4 Bottom-Up Algorithms: Dynamic Programming
- 14.5 Randomized Algorithms
- Exercises
- Programming Projects
Chapter - 15 - Sorting Algorithms and Sorters
- 15.1 Basics
- 15.2 Sorting and Sorters
- 15.3 Insertion Sorting
- 15.4 Exchange Sorting
- 15.5 Selection Sorting
- 15.6 Merge Sorting
- 15.7 A Lower Bound on Sorting
- 15.8 Distribution Sorting
- 15.9 Performance Data
- Exercises
- Programming Projects
Chapter - 16 - Graphs and Graph Algorithms
- 16.1 Basics
- 16.2 Implementing Graphs
- 16.3 Graph Traversals
- 16.4 Shortest-Path Algorithms
- 16.5 Minimum-Cost Spanning Trees
- 16.6 Application: Critical Path Analysis
- Exercises
- Programming Projects
A - Java and Object-Oriented Programming
- A.1 Variables
- A.2 Parameter Passing
- A.3 Objects and Classes
- A.4 Inner Classes
- A.5 Inheritance and Polymorphism
- A.6 Exceptions
B - Class Hierarchy Diagrams
C - Character Codes
Index