arrow
Return

Student misconceptions of dynamic programming: a replication study

delete2022-06-19
delete3
PRE
AI
M
Michael Shindler *
N
Natalia Pinpin
M
Mia Markovic
F
Frederick Reiber
J
Jee Hoon Kim
G
Giles Pierre Nunez Carlos
M
Mine Dogucu
M
Mark Hong
M
Michael Luu
B
Brian D. O. Anderson
A
Aaron Coté
M
Matthew Ferland
P
Palak Jain
T
Tyler LaBonte
L
Leena Mathur
R
Ryan Moreno
R
Ryan Sakuma
DOI:10.1080/08993408.2022.2079865delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Background and Context: We replicated and expanded on previous work about how well students learn dynamic programming, a difficult topic for students in algorithms class. Their study interviewed a number of students at one university in a single term. We recruited a larger sample size of students, over several terms, in both large public and private universities as well as liberal arts colleges. Objective: Our aim was to investigate whether the results of the previous work generalized to other universities and also to larger groups of students. Method: We interviewed students who completed the relevant portions of their algorithms class, asking them to solve problems. We observed the students' problem solving process to glean insight into how students tackle these problems. Findings: We found that students generally struggle in three ways, technique selection, recurrence building, and inefficient implementations. We then explored these themes and specific misconceptions qualitatively. We observed that the misconceptions found by the previous work generalized to the larger sample of students.
Keywords:
Replication study
dynamic programming
algorithms education

Journal

C
Computer Science Education
IF:
2.2
Papers:
207
Citations:
1.1K

Organization

University of California System cover
University of California System
Scholars:
37.5W
Papers: 33.7W
Citations: 6.6K
U
university of california irvine
Scholars:
2.3W
Papers: 1.7W
Citations: 55