Students Struggle with Concepts in Dijkstra's Algorithm

Loading...
Thumbnail Image

Access rights

openAccess
publishedVersion

URL

Journal Title

Journal ISSN

Volume Title

A4 Artikkeli konferenssijulkaisussa

Date

2024-08-13

Major/Subject

Mcode

Degree programme

Language

en

Pages

12

Series

ICER '24: Proceedings of the 2024 ACM Conference on International Computing Education Research - Volume 1, pp. 154-165

Abstract

Teachers who are aware of potential student misconceptions teach better than teachers who do not. In this article, we focus on misconceptions in the context of teaching and learning graph algorithms: we seek to discover student misconceptions about Dijkstra's shortest-path algorithm and related concepts. We observed and interviewed fourteen students who worked on a visual simulation task involving the algorithm; we qualitatively analyzed these data to explore the students' mistakes and their underlying reasons. We find, among other things, that students conflate concepts such as spanning tree, fringe, and priority queue and that students may neglect the greedy and dynamic-programming aspects of the algorithm; we also identify usability issues in the visualization tool we employed. These findings suggest that teachers and tool designers need to take great care to help students tease apart the key concepts in graph algorithms.

Description

Publisher Copyright: © 2024 Owner/Author.

Keywords

algorithm visualization, algorithms, data structures, Dijkstra's algorithm, misconceptions

Other note

Citation

Tilanterä, A, Sorva, J, Seppälä, O & Korhonen, A 2024, Students Struggle with Concepts in Dijkstra's Algorithm . in ICER '24: Proceedings of the 2024 ACM Conference on International Computing Education Research - Volume 1 . ACM, pp. 154-165, ACM Conference on International Computing Education Research, Melbourne, Victoria, Australia, 12/08/2024 . https://doi.org/10.1145/3632620.3671096