skip to main content
10.1145/1508865.1508999acmconferencesArticle/Chapter ViewAbstractPublication PagessigcseConference Proceedingsconference-collections
research-article

Analyzing programming projects

Published:04 March 2009Publication History

ABSTRACT

Retaining students in Computer Science may be improved by engaging them in the learning process while preventing them from becoming overly frustrated. While engaging students during lecture is certainly important, most students spend a significant amount of time working on programming projects outside of class. Gaining a deep understanding of student engagement in programming is difficult, since the instructor is seldom present during the process. This paper presents the results of student surveys administered after each programming project for multiple sections of two courses: CS2, and Data Structures and Algorithms. We analyze the data in terms of engagement, frustration and niftiness.

References

  1. Baase, S. and Van Gelder, A., Computer Algorithms: Introduction to Design and Analysis, 3rd ed., Addison-Wesley, Reading, MA., 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Cooper, D. and Clancy, M., Oh! Pascal, 3rd ed., W. W. Norton & Co. Ltd., New York, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Cormen, T., Leiserson, C., Rivest, R. and Stein, C., Introduction to Algorithms, 2nd ed., MIT Press, Cambridge MA, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Dictionary.com Unabridged (v 1.1). Retrieved August 06, 2008, from Dictionary.com website: http://dictionary.reference.com/browse/niftyGoogle ScholarGoogle Scholar
  5. Feldman, T. and Zelenski, J., The Quest of Excellence in Designing CS1/CS2 Assignments, Proceeding of The Twenty-seventh SIGCSE Technical Symposium on Computer Science Education, February 15-17, 1996, Philadelphia, Pennsylvania. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Hansen, S. and Eddy, E. 2007. Engagement and Frustration in Programming Projects. Proceeding of The Thirty-eighth SIGCSE Technical Symposium on Computer Science Education, March 7-10, 2007, Covington, KY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Hunt, K. 2005. A Java Framework for Experimentation with Steganography. Proceedings of the Thirty-sixth SIGCSE Technical Symposium on Computer Science Education, February 23-27, 2005, St. Louis, Missouri. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Leetsma, S. and Nyhoff, G., Pascal Programming and Problem Solving, 4th ed., MacMillan Publishing, New York, 1993. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Litvin, M. and Litvin, G., Java Methods AB: Data Structures, Skylight Publishing, Andover, MA, 2003.Google ScholarGoogle Scholar
  10. Main, M., Data Structures and other Objects using Java, 3rd ed., Addison-Wesley, Boston, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Parlante, N., Nifty Assignments web site. http://nifty.stanford.edu/.Google ScholarGoogle Scholar
  12. Parlante, N., Stanford CS Education Library, http://cslibrary.stanford.edu/.Google ScholarGoogle Scholar
  13. Reed, D. (moderator), Baldwin, D., Clancy, M., Hansen, S., and Downey, A. 2002. Panel on Integrating Empirical Methods into Computer Science, Thirty-third SIGCSE Technical Symposium on Computer Science Education, March 2002, Covington, KY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Wayne, K., Computer Science 226, Algorithms and Data Structures web page, http://www.cs.princeton.edu/courses/archive/spr08/cos226/info.htmlGoogle ScholarGoogle Scholar

Index Terms

  1. Analyzing programming projects

    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 '09: Proceedings of the 40th ACM technical symposium on Computer science education
      March 2009
      612 pages
      ISBN:9781605581835
      DOI:10.1145/1508865

      Copyright © 2009 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: 4 March 2009

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      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