Data Structures: A Pseudocode Approach with C / Edition 2

by Richard F. Gilberg, Behrouz A. Forouzan

Overview

This second edition expands upon the solid, practical foundation established in the first edition of the text. A new four-part organizational structure increases the flexibility of the text, and all material is presented in a straightforward manner accompanied by an array of examples and visual diagrams.

Product Details

ISBN-13:	9780534390808
Publisher:	Cengage Learning
Publication date:	10/11/2004
Series:	Data Structures
Edition description:	New Edition
Pages:	672
Product dimensions:	7.64(w) x 9.28(h) x 1.29(d)

About the Author

Richard F. Gilberg has more than 40 years of computer science experience in industry and academia. His industrial experience includes the development of large application systems, database administration, system testing, and data administration. After leaving the industry, he joined De Anza College as a professor of computer science. In addition to this text, he has also co-authored several others including Computer Science: A Structured Approach Using C, Computer Science: A Structured Approach Using C++, and Data Structures: A Pseudocode Approach with C++.


Behrouz Forouzan has more than 35 years of electronics and computer science experience in industry and academia. His industry experience includes designing electronic systems. After leaving the industry, he joined De Anza College as a professor of computer science. In addition to this text, he has authored and co-authored nine other textbooks including: Computer Science: A Structured Approach Using C, Computer Science: A Structured Approach Using C++, and Data Structures: A Pseudocode Approach with C++.

Table of Contents

Part 1: Introduction 1. Basic Concepts 2. Recursion Part 2: Linear Lists 3. Stacks 4. Queues 5. General Linear Lists Part 3: Non-Linear Lists 6. Introduction to Trees 7. Binary Search Trees 8. AVL Search Trees 9. Heaps 10. Multiway Trees 11. Graphs Part 4: Sorting and Searching 12. Sorting 13. Searching Appendices A: ASCII Tables B: Structure Charts C: Integer and Float Libraries D: Selected C Libraries E: Mathematical Series and Recursive Relations F: Array Implementations of Stacks and Queues