Data Structures and Algorithm Analysis in Ada / Edition 1

Data Structures and Algorithm Analysis in Ada / Edition 1

by Mark A. Weiss
     
 

Product Details

ISBN-13:
9780805390551
Publisher:
Addison-Wesley
Publication date:
02/28/1993
Pages:
455
Product dimensions:
7.50(w) x 9.40(h) x 0.90(d)

Table of Contents

(Each chapter concludes with "Summary" and "Exercises", while most also conclude with "References".)
Introduction.

What's The Book About?
Mathematics Review.
A Brief Introduction To Recursion.
Ada At A Glance.

Algorithm Analysis.
Mathematical Background.
Model.
What To Analyzed.
Running Time Calculations.

Lists, Stacks, And Queues.
Abstract Data Types (ADTs).
The List ADT.
The Stack ADT.
The Queue AdT.

Trees.
Preliminaries.
Binary Trees.
The Search Tree ADT—Binary Search Trees.
AVL Trees.
Splay Trees.
Tree Traversals (Revisited).
B-Trees.

Hashing.
General Idea.
Hash Function.
Open Hashing (Separate Chaining).
Closed Hashing (Open Addressing).
Rehashing.
Extendible Hashing.

Priority Queues (Heaps).
Model.
Simple Implementations.
Binary Heap.
Applications Of Priority Queues.
D-Heaps.
Leftist Heaps.
Skew Heaps.
Binomial Queues.

Sorting.
Preliminaries.
Insertion Sort.
A Lower Bound For Simple Sorting Algorithms.
Shellsort.
Heapsort.
Mergesort.
Quicksort.
Sorting Large Records.
A General Lower Bound For Sorting.
Bucket Sort.
External Sorting.

The Disjoint Set ADT.
Equivalence Relations.
The Dynamic Equivalence Problem.
Basic Data Structure.
Smart Union Algorithms.
Path Compression.
Worst Case For Union-By-Rank And Path Compression.
An Application.

Graph Algorithms.
Definitions.
Topological Sort.
Shortest-Path Algorithms.
Network Flow Problems.
Minimum Spanning Tree.
Applications Of Depth-First Search.
Introduction To Np-Completeness.

Algorithm Design Techniques.
Greedy Algorithms.
Divide And Conquer.
Dynamic Programming.
Randomized Algorithms.
Backtracking Algorithms.

Amortized Analysis.
An Unrelated Puzzle.
Binomial Queues.
Skew Heaps.
Fibonacci Heaps.
Splay Trees.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >