Pascal procedures and functions for teaching linear data structures

Authors:
Joseph M. Fontana
Affiliations:
The University of Alabama in Birmingham
Venue:
SIGCSE '83 Proceedings of the fourteenth SIGCSE technical symposium on Computer science education
Year:
1983

Citing 8
Cited 0

Data structures using Pascal

Data structures using Pascal
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Curriculum '78: recommendations for the undergraduate program in computer science— a report of the ACM curriculum committee on computer science

Communications of the ACM
An introduction to information processing language V

Communications of the ACM
Programming in Pascal: Computer Science

Programming in Pascal: Computer Science
Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs
PASCAL user manual and report

PASCAL user manual and report
Fundamental Structures of Computer Science

Fundamental Structures of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Textbook subprogram packages for abstract data structures are often inadequate, inconsistent in design, or are listed as exercises. This paper presents three packages of coordinated Pascal procedures and functions that overcome these deficiencies for a selection of linear data structures. The packages are for array- and link-based stacks and link-based queues. Design guidelines for developing the packages are discussed, and examples of exercises using them are included.