Data Structures and Algorithm Analysis in C++ / Edition 1

Data Structures and Algorithm Analysis in C++ / Edition 1

by Mark A. Weiss
     
 

ISBN-10: 0805354433

ISBN-13: 9780805354430

Pub. Date: 11/28/1993

Publisher: Addison-Wesley

In this second edition of his successful book, experienced teacher and Author Mark Allen Weiss continues to refine and enhance his innovative Approach to Algorithms And data structures. Written for the advanced data structures course, this text highlights theoretical topics like Abstract data types and the efficiency of Algorithms, as well as performance and

Overview

In this second edition of his successful book, experienced teacher and Author Mark Allen Weiss continues to refine and enhance his innovative Approach to Algorithms And data structures. Written for the advanced data structures course, this text highlights theoretical topics like Abstract data types and the efficiency of Algorithms, as well as performance and running time. This edition also includes A new chapter on advanced data structures and material on the Standard Template Library that conforms to the new standard. In Addition, All code has been updated and tested on multiple p1atforms and conforms to the ANSI ISO Final Draft standard. Before covering Algorithms and data structures, the author provides A brief introduction to C++ for programmers unfamiliar with the language. All of the source code will be Available over the Internet.

Dr. Weiss also distinguishes the book with his user-friendly writing style, logical organization of topics, and extensive use of figures and examples that show the successive stages of an algorithm.

Product Details

ISBN-13:
9780805354430
Publisher:
Addison-Wesley
Publication date:
11/28/1993
Edition description:
Older Edition
Pages:
475
Product dimensions:
7.75(w) x 9.42(h) x 0.98(d)

Table of Contents

What's the Book About? * Mathematics Review * A Brief Introduction to Recursion * C++ Classes* C++ Details * Templates * Using Matrices

ALGORITHM ANALYSIS

Mathematical Background * Model * What to Analyze * 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 * Separate Claiming * 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 Structures * A General Lower Bound for Sorting * Bucket Sort * Extemal 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 * Topologic Al 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

ADVANCED DATA STRUCTURES AND IMPLEMENTATION

Top-Down Splay Trees * Red Black Trees * Deterministic Skip Lists * A A-Trees * Treaps k-d Trees * Pairing Heaps

APPENDIX A: THE STANDARD TEMPLATE LIBRARY

Introduction * Basic STL Concepts * Unordered Sequences: vector And list * Sets * Maps * Example: Generating a Concordance * Example: Shortest Path Calculation

APPENDIX B: VECTOR AND STRING CLASSES

Vector Class string Class

END

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >