Text
Fundamentals of data structures in Pascal
Contents
Chapter 1. Introduction
1.1. Overview
1.2. How to Create Programs
1.3. How to Analyze Programs
Chapter 2. Arrays
2.1. Axiomatization
2.2. Ordered Lists
2.3. Sparse Matrices
2.4. Representation of Arrays
Chapter 3. Stacks and Queues
3.1. Fundamentals
3.2. A Mazing Problem
3.3. Evaluation of Expressions
3.4. Multiple Stacks and Queues
Chapter 4. Linked Lists
4.1. Singly Linked Lists
4.2. Linked Stacks and Queues
4.3. Polynomial Addition
4.4. More on Linked Lists
4.5. Equivalence Relations
4.6. Sparse Matrices
4.7. Doubly Linked Lists and Dynamic Storage Management
4.8. Generalized Lists
4.9. Garbage Collection and Compaction
4.10. STRINGS - A Case Study
Chapter 5. Trees
5.1. Basic Terminology
5.2. Binary Trees
5.3. Binary Tree Representations
5.4. Binary Tree Traversal
5.5. More on Binary Trees
5.6. Threaded Binary Trees
5.7. Binary Tree Representation of Tree
5.8. Application of Tree
5.9. Counting Binary Trees
Chapter 6. Graphs
6.1. Terminology and Representations
6.2. Traversals, Connected Components and Spanning Trees
6.3. Shortest Path and Transitive Closure
6.4. Activity Networks, Topological Sort and Critical Path
6.5. Enumerating All Paths
Chapter 7. Internal Sorting
7.1. Searching
7.2. Insertion Sort
7.3. Quicksort
7.4. How Fast Can We Sort?
7.5. 2-Way Merge Sort
7.6. Heap Sort
7.7. Sorting on Several Keys
7.8. Practical Considerations for Internal Sorting
Chapter 8. External Sorting
8.1. Storage Devices
8.2. Sorting with Disks
8.3. Sorting with Tapes
Chapter 9. Symbol Tables
9.1. Static Tree Tables
9.2. Dynamic Tree Tables
9.3. Hash Tables
Chapter 10. Files
10.1. Files, Queries, and Sequential Organizations
10.2. Index Techniques
10.3. File Organization
10.4. Storage Management
No other version available