It looks like you're offline.

An edition of Data structures (2001)

Data structures

a pseudocode approach with C++

by Richard F Gilberg

★★★★★ 5.0 (1 rating)
25 Want to read
3 Currently reading

Cover of: Data structures by Richard F Gilberg, Richard F Gilberg

My Reading Lists:

Use this Work

Create a new list

★★★★★ 5.0 (1 rating)
25 Want to read
3 Currently reading

Check nearby libraries

WorldCat

Buy this book

Last edited by ImportBot

December 19, 2023 | History

Edit

An edition of Data structures (2001)

Data structures

a pseudocode approach with C++

by Richard F Gilberg

★★★★★ 5.0 (1 rating)
25 Want to read
3 Currently reading

This work doesn't have a description yet. Can you add one?

Publish Date

2001

Publisher

Brooks/Cole

Language

English

Pages

754

Check nearby libraries

WorldCat

Buy this book

Previews available in: English

Edition	Availability
1 Data structures: a pseudocode approach with C++ 2001, Brooks/Cole in English 053495216X 9780534952167	aaaa Preview Only

Add another edition?

Book Details

Table of Contents

1. Introduction

1-1. Pseudocode

Algorithm Header

Purpose, Conditions, and Return

Statement Numbers

Algorithm Analysis

Statement Constructs

Pseudocode Example

1-2. The Abstract Data Type

Atomic and Composite Data

Abstract Data Type

1-3. A Model for an Abstract Data Type

ADT Data Structure

ADT Class Templates

1-4. Algorithm Efficiency

Logarithmic Loops

Standard Measures of Efficiency

Big-O Analysis Examples

1-6. Practice Sets

2-1. List Searches

Sequential Search

Variations on Sequential Searches

Binary Search Algorithm

Analyzing Search Algorithms

2-2. C++ Search Algorithms

Sequential Search in C++

Binary Search in C++

2-3. Hashed List Searches

Hashing Methods

Hashing Algorithm

2-4. Collision Resolution

Open Addressing

Linked List Resolution

Combination Approaches

Hash List Example

2-6. Practice Sets

3. Linked Lists

3-1. Linear List Concepts

3-2. Linked List Concepts

Linked List Data Structure

Pointers to Linked Lists

3-3. Linked List Algorithms

Unordered List Search

3-4. Processing a Linked List

Testing Insert and Delete Logic

3-5. List Applications

3-6. Complex Linked List Structures

Circularly Linked Lists

Doubly Linked Lists

Multilinked Lists

Multilinked List Insert

Multilinked List Delete

3-7. Building a Linked List — C++ Implementation

Application Functions

3-8. List Abstract Data Type — Linked List Implementation

List ADT Declaration

3-10. Practice Sets

4-1. Basic Stack Operations

4-2. Stack Linked List Implementation

Stack Algorithms

4-3. Stack Applications

Convert Decimal to Binary

4-4. Eight Queens Problem — C++ Implementation

Main Line Logic

4-5. Stack Abstract Data Type — Implementation

Stack ADT Implementation

4-6. Stack ADT — Array Implementation

Array Data Structure

Create Stack Array

Push Stack Array

Pop Stack Array

Stack Top Array

Empty Stack Array

Full Stack Array

Stack Count Array

Destroy Stack Array

4-8. Practice Sets

5-1. Queue Operations

5-2. Queue Linked List Design

Queue Algorithms

Retrieving Queue Data

5-3. Queuing Theory

5-4. Queue Applications

Queue Simulation

Categorizing Data

5-5. Categorizing Data — C++

Main Line Logic

Print One Queue

5-6. Queue ADT — Linked List Implementation

Queue Structure

Queue ADT Implementation

5-7. Queue ADT — Array Implementation

Array Queues Implementation

5-9. Practice Sets

6-1. Factorial — A Case Study

Recursion Defined

Iterative Solution

Recursive Solution

6-2. How Recursion Works

6-3. Designing Recursive Algorithms

The Design Methodology

Limitations of Recursion

Design Implementation — Reverse a Linked List

6-4. Another Case Study — Fibonacci Numbers

6-5. The Towers of Hanoi

Recursive Towers of Hanoi

6-6. C++ Implementations of Recursion

Fibonacci Numbers

Prefix to Postfix Conversion

Towers of Hanoi

6-8. Practice Sets

7. Introduction to Trees

7-1. Basic Tree Concepts

Tree Representation

7-2. Binary Trees

7-3. Binary Tree Traversals

Depth-First Traversals

Breadth-First Traversals

7-4. Expression Trees

Infix Traversal

Postfix Traversal

Prefix Traversal

7-5. General Trees

Changing General Tree to Binary Tree

Insertions into General Trees

General Tree Deletions

7-6. Huffman Code

7-8. Practice Sets

8. Search Trees

8-1. Binary Search Trees

Operations on Binary Search Trees

Binary Search Tree Search Algorithms

AVL Balance Factor

Balancing Trees

AVL Node Structure

AVL Delete Algorithm

Adjusting the Balance Factors

8-3. AVL Tree Implementation

Count Words

8-4. AVL Abstract Data Type

AVL Tree Data Structures

AVL Tree Functions

AVL Tree Data Processing

AVL Tree Utility Functions

8-6. Practice Sets

9-1. Heap Definition

9-2. Heap Structure

9-3. Basic Heap Algorithms

9-4. Heap Data Structure

9-5. Heap Algorithms

9-6. Heap Applications

Selection Algorithms

Priority Queues

9-7. A Heap Program

Heap Program Design

9-9. Practice Sets

10. Multiway Trees

10-1. m-Way Search Trees

B-Tree Insertion

B-Tree Insert Design

B-Tree Insert Node

B-Tree Deletion

Traverse B-Tree

10-3. Simplified B-Trees

10-4. B-Tree Variations

10-5. Lexical Search Tree

10-6. B-Tree Abstract Data Type

Utility Functions

Insert Algorithms

Delete Algoirthms

10-8. Practice Sets

11. Advanced Sorting Concepts

11-1. General Sort Concepts

Sort Efficiency

11-2. Insertion Sorts

Straight Insertion Sort

Insertion Sort Algorithms

Insertion Sort Implementation

11-3. Selection Sorts

Straight Selection Sort

Selection Sort Algorithms

Selection Sort Implementation

11-4. Exchange Sorts

Bubble Sort Algorithm

Exchange Sort Algorithms

11-6. External Sorts

Merging Ordered Files

Merging Unordered Files

The Sorting Process

Sort Phase Revisited

11-8. Practice Sets

12-1. Terminology

12-2. Operations

12-3. Graph Storage Structures

Adjacency Matrix

12-4. Graph Algorithms

Retrieve Vertex

Depth-First Traversal

Breadth-First Traversal

Minimum Spanning Tree

Shortest Path Algorithm

12-6. Abstract Data Type

Depth-First Traversal

Breadth-First Traversal

12-8. Practice Sets

Appendixes

A. ASCII Tables

B. Structure Charts

C. Program Standards and Styles

D. Random Numbers

E. Standard C++ Libraries

F. C++ Function Prototypes

G. Classes Related to Input and Output

H. The String Class

I. Pointers to Functions

K. C++ Templates

L. Standard Template Library

Solutions to Selected Exercises

Edition Notes

Includes index

Published in: Pacific Grove, CA

Classifications

Library of Congress: QA76.73.C153 G545 2001

The Physical Object

Pagination: xiv, 754 p. :
Number of pages: 754

Edition Identifiers

Open Library: OL16975453M
ISBN 10: 053495216X
LCCN: 00025353
LibraryThing: 1584651
Goodreads: 1060917

Work Identifiers

Work ID: OL11994669W

Source records

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

History

Created December 11, 2009
7 revisions

Download catalog record: RDF / JSON

December 19, 2023	Edited by ImportBot	import existing book
July 28, 2020	Edited by MARC Bot	import existing book
February 14, 2020	Edited by MARC Bot	remove fake subjects
July 22, 2017	Edited by Mek	adding subject: In library
December 11, 2009	Created by WorkBot	add works page