Using Markov Matrix to Analyze Students' Strategies for Solving Parsons Puzzles [Konferenzbericht] Paper presented at the International Conference on Educational Data Mining (EDM) (16th, Bengaluru, India, Jul 11-14, 2023).

Autor/in	Kumar, Amruth N.
Titel	Using Markov Matrix to Analyze Students' Strategies for Solving Parsons Puzzles [Konferenzbericht] Paper presented at the International Conference on Educational Data Mining (EDM) (16th, Bengaluru, India, Jul 11-14, 2023).
Quelle	(2023), (9 Seiten) PDF als Volltext kostenfreie Datei Verfügbarkeit
Sprache	englisch
Dokumenttyp	gedruckt; online; Monographie
Schlagwörter	Markov Processes; Puzzles; Introductory Courses; Computer Science Education; Programming Languages; Teaching Methods; Student Characteristics; High School Students; Community College Students; Undergraduate Students; Intelligent Tutoring Systems; Computer Software + Suchen Sie Ihr Suchwort? Markowscher Prozess; Legespiel; Einführungskurs; Computer science lessons; Informatikunterricht; Teaching method; Lehrmethode; Unterrichtsmethode; High school; High schools; Student; Students; Oberschule; Schüler; Schülerin; Studentin; Community college; Community colleges; College students; Community College; Collegestudent; Intelligentes Tutorsystem
Abstract	Is there a pattern in how students solve Parsons puzzles? Is there a difference between the puzzle-solving strategies of C++ and Java students? We used Markov transition matrix to answer these questions. We analyzed the solutions of introductory programming students solving Parsons puzzles involving if-else statements and while loops in C++ and Java from fall 2016 to fall 2020. We present the results of our analysis qualitatively as heat maps and quantitatively using descriptive statistics. We found that most students solved the puzzles in the order in which lines appeared in the correct solution. Counter-intuitively, we found this pattern even in the solutions of the puzzles involving nested if-else statements, multiple while loops and nested while loops. Students who solved the puzzles with the fewest actions acted upon fewer lines out of order, i.e., not in the order in which they appear in the final solution. Whenever we found a statistically significant difference between C++ and Java solutions, C++ solutions involved fewer out-of-order and redundant actions than Java solutions. We discuss the implications of these results for the use of Parsons puzzles as a tool for teaching introductory programming. [For the complete proceedings, see ED630829.] (As Provided).
Anmerkungen	International Educational Data Mining Society. e-mail: admin@educationaldatamining.org; Web site: https://educationaldatamining.org/conferences/
Erfasst von	ERIC (Education Resources Information Center), Washington, DC
Update	2024/1/01