Algorithms, Data Structures, and Problem Solving with C++

Algorithms, Data Structures, and Problem Solving with C++ is the first CS2 textbook that clearly separates the interface and implementation of data structures. The interface and running time of data structures are presented first, and students have the opportunity to use the data structures in a host of practical examples before being introduced to the implementations. This unique approach enhances the ability of students to think abstractly.

Features

• Retains an emphasis on data structures and algorithm design while using C++ as the language of implementation.
• Reinforces abstraction by discussing interface and implementations of data structures in different parts of the book.
• Incorporates case studies such as expression evaluation, cross-reference generation, and shortest path calculations.
• Provides a complete discussion of time complexity and Big-Oh notation early in the text.
• Gives the instructor flexibility in choosing an appropriate balance between practice, theory, and level of C++ detail. Contains optional advanced material in Part V.
• Covers classes, templates, and inheritance as fundamental concepts in sophisticated C++ programs.
• Contains fully functional code that has been tested on g++2.6.2, Sun 3.0.1, and Borland 4.5 compilers. Code is integrated into the book and also available by ftp December 1995.
• Includes end-of-chapter glossaries, summaries of common errors, and a variety of exercises.

TABLE OF CONTENTS

Part I: Objects and C++

Chapter 1: Pointers, Arrays, and Structures

1. What Are Pointers, Arrays, and Structures?
2. Pointer Syntax in C++
3. Arrays
4. Dynamic Allocation of Arrays: new[] and delete[]
5. Memory Exhaustion
6. Pointer Arithmetic and Pointer Hopping
7. Reference Variables
8. Structures

Chapter 2: Objects and Classes

1. What Is Object-Oriented Programming?
2. A Simple Example
3. A More Substantial Class: the Bit Array
4. Exploring More Details of the Class Interface
5. Additional C++ Class Features
6. Implementing a Class String
7. Recap: What Gets Called and What Are the Defaults?
8. Separate Compilation

Chapter 3: Templates

1. What Is a Template?
2. Template Functions
3. Template Classes
4. Fancy Templates
5. Bugs Associated with Templates

Chapter 4: Inheritance

1. What Are Polymorphism and Inheritance?
2. A Derived Class: BoundedVector
3. Public, Private, and Protected Members and Inheritance
4. Static and Dynamic Binding
5. Constructors and Destructors: Virtual or not Virtual?
6. Abstract Classes: A Shape Class
7. Multiple Inheritance

Part II: Algorithms and Building Blocks

Chapter 5: Algorithm Analysis

1. What Is Algorithm Analysis?
2. Examples of Algorithm Running Times
3. The Maximum Contiguous Subsequence Sum Problem
4. General Big-Oh Analysis
5. The Logarithm
6. Static Searching Problem
7. Checking an Algorithm Analysis
8. Limitations of Big-Oh Analysis

Chapter 6: Data Structures

1. Why Do We Need Data Structures?
2. Stacks
3. Queues
4. Linked Lists
5. General Trees
6. Binary Search Trees
7. Hash Tables
8. Priority Queues

Chapter 7: Recursion

1. What Is Recursion?
2. Background: Proofs by Mathematical Induction
3. Basic Recursion
4. Numerical Applications
5. Divide and Conquer
6. Dynamic Programming
7. Backtracking

Chapter 8: Sorting Algorithms

1. Why Is Sorting Important?
2. Preliminaries
3. Analysis of Insertion Sort and Other Simple Sorts
4. Shellsort
5. Mergesort
6. Quicksort
7. Quickselect
8. A Lower Bound for Sorting
9. Indirect Sorting

Chapter 9: Randomization

1. Why Do We Need Random Numbers?
2. Random Number Generators
3. Nonuniform Random Numbers 9.4 : Generating a Random Permutation
4. Randomized Algorithms
5. Randomized Primality Testing

Part III: Applications

Chapter 10: Fun and Games

1. Word Search Puzzles
2. The Game of Tic-Tac-Toe

Chapter 11: Stacks and Compilers

1. Balanced Symbol Checker
2. A Simple Calculator

Chapter 12: Utilities

1. File Compression
2. A Cross-Reference Generator

Chapter 13: Simulation

1. The Josephus Problem
2. Event-Driven Simulation

Chapter 14: Graphs and Paths

1. Definitions
2. Unweighted Shortest Path Problem
3. Positive Weighted Shortest Path Problem
4. General Weighted Shortest Path Problem
5. Path Problems in Acyclic Graphs

Part IV: Implementations

Chapter 15: Stacks and Queues

1. Dynamic Array Implementations
2. Linked List Implementations
3. Comparison of the Two Methods
4. Double-Ended Queues

Chapter 16: Linked Lists

1. Basic Ideas
2. C++ Implementation
3. Doubly Linked Lists and Circular Linked Lists
4. Sorted Linked Lists

Chapter 17: Trees

1. General Trees
2. Binary Trees
3. Recursion and Trees
4. Tree Traversal: Iterator Classes

Chapter 18: Binary Search Trees

1. Basic Ideas
2. Order Statistics
3. Analysis of Binary Search Tree Operations
4. AVL Trees
5. Red Black Trees
6. AA Trees
7. B-Trees

Chapter 19: Hash Tables

1. Basic Ideas
2. Hash Function
3. Linear Probing
4. Quadratic Probing
5. Separate Chaining

Chapter 20 : A Priority Queue: The Binary Heap

1. Basic Ideas
2. Implementation of the Basic Operations
3. FixHeap: Linear Time Heap Construction
4. Advanced Operations: DecreaseKey and Merge
5. Internal Sorting: Heapsort
6. External Sorting

Part V: Advanced Data Structures

Chapter 21: Splay Trees

1. Self-adjustment and Amortized Analysis
2. The Basic Bottom-Up Splay Trees
3. Basic Splay Tree Operations
4. Analysis of Bottom-Up Splaying
5. Top-Down Splay Trees
6. Implementation of Top-Down Splay Trees
7. Comparison of the Splay Tree with Other Search Trees

Chapter 22: Merging Priority Queues

1. The Skew Heap
2. The Pairing Heap

Chapter 23: The Disjoint Set Class

1. Equivalence Relations
2. Dynamic Equivalence
3. The Quick-Find Algorithm
4. The Quick-Union Algorithm
5. C++ Implementation
6. Worst Case for Union-by-Rank and Path Compression

Appendix A: Basic C++
Appendix B: Operators
Appendix C: Some Library Routines
Appendix D: Modifications for Exceptions

Index