Problem Solving Using UCSD Pascal

✍ Scribed by Kenneth L. Bowles, Stephen D. Franklin, Dennis J. Volper (auth.)

Publisher: Springer-Verlag New York
Year: 1984
Tongue: English
Leaves: 351
Edition: 2
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

To the Second Edition This book is designed both for introductory courses in computer problem solving, at the freshman and sophomore college level, and for individual self study. The first edition of this book has been used for teaching introductory classes at University of California San Diego (UCSD), University of California Irvine (UCI), and many other schools. This second edition is based on our experience using the text over the past six years with a broad range of students. We have taught the course using variations on Keller's Personalized System of Instruction (PSI). The organization of this book is conducive to this approach but does not require it. PSI methods allow slightly more material to be absorbed by the students than is the case with the traditional lecture/recitation presentation. PSI allows grading according to the number of chapter units completed. In a 10 week quarter, virtually all students who pass the course at UCSDand UCI complete the material covered in the first eleven chapters and the exercises associated with them. A substantial portion complete the entire fifteen chapters. For a conventional presentation under the semester system, the 15 chapters should present an appropriate amount of material for the average student.

✦ Table of Contents

Front Matter....Pages i-xi
Introduction....Pages 1-9
Getting Started....Pages 10-26
Procedures and Variables....Pages 27-56
Control Structures I WHILE and IF....Pages 57-69
Control Structures II For, Repeat and Case....Pages 70-94
More on Procedures — Scope....Pages 95-125
Handling Complex Program Structure....Pages 126-153
Data Representation....Pages 154-172
Input and Output....Pages 173-203
Basic Data Structures — I. Arrays....Pages 204-221
Basic Data Structures — II. Sets....Pages 222-240
Basic Data Structures — III. Records....Pages 241-252
Pointers....Pages 253-266
Searching....Pages 267-277
Sorting — I. Simple Algorithms....Pages 278-287
Sorting — II. Quicksort:....Pages 288-295
Back Matter....Pages 296-340