Article

Free access

Teaching programming to liberal arts students: using loop invariants

Author:

David ArnowAuthors Info & Claims

SIGCSE '94: Proceedings of the twenty-fifth SIGCSE symposium on Computer science education

Pages 141 - 144

https://doi.org/10.1145/191029.191087

Published: 12 March 1994 Publication History

PDF eReader

Abstract

Loop invariants have long been present in advanced undergraduate and graduate courses on programming methodology or program correctness. Recently there has been an increased interest in using loop invariants in teaching more elementary courses. In this paper, its successful use in teaching elementary programming in a computer literacy course for non-majors is described. The techniques described here, that are necessary in order to work successfully with this population, are also applicable to the teaching of programming to computer science majors.

References

[1]

Owen Astrachan, Loop Invariants as Pictures. The Proceedings of the Twenty-second SIGCSE Technical Symposium on Computer Science Education, (March, 1991).

Google Scholar

[2]

David M. Arnow, The Iliad and the WHILE Loop. The Proceedings of the Twenty-second SIGCSE Technical Symposium on Computer Science Education, (March, 1991).

Digital Library

Google Scholar

[3]

David M. Arnow, Program Correctness Proofs in a Computer Literacy Course. The Proceedings of Frontiers In Education '92, (November, 1992).

Google Scholar

[4]

Lymae V. Cheney, 50 Hours-- A Core Curriculum for College Students. National Endowment for the Humanities, (October, 1989).

Google Scholar

[5]

Edsgar W. Dijkstra, A Discipline of Programming. Prentice-Hall (1976).

Digital Library

Google Scholar

[6]

C. Van Dyke, Taking 'Computer Literacy' Literally. Comm. ACM, 30, 5, (May, 1987).

Digital Library

Google Scholar

[7]

David Giles, The Science of Programming. Springer-Verlag (1981).

Google Scholar

[8]

C.A.R. Hoare, An Axiomatic Basis for Computer Programming. Comm. ACM, 12, 5, (May, 1969).

Digital Library

Google Scholar

[9]

D. McCracken, SIGCSE Keynote Address, The Twenty-third SIGCSE Technical Symposium on Computer Science Education, (March, 1992).

Google Scholar

[10]

J. Paul Myers, Jr., The New Generation of Computer Literacy. The Proceedings of the Twentieth SIGCSE Technical Symposium on Computer Science Education, (February, 1989).

Digital Library

Google Scholar

[11]

J. Paul Myers, Jr., The Central Role of Mathematical Logic in Computer Science. The Proceedings of the Twenty-first SIGCSE Technical Symposium on Computer Science Education, (Maxeh, 1990).

Digital Library

Google Scholar

[12]

W. Tam, Teaching Loop Invariants by Example, The Proceedings of the Twenty-third SIGCSE Technical Symposium on Cmnputer Science Education, (March, 1992).

Digital Library

Google Scholar

[13]

D. Troeger, Experiences Teaching Loop Invariants to Beginners, Logic, Loops and Literacy Workshop, (May, 1993).

Google Scholar

Cited By

View all

Urban‐Lurain MWeinshank D(2013)Do Non‐Computer Science Students Need to Program?*Journal of Engineering Education10.1002/j.2168-9830.2001.tb00636.x90:4(535-541)Online publication date: 2-Jan-2013
https://doi.org/10.1002/j.2168-9830.2001.tb00636.x
Gurwitz C(1998)The Internet as a motivating theme in a math/computer core course for nonmajorsACM SIGCSE Bulletin10.1145/274790.27316430:1(68-72)Online publication date: 1-Mar-1998
https://dl.acm.org/doi/10.1145/274790.273164
Gurwitz CLewis JPrey J(1998)The Internet as a motivating theme in a math/computer core course for nonmajorsProceedings of the twenty-ninth SIGCSE technical symposium on Computer science education10.1145/273133.273164(68-72)Online publication date: 1-Mar-1998
https://dl.acm.org/doi/10.1145/273133.273164
Show More Cited By

Index Terms

Teaching programming to liberal arts students: using loop invariants

Recommendations

Teaching programming to liberal arts students: using loop invariants

Loop invariants have long been present in advanced undergraduate and graduate courses on programming methodology or program correctness. Recently there has been an increased interest in using loop invariants in teaching more elementary courses. In this ...
A programming sequence for the liberal arts college
Proceedings of the 11th SIGCSE symposium on Computer science education

The computer science program in a liberal arts college must meet a number of diverse needs. When the curriculum allows for only four computer courses each course must serve several functions. For example, the introductory programming course often must ...
Small or Liberal Arts Colleges Adapting to CS2013: Making It Work (Abstract Only)
SIGCSE '15: Proceedings of the 46th ACM Technical Symposium on Computer Science Education

Roughly once per decade, the ACM and IEEE-Computer Society form a joint task force to produce curricular guidelines for undergraduate computer science programs. The latest guidelines document, Computer Science Curricula 2013 (CS2013), was released in ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SIGCSE '94: Proceedings of the twenty-fifth SIGCSE symposium on Computer science education

March 1994

414 pages

ISBN:0897916468

DOI:10.1145/191029

Chairmen:
Robert Beck
Villanova Univ., Villanova, PA
,
Don Goelman
Villanova Univ., Villanova, PA

ACM SIGCSE Bulletin Volume 26, Issue 1
March 1994
410 pages
ISSN:0097-8418
DOI:10.1145/191033
Editor:
Daniel Joyce
Villanova Univ., Villanova, PA
Issue’s Table of Contents

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: 12 March 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SIGCSE94

Sponsor:

SIGCSE

SIGCSE94: 25th SIGCSE Technical Symposium on Computer Science Education

March 10 - 12, 1994

Arizona, Phoenix, USA

Acceptance Rates

Overall Acceptance Rate 1,595 of 4,542 submissions, 35%

Upcoming Conference

SIGCSE TS 2025

Sponsor:
sigcse

The 56th ACM Technical Symposium on Computer Science Education

February 26 - March 1, 2025

Pittsburgh , PA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
396
Total Downloads

Downloads (Last 12 months)46
Downloads (Last 6 weeks)10

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Urban‐Lurain MWeinshank D(2013)Do Non‐Computer Science Students Need to Program?*Journal of Engineering Education10.1002/j.2168-9830.2001.tb00636.x90:4(535-541)Online publication date: 2-Jan-2013
https://doi.org/10.1002/j.2168-9830.2001.tb00636.x
Gurwitz C(1998)The Internet as a motivating theme in a math/computer core course for nonmajorsACM SIGCSE Bulletin10.1145/274790.27316430:1(68-72)Online publication date: 1-Mar-1998
https://dl.acm.org/doi/10.1145/274790.273164
Gurwitz CLewis JPrey J(1998)The Internet as a motivating theme in a math/computer core course for nonmajorsProceedings of the twenty-ninth SIGCSE technical symposium on Computer science education10.1145/273133.273164(68-72)Online publication date: 1-Mar-1998
https://dl.acm.org/doi/10.1145/273133.273164
Ginat D(1996)Efficiency of algorithms for programming beginnersACM SIGCSE Bulletin10.1145/236462.23655128:1(256-260)Online publication date: 1-Mar-1996
https://dl.acm.org/doi/10.1145/236462.236551
Ginat DImpagliazzo JAdams E(1996)Efficiency of algorithms for programming beginnersProceedings of the twenty-seventh SIGCSE technical symposium on Computer science education10.1145/236452.236551(256-260)Online publication date: 1-Mar-1996
https://dl.acm.org/doi/10.1145/236452.236551
Ginat D(1995)Loop invariants and mathematical gamesACM SIGCSE Bulletin10.1145/199691.19981227:1(263-267)Online publication date: 15-Mar-1995
https://dl.acm.org/doi/10.1145/199691.199812
Ginat DLaxer C(1995)Loop invariants and mathematical gamesProceedings of the twenty-sixth SIGCSE technical symposium on Computer science education10.1145/199688.199812(263-267)Online publication date: 15-Mar-1995
https://dl.acm.org/doi/10.1145/199688.199812
Kiper JBishop‐Clark C(1995)Abstraction, Design, and Theory in Computer Science: A Liberal Arts CourseComputer Science Education10.1080/08993409500601066:1(93-110)Online publication date: Jan-1995
https://doi.org/10.1080/0899340950060106

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.

Cited By

Index Terms

Recommendations

Teaching programming to liberal arts students: using loop invariants

A programming sequence for the liberal arts college

Small or Liberal Arts Colleges Adapting to CS2013: Making It Work (Abstract Only)