Data Structures And Program Design In Pascal (2nd Edition)

by Larry Nyhoff & Sanford Leestma

This book is designed to meet the objectives of the course CS2 as described in the Curriculum '84 recommendations of the ACM (Association of Computing Machinery). It emphasized the application of software engineering princaples to the design of structured algorithms and Pascal programs begun in our CS1 test: Pascal: Programming and Problem Solving. A large number of examples consisting of algorithms, complete programs, and sample runs illustrated the application of these basic principles, but does so in an expanded improved manner.

The topics in this book are as follows:
- Reverse Polish notation and generation of machine code
- Finite automata and lexical analysis
- Computational complexity of algorithms, illustrated by the analysis of standard searching and sorting algorithms
- A description of the software development process, including formal specifications and program validation and verification
- An introduction to correctness proofs and verification
- Simple system concepts such as input/output buffers, parameter-passing mechanisms, address translation, and memory management
- Indirect recursion and parsing
- Symmetric linked lists and large-integer arithmetic
- String processing and data encryption schemes (DES and public key)
- Random number generation and simulation
- Abstract Data Types
- Object-orientated programming

ISBN 0-02-369465-3