article

Free access

Graphic displays of data structures on the IBM PC

Authors:

Moshe Augenstein,

Yedidyah LangsamAuthors Info & Claims

ACM SIGCSE Bulletin, Volume 18, Issue 1

Pages 73 - 81

https://doi.org/10.1145/953055.5640

Published: 01 February 1986 Publication History

PDF eReader

Abstract

Immediately or soon after an introductory course in programming, traditional computer science education usually includes a course on data structures. Such courses, however, have suffered from a lack of non-textual materials for classroom and non-classroom use. Consequently, it is difficult for students to comprehend the abstractions involved in implementing and applying fundamental data structures without laboriously employing printed materials.

The work discussed herein addresses the problem by developing software for the IBM PC that will allow data structure users to view graphically the effects of primitive operations and application programs on basic data structures. Several such structures and applications are examined and plans for a program interface are discussed.

References

[1]

Augenstein, Moshe and Langsam, Yedidyah, "Software for Data Structures", Proceedings of the Ninth IBM University Study Conference - i 984, 195.

Google Scholar

[2]

Garg, Vijay Kumar, "Screen-Orlented High-Level Dehu&ger (SHD) for Pascal", ACM SIGPLAN Notices, Vol. 19, No. 3, (1984)~ 39.

Digital Library

Google Scholar

[3]

Getz, Sidney L., Kalllgiannis, George and Schach, Stephen R., "A Very High- Level Interactive Graphical Trace for the Pascal Heap", IEEE Trans. on Software Englneering, Vol. SE-9, No. 2, (1983), 179.

Digital Library

Google Scholar

[4]

Rambally, Gerard K., "Real-Time Graphlcal Representation of Linked Data Structures", ACM SIGCSE Bulletin, Vol. 17, No. I, (1985), 41.

Digital Library

Google Scholar

[5]

Tenenbaum, Aaron M. and Augenstein, Moshe J., Data Structures Usin~ Pascal, Prentice-Hall, ~9--8~:

Digital Library

Google Scholar

[6]

Wetherel 1, Charles and Shannon~ Alfred, "Tidy Drawings of Trees", IEEE Trans. on Software Engineering, Vol. SE-5, No. 5, (1979), 514.

Digital Library

Google Scholar

Cited By

View all

Sanders IGopal H(1991)AAPTACM SIGCSE Bulletin10.1145/122697.12270423:4(41-47)Online publication date: 1-Nov-1991
https://dl.acm.org/doi/10.1145/122697.122704
Ding CMateti P(1990)A Framework for the Automated Drawing of Data Structure DiagramsIEEE Transactions on Software Engineering10.1109/32.5277716:5(543-557)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1109/32.52777
Hays H(1988)Interactive graphics: a tool for beginning programming students in discovering solutions to novel problemsACM SIGCSE Bulletin10.1145/52965.5299920:1(137-141)Online publication date: 1-Feb-1988
https://dl.acm.org/doi/10.1145/52965.52999
Show More Cited By

Index Terms

Recommendations

Graphic displays of data structures on the IBM PC
SIGCSE '86: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education

Immediately or soon after an introductory course in programming, traditional computer science education usually includes a course on data structures. Such courses, however, have suffered from a lack of non-textual materials for classroom and non-...
Hybrid and custom data structures: evolution of the data structures course
ITiCSE '09

The topic of data structures has historically been taught with two major focuses: first, the basic definition and implementation of a small set of basic data structures (e.g. list, stack, queue, tree, graph), and second, the usage of these basic data ...
Hybrid and custom data structures: evolution of the data structures course
ITiCSE '09: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education

The topic of data structures has historically been taught with two major focuses: first, the basic definition and implementation of a small set of basic data structures (e.g. list, stack, queue, tree, graph), and second, the usage of these basic data ...

Reviews

Reviewer: Michael James Folk

This paper describes a set of primitive graphical display operations that can be added to Pascal program code to show dynamically how certain data structures change as the program runs. The authors have implemented routines that can be used to display arrays, stacks, queues, binary trees, and linked lists. These tools, the authors argue, can be used to help students understand the dynamic behavior of these data structures. They might also be used by applications programmers to help them debug programs that use dynamic data structures. The authors have implemented the graphical display operations in a way that lets a program create a file which can be “played back” to show how its data structures changed as the program ran. They propose, but apparently have not implemented, a system that will show the behavior of dynamic data structures in real time, making it possible for the user to interact with the program and the data structures as they evolve. The paper contains no information on how the routines were implemented, but it contains examples of how they can be used to display the performance of a bubble sort.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGCSE Bulletin Volume 18, Issue 1

Proceedings of the 17th SIGCSE symposium on Computer science education

February 1986

304 pages

ISSN:0097-8418

DOI:10.1145/953055

Issue’s Table of Contents

SIGCSE '86: Proceedings of the seventeenth SIGCSE technical symposium on Computer science education
February 1986
336 pages
ISBN:0897911784
DOI:10.1145/5600
Editors:
Joyce Currie Little
Towson State Univ., Baltimore, MD
,
Lillian N. Cassel
Univ. of Delaware, Newark

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 1986

Published in SIGCSE Volume 18, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
390
Total Downloads

Downloads (Last 12 months)94
Downloads (Last 6 weeks)20

Reflects downloads up to 23 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sanders IGopal H(1991)AAPTACM SIGCSE Bulletin10.1145/122697.12270423:4(41-47)Online publication date: 1-Nov-1991
https://dl.acm.org/doi/10.1145/122697.122704
Ding CMateti P(1990)A Framework for the Automated Drawing of Data Structure DiagramsIEEE Transactions on Software Engineering10.1109/32.5277716:5(543-557)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1109/32.52777
Hays H(1988)Interactive graphics: a tool for beginning programming students in discovering solutions to novel problemsACM SIGCSE Bulletin10.1145/52965.5299920:1(137-141)Online publication date: 1-Feb-1988
https://dl.acm.org/doi/10.1145/52965.52999
Hays H(1988)Interactive graphics: a tool for beginning programming students in discovering solutions to novel problemsProceedings of the nineteenth SIGCSE technical symposium on Computer science education10.1145/52964.52999(137-141)Online publication date: 1-Feb-1988
https://dl.acm.org/doi/10.1145/52964.52999
Stone D(1987)A modular approach to program visualization in computer science instructionProceedings of the eighteenth SIGCSE technical symposium on Computer science education10.1145/31820.31816(516-522)Online publication date: 1-Feb-1987
https://dl.acm.org/doi/10.1145/31820.31816
Maxim BElenbogen B(1987)Teaching programming algorithms aided by computer graphicsProceedings of the eighteenth SIGCSE technical symposium on Computer science education10.1145/31820.31775(297-301)Online publication date: 1-Feb-1987
https://dl.acm.org/doi/10.1145/31820.31775
Barnes GKind G(1987)Visual simulations of data structures during lectureProceedings of the eighteenth SIGCSE technical symposium on Computer science education10.1145/31820.31772(267-276)Online publication date: 1-Feb-1987
https://dl.acm.org/doi/10.1145/31820.31772
Stone D(1987)A modular approach to program visualization in computer science instructionACM SIGCSE Bulletin10.1145/31726.3181619:1(516-522)Online publication date: 1-Feb-1987
https://dl.acm.org/doi/10.1145/31726.31816
Maxim BElenbogen B(1987)Teaching programming algorithms aided by computer graphicsACM SIGCSE Bulletin10.1145/31726.3177519:1(297-301)Online publication date: 1-Feb-1987
https://dl.acm.org/doi/10.1145/31726.31775
Barnes GKind G(1987)Visual simulations of data structures during lectureACM SIGCSE Bulletin10.1145/31726.3177219:1(267-276)Online publication date: 1-Feb-1987
https://dl.acm.org/doi/10.1145/31726.31772
Show More Cited By

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

Cited By

Index Terms

Recommendations