Programme Design and Data Structures in PASCAL
This text introduces students - slowly, carefully and in a step-by-step fashion - to the use of data-structuring techniques in the design and implementation of large programming projects. The author combines a conceptual approach with practical programming assignments using the notion of the abstract data type as the key design principle. After reading Reynolds' book, students will be able to think about data types as abstract objects, develop new conceptual skills to visualize larger programs (especially ones managing complex data structures) and develop good programming habits. Included in this text are numerous large programming projects and every chapter contains a major project; each is thoroughly described, a top-down design is discussed, and the procedure/function of the ultimate Pascal program is explained. Numerous examples and illustrations help students understand difficult concepts. This book should be of interest to degree and diploma students on introductory courses in program design using Pascal.
- Paperback | 532 pages
- 01 Mar 1986
- Cengage Learning, Inc
- Wadsworth Publishing Co Inc
- Belmont, CA, United States
Table of contents
The use of abstraction in program design. The input abstract data type. Static sequential stacks and queues. Static sequential tables. Sequential character strings. Recursion. Linear linking: stacks, queues, and deques. Linear linked lists. Hashing algorithms. Search tree tables. Glossary. Index.