skip to main content
10.1145/236452.236575acmconferencesArticle/Chapter ViewAbstractPublication PagessigcseConference Proceedingsconference-collections
Article
Free Access

Fork diagrams for teaching selection in CS I

Published:01 March 1996Publication History

ABSTRACT

We propose a fork diagram as a visual representation of the algorithm for binary selection. Among other things, fork diagrams can be used to teach students how to write correctly nested if-else statements, analyze nested selection code, appreciate the problem of dangling else, and understand short circuit evaluation of conditions with boolean operators (and and or). We have used C code to illustrate concepts, although fork diagrams can be used for any high level language.

References

  1. KR85.B.W. Kernighan and D.M. Ritchie, The C Programming Language, Prentice Hall, 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L95.S.P. Levy, "Computer Language Usage in CSI: Survey Results", SIGCSE Bulletin, 27(3):21-26,9/95. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. W74.J.D. Warnier, Logical Construction of Programs, Van Nostrand, 1974. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S80.B. Shneiderman, Software Psychology, Winthrop Publishers, 1980.Google ScholarGoogle Scholar
  5. A85.J.R. Anderson, Cognilire Psychology and zls Implications, W.H. Freeman and Company, New York, 1985.Google ScholarGoogle Scholar

Index Terms

  1. Fork diagrams for teaching selection in CS I

    Recommendations

    Comments

    Login options

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

    Sign in
    • Published in

      cover image ACM Conferences
      SIGCSE '96: Proceedings of the twenty-seventh SIGCSE technical symposium on Computer science education
      March 1996
      447 pages
      ISBN:089791757X
      DOI:10.1145/236452

      Copyright © 1996 ACM

      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: 1 March 1996

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      SIGCSE '96 Paper Acceptance Rate78of205submissions,38%Overall Acceptance Rate1,595of4,542submissions,35%

      Upcoming Conference

      SIGCSE Virtual 2024

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader