Algorithms and Data Structures: The Science of Computing

Supplemental Material for Baldwin and Scragg, Algorithms and Data Structures: The Science of Computing; Charles River Media, 2004 (Now published by Cengage Learning)

Site Index


Welcome to the Web site for Algorithms and Data Structures: The Science of Computing, by Doug Baldwin and Greg Scragg. Algorithms and Data Structures: The Science of Computing is a new CS2 textbook, published in June of 2004 by Charles River Media (currently published by Cengage Learning).

This site provides supporting materials for students and instructors who use the book — for example, lab exercises, suggestions for instructors, sample code, etc. This site is an evolving work, so expect new materials to appear periodically.

Comments on any aspect of this site are welcome, and can be addressed to Doug Baldwin.

What’s Available

This site provides the following kinds of supporting material for the book:

The materials at this site can be organized in several ways — for example, by kind of material, by which chapter of the book they support, etc. To facilitate browsing by visitors with a variety of interests, several alternative indices to the materials appear below. The specific indices organize materials...

Site Organization

All documents at this site can be reached via the indices below. However, those interested in the Details of Site Organization can click here.

System Requirements

The Web pages at this site should be viewable with any modern browser, and the Java code should be executable under any current Java development environment. But if you suspect something from this site doesn’t work with your browser or development environment, or are just curious about what we expect, you can find out exactly what the System Requirements are (and please let us know about any problems).


Materials by Type

General

Laboratory Exercises

Interactive Lessons

Experiments

Instructor Notes

Software Library (Java code that students or instructors can incorporate into their own programs)

Errata


Materials by Chapter

Book as a Whole

Chapter 1 (“What Is the Science of Computing?”)

Chapter 2 (“Abstraction: An Introduction to Design”)

Chapter 3 (“Proof: An Introduction to Theory”)

Chapter 4 (“Experimentation: An Introduction to the Scientific Method”)

Chapter 5 (“Conditionals”)

Chapter 6 (“Designing with Recursion”)

Chapter 7 (“Analysis of Recursion”)

Chapter 9 (“Iteration and Efficiency”)

Chapter 11 (“Lists”)

Chapter 12 (“Queues and Stacks”)

Chapter 13 (“Binary Trees”)

Chapter 14 (“Case Studies in Design: Abstracting Indirection”)

Chapter 15 (“Exponential Growth”)


Materials by Topic

Data Structures

Debugging

Empirical Analysis

Experimentation, Experiments

See Empirical Analysis

Graphics

Hash Tables

Induction

Lists

Math

Object Oriented Programming

Pre- and Postconditions

Queues

Recurrence Relations

Recursion

Robots (simulated)

Sorting

Stacks

Theoretical Analysis

Trees


Copyright © 2004, 2005 Charles River Media. All rights reserved.

Revised December 1, 2012 by Doug Baldwin

Site Index