skip to main content
10.1145/3287324.3287419acmconferencesArticle/Chapter ViewAbstractPublication PagessigcseConference Proceedingsconference-collections
research-article
Public Access

The Relationship between Prerequisite Proficiency and Student Performance in an Upper-Division Computing Course

Published: 22 February 2019 Publication History

Abstract

While it is widely believed that taking a class's prerequisites is critical for success, less is known about how proficiency with the prerequisite knowledge from those courses affects performance in later courses. Specifically, it is unclear how well students understand material from prerequisite courses and whether that understanding may impact their outcomes in the subsequent course. Additionally, in subsequent courses, do students strengthen their knowledge from prerequisite courses and, if they do, does that improvement matter for the subsequent course? This study examines the prerequisite knowledge of 208 students in an upper-division data structures class at a large North American research university. Prerequisite proficiency on entry to the course was surprisingly low, with nearly a third of students demonstrating low proficiency and only a quarter high proficiency. Students modestly improved their proficiency during the term, lifting a third of those with low proficiency to at least medium proficiency. Overall, final exam performance was significantly correlated with prerequisite knowledge. For those with low initial proficiency, improvement in proficiency was significantly correlated with performance on the final. These results suggest that more attention needs to be placed on reinforcing prerequisite knowledge for those with low proficiency.

References

[1]
Course and professor evaluations (cape). http://cape.ucsd.edu/. Accessed: 2018--11-05.
[2]
Prerequisite surveys. https://paperdata.page.link/surveys. Accessed: 2018--11-05.
[3]
A. D. Baddeley and A. D. Baddeley. Your memory: A user's guide. Carlton Books New York, NY, USA:, 2004.
[4]
H. Danielsiek, W. Paul, and J. Vahrenhold. Detecting and understanding students' misconceptions related to algorithms and data structures. In Proceedings of the 43rd Technical Symposium on Computer Science Education, pages 21--26, 2012.
[5]
R. O. Duda, P. E. Hart, and N. J. Nilsson. Subjective bayesian methods for rule-based inference systems. In Proceedings of the June 7--10, 1976, National Computer Conference and Exposition, AFIPS '76, pages 1075--1082, 1976.
[6]
T. Götschi, I. Sanders, and V. Galpin. Mental models of recursion. SIGCSE '03, pages 346--350, New York, NY, USA, 2003. ACM.
[7]
S. Hamouda, S. H. Edwards, H. G. Elmongui, J. V. Ernst, and C. A. Shaffer. A basic recursion concept inventory. Computer Science Education, 27(2):121--148, 2017.
[8]
A. Lishinski, A. Yadav, J. Good, and R. Enbody. Learning to program: Gender differences and interactive effects of students' motivation, goals, and self-efficacy on performance. In Proceedings of the 2016 Conference on International Computing Education Research, pages 211--220, 2016.
[9]
M. A. Martin. Course prerequisites and undergraduate student performance. NACTA Journal, 33(1):38--42, 1989.
[10]
K. Muralidharan, A. Singh, and A. J. Ganimian. Disrupting education? experimental evidence on technology-aided instruction in india. Technical report, National Bureau of Economic Research, 2016.
[11]
S. E. Newstead, A. Franklyn-Stokes, and P. Armstead. Individual differences in student cheating. Journal of Educational Psychology, 88(2):229, 1996.
[12]
A.-C. J. T. F. on Computing Curricula. Computer science curricula 2013. 2013.
[13]
V. Ramalingam, D. LaBelle, and S. Wiedenbeck. Self-efficacy and mental models in learning to program. SIGCSE Bulletin, 36:171--175, 2004.
[14]
J. Sheard, A. Carbone, R. Lister, B. Simon, E. Thompson, and J. L. Whalley. Going solo to assess novice programmers. pages 209--213, 2008.
[15]
Simon and J. Sheard. Academic integrity and computing assessments. In Proceedings of the Australasian Computer Science Week Multiconference, pages 3:1--3:8, 2016.
[16]
E. Soloway. Learning to program= learning to construct mechanisms and explanations. Communications of the ACM, 29(9):850--858, 1986.
[17]
C. Taylor, D. Zingaro, L. Porter, K. C. Webb, C. B. Lee, and M. Clancy. Computer science concept inventories: past and future. Computer Science Education, 24(4):253--276, 2014.
[18]
J. Vitale, S. Wanger, and D. Adams. Explaining student performance in an undergraduate agricultural economics classroom. NACTA Journal, 54(1):2, 2010.
[19]
H. M. Walker. Prerequisites: Shaping the computing curriculum. ACM Inroads, 1(4):14--16, Dec. 2010.
[20]
C. Watson, F. W. Li, and J. L. Godwin. No tests required: Comparing traditional and dynamic predictors of programming success. In Proceedings of the 45th Technical Symposium on Computer Science Education, pages 469--474, 2014.
[21]
B. C. Wilson and S. Shrock. Contributing to success in an introductory computer science course: a study of twelve factors. SIGCSE Bulletin, 33:184--188, 2001.
[22]
D. Zingaro, M. Craig, L. Porter, B. A. Becker, Y. Cao, P. Conrad, D. Cukierman, A. Hellas, D. Loksa, and N. Thota. Achievement goals in CS1: Replication and extension. In Proceedings of the 49th Technical Symposium on Computer Science Education, pages 687--692, 2018.
[23]
D. Zingaro and L. Porter. Impact of student achievement goals on cs1 outcomes. In Proceedings of the 47th Technical Symposium on Computing Science Education, pages 279--296, 2016.

Cited By

View all

Index Terms

  1. The Relationship between Prerequisite Proficiency and Student Performance in an Upper-Division Computing Course

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SIGCSE '19: Proceedings of the 50th ACM Technical Symposium on Computer Science Education
      February 2019
      1364 pages
      ISBN:9781450358903
      DOI:10.1145/3287324
      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]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 22 February 2019

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. data structures
      2. prerequisites
      3. student performance

      Qualifiers

      • Research-article

      Funding Sources

      Conference

      SIGCSE '19
      Sponsor:

      Acceptance Rates

      SIGCSE '19 Paper Acceptance Rate 169 of 526 submissions, 32%;
      Overall Acceptance Rate 1,595 of 4,542 submissions, 35%

      Upcoming Conference

      SIGCSE TS 2025
      The 56th ACM Technical Symposium on Computer Science Education
      February 26 - March 1, 2025
      Pittsburgh , PA , USA

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)201
      • Downloads (Last 6 weeks)20
      Reflects downloads up to 09 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media