article

Free access

Pascal procedures and functions for teaching linear data structures

Author:

Joseph M. FontanaAuthors Info & Claims

ACM SIGCSE Bulletin, Volume 15, Issue 1

Pages 178 - 186

https://doi.org/10.1145/952978.801042

Published: 01 February 1983 Publication History

PDF eReader

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.

References

[1]

Austing, Richard H., et al, Editors. "Curriculum '78: Recommendations for the Undergraduate Program in Computer Science—A Report of the ACM Curriculum Committee on Computer Science." Comm.ACM, 22,3. (Apr. 1979), 147-166.

Digital Library

Google Scholar

[2]

Gottwald, E. PASCAL 2 - Sigma Users' Guide. Revision B. Xerox Corporation, (Aug. 1978). This publication is now available from Honeywell.

Google Scholar

[3]

Grogono, Peter. Programming in Pascal. Revised Edition. Addison-Wesley,(1980).

Digital Library

Google Scholar

[4]

Jensen, Kathleen, and Wirth, Niklaus. Pascal User Manual and Report. Second Edition. Springer-Verlag (1976).

Digital Library

Google Scholar

[5]

Joy, William N., Graham, Susan. L., and Haley, Charles B. Berkeley Pascal User's Manual, Version 2.0 - October 1980. University of California, Berkeley,(1980).

Google Scholar

[6]

Knuth, Donald E. "Algorithms." Scientific American Offprint 360. W. H. Freeman. This article appeared in Scientific American, 236, 4, (Apr. 1977), 63-80.

Crossref

Google Scholar

[7]

Knuth, Donald E. The Art of Computer Programming. Volume 1, Fundamental Algorithms. Second Edition. Addison-Wesley, (1973).

Digital Library

Google Scholar

[8]

Newell, Allen, and Tonge, F., "An Introduction to Information Processing Language V." Comm. ACM, 3, 4. (Apr. 1960), 205-211.

Digital Library

Google Scholar

[9]

Tenenbaum, Aaron M., and Augenstein, Moshe J. Data Structures Using Pascal. Prentice-Hall, (1981).

Digital Library

Google Scholar

[10]

Wirth, Niklaus. Algorithms + Data Structures &equil; Programs. Prentice-Hall,(1976).

Digital Library

Google Scholar

[11]

Wulf, William A., Shaw, Mary, Hilfinger, Paul N., and Flon, Lawrence. Fundamental Structures of Computer Science. Addison-Wesley, (1981).

Digital Library

Google Scholar

Index Terms

Recommendations

Pascal procedures and functions for teaching linear data structures
SIGCSE '83: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education

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 ...
Some remarks on teaching of programming
CompSysTech '04: Proceedings of the 5th international conference on Computer systems and technologies

In this paper we give some remarks on the problem of teaching programming for the first year students at the undergraduate level. The remarks are based on the experience gained by the author through several years of teaching programming at the Warsaw ...
Systolic Tree Implementation of Data Structures

Systolic tree architectures are presented for data structures such as stacks, queues, dequeues, priority queues, and dictionary machines. The stack, queue, and dequeue have a unit response time and a unit pipeline interval. The priority queue also has a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGCSE Bulletin Volume 15, Issue 1

Proceedings of the 14th SIGCSE technical symposium on Computer science education

February 1983

301 pages

ISSN:0097-8418

DOI:10.1145/952978

Issue’s Table of Contents

SIGCSE '83: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education
February 1983
307 pages
ISBN:0897910915
DOI:10.1145/800038
Chairmen:
Larry K. Cottrell,
Sheau-Dong Lang,
A. Joe Turner

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1983

Published in SIGCSE Volume 15, Issue 1

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
413
Total Downloads

Downloads (Last 12 months)86
Downloads (Last 6 weeks)24

Reflects downloads up to 21 Jan 2025

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Index Terms

Recommendations