The author's important research on algorithm analysis is reflected in the clarity and currency of presentation in this Ada version of his bestselling book on data structures and algorithms. Many new and innovative data structures, such as Leftist Heaps and Splay Trees, are carefully explained and illustrated. Weiss' approach to data structures incorporates ADTs and algorithm analysis with a heavy emphasis on performance and running time. The presentation is amply illustrated with diagrams and figures. 0805390553B04062001
Sprache
Verlagsort
Zielgruppe
Für höhere Schule und Studium
Maße
Breite: 245 mm
Dicke: 23 mm
Gewicht
ISBN-13
978-0-8053-9055-1 (9780805390551)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Klassifikation
Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley.
0805390553AB04062001
(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. 0805390553T04062001
