Data Structures A Pseudocode Approach with C++ (Hardcover)

Richard F. Gilberg, Behrouz A. Forouzan

無法訂購

買這商品的人也買了...

相關主題

商品描述

 

Summary

This new book makes it simple for beginning computer science students to design algorithms first using pseudocode and then build them using the C++ programming language. Based on Gilberg and Forouzan's successful text, DATA STRUCTURES: A PSEUDOCODE APPROACH WITH C, this new book emphasizes the practical approach to data structures.

Table of Contents

1. INTRODUCTION
Pseudocode / The Abstract Data Type / A Model for an Abstract Data Type / Algori thm Efficiency / Summary / Practice Sets / Exercises / Problems / Projects
2. SEARCHING
List Searches / C++ Search Algorithms / Hashed List Searches / Collision Resolut ion / Summary / Practice Sets / Exercises / Problems / Projects
3. LINKED LISTS
Linear List Concepts / Linked List Concepts / Linked List Algorithms / Processin g a Linked List / List Applications / Complex Linked List Structures / Building a Linked List - C++ Implementation / List Abstract Data Type - Linked List Imple mentation / Summary / Practice Sets / Exercises / Problems / Projects
4. STACKS
Basic Stack Operations / Stack Linked List Implementation / Stack Applications / Eight Queens Problem - C++ Implementation / Stack Abstract Data Type Implementa tion / Stack ADT - Array Implementation / Summary / Practice Sets / Exercises / Problems / Projects
5. QUEUES
Queue Operations / Queue Linked List Design / Queuing Theory / Queue Application s / Categorical Data - C++ Implementation / Queue ADT - Array Implementation / S ummary / Practice Sets / Exercises / Problems / Projects
6. RECURSION
Factorial - A Case Study / How Recursion Works / Designing Recursive Algorithms / Another Case Study - Fibonacci Numbers / The Towers of Hanoi / C++ Implementat ion of Recursion / Summary / Practice Sets / Exercises / Problems / Projects
7. INTRODUCTION TO TREES
Basic Tree Concepts / Binary Trees / Binary Tree Traversals / Expression Trees / General Trees / Huffman Code / Summary / Practice Sets / Exercises / Problems / Projects
8. SEARCH TREES
Binary Search Trees / AVL Trees / AVL Tree Implementation / AVL Abstract Data Ty pe / Summary / Practice Sets / Exercises / Problems / Projects
9. HEAPS
Heap Definition / Heap Structure / Basic Heap Algorithms / Heap Data Structure / Heap Algorithms / Heap Applications / A Heap Program / Summary / Practice Sets / Exercises / Problems / Projects
10. MULTIWAY TREES
M-Way Search Trees / B-Trees / Simplified B-Trees / B-Tree Variations / Lexical Search Tree / B-Tree Abstract Data Type / Summary / Practice Sets / Exercises / Problems / Projects
11. ADVANCED SORTING CONCEPTS
General Sort Concepts / Insertion Sorts / Selection Sorts / Exchange Sorts / Sum mary / External Sorts / Summary / Practice Sets / Exercises / Problems / Project s
12. GRAPHS
Terminology / Operations / Graph Storage Structures / Graph Algorithms / Network s / Abstract Data Type / Summary / 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 INP UT AND OUTPUT / H. THE STRING CLASS / I. POINTERS TO FUNCTIONS / J. INHERITANCE / K. C++ TEMPLATES / L. STANDARD TEMPLATE LIBRARY / SOLUTIONS TO SELECTED EXERCI SES / GLOSSARY / INDEX