Ari Korhonen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ari Korhonen has a total of 70 co-authors. Here are the top co-authors by number of shared publications:
Lauri Malmi
Aalto University, Helsinki, Finland
22 shared publicationsVille Karavirta
Aalto University
8 shared publications- Otto Seppälä
Aalto University, Espoo, Finland
7 shared publications - Artturi Tilanterä
Aalto University, Finland
6 shared publications Niko Myller
University of Eastern Finland, Joensuu, Finland
5 shared publicationsAhmad Taherkhani
Aalto University, Helsinki, Finland
4 shared publications
Latest Publications
- Open Access
- 8 March 2026
- Published by Taylor & Francis in Computer Science Education
- p. 1-31
Data structures and algorithms misconceptions in concept inventories: a systematic literature review
- 8 March 2026
- Published by Taylor & Francis in Computer Science Education
- p. 1-31
Open AccessData structures and algorithms misconceptions in concept inventories: a systematic literature review
- 2 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Exploring Traces from Algorithm Simulation: Students' Conceptions of Dijkstra's Algorithm
This full research paper explores undergraduate students' misconceptions of Dijkstra's algorithm quantitatively. Graph algorithm misconceptions have been studied to a modest extent, but they support effective instruction. A visual algorithm simulation (VAS) exercise requires a student to trace the algorithm by modifying a data structure visualization. We investigated effective ways to mine new algorithm misconceptions from VAS exercise data. In addition, we searched for previously unknown misconceptions of Dijkstra's algorithm. Students simulated Dijkstra's algorithm with a VAS exercise by adding edges of a given graph to a spanning tree. The simulations produced execution patterns which were mapped into a canonical form. We constructed another graph representing exercise states in all simulations. Using an interactive visualization of the state graph, we built hypotheses for misconceptions. The hypotheses were modeled as algorithms whose execution patterns were matched against students' simulations to find frequency of the hypothetical misconceptions. Pattern matching indicated that certain simulations resembled depth-first search, breadth-first search, and Prim's algorithm. Other simulations had evidence that students had understood the purpose of Dijkstra's algorithm, but arrived to the correct solution with ad hoc heuristics. The findings demonstrate how a VAS exercise was designed to reveal students' difficulties with graph algorithms. The methodology supports recognizing common misconceptions and therefore giving automated, formative feedback. The misconceptions itself are applicable to any exercise on elementary graph algorithms. Interactive visualization of an exercise state graph demonstrates the use of a new data-driven method for eliciting misconceptions.
- 2 November 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-9
Exploring Traces from Algorithm Simulation: Students' Conceptions of Dijkstra's Algorithm
This full research paper explores undergraduate students' misconceptions of Dijkstra's algorithm quantitatively. Graph algorithm misconceptions have been studied to a modest extent, but they support effective instruction. A visual algorithm simulation (VAS) exercise requires a student to trace the algorithm by modifying a data structure visualization. We investigated effective ways to mine new algorithm misconceptions from VAS exercise data. In addition, we searched for previously unknown misconceptions of Dijkstra's algorithm. Students simulated Dijkstra's algorithm with a VAS exercise by adding edges of a given graph to a spanning tree. The simulations produced execution patterns which were mapped into a canonical form. We constructed another graph representing exercise states in all simulations. Using an interactive visualization of the state graph, we built hypotheses for misconceptions. The hypotheses were modeled as algorithms whose execution patterns were matched against students' simulations to find frequency of the hypothetical misconceptions. Pattern matching indicated that certain simulations resembled depth-first search, breadth-first search, and Prim's algorithm. Other simulations had evidence that students had understood the purpose of Dijkstra's algorithm, but arrived to the correct solution with ad hoc heuristics. The findings demonstrate how a VAS exercise was designed to reveal students' difficulties with graph algorithms. The methodology supports recognizing common misconceptions and therefore giving automated, formative feedback. The misconceptions itself are applicable to any exercise on elementary graph algorithms. Interactive visualization of an exercise state graph demonstrates the use of a new data-driven method for eliciting misconceptions.
- Open Access
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 674-680
Investigating Students' Misconceptions of Dijkstra's Algorithm: Exploration of Algorithm Simulation Traces
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 674-680
Open AccessInvestigating Students' Misconceptions of Dijkstra's Algorithm: Exploration of Algorithm Simulation Traces
- Open Access
- 12 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 154-165
Students Struggle with Concepts in Dijkstra's Algorithm
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.
- 12 August 2024
- Published by Association for Computing Machinery (ACM)
- p. 154-165
Open AccessStudents Struggle with Concepts in Dijkstra's Algorithm
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.
- Open Access
- 29 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 505-511
Automated Questions About Learners' Own Code Help to Detect Fragile Prerequisite Knowledge
- 29 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 505-511
Open AccessAutomated Questions About Learners' Own Code Help to Detect Fragile Prerequisite Knowledge
- Open Access
- 23 September 2021
- Published by Morressier GmbH
Towards a JSON-based Algorithm Animation Language
Visual algorithm simulation (VAS) is a method used in teaching data structures and algorithms. In a VAS exercise a learner simulates the steps of an algorithm by interacting with data structure visualisations and receives feedback on the correctness of steps taken. A data format for storing VAS simulation traces would allow for later inspection of the process by instructors and
- 23 September 2021
- Published by Morressier GmbH
Open AccessTowards a JSON-based Algorithm Animation Language
Visual algorithm simulation (VAS) is a method used in teaching data structures and algorithms. In a VAS exercise a learner simulates the steps of an algorithm by interacting with data structure visualisations and receives feedback on the correctness of steps taken. A data format for storing VAS simulation traces would allow for later inspection of the process by instructors and
- Open Access
- 16 August 2021
- Published by Association for Computing Machinery (ACM)
- Vol. 35, 368-378
Algorithm Visualization and the Elusive Modality Effect
The modality effect in multimedia learning suggests that pictures are best accompanied by audio explanations rather than text, but this finding has not been replicated in computing education. We investigate which instructional modality works best as an accompaniment for algorithm visualizations. In a randomized controlled trial, learners were split into three conditions who viewed an instructional video on Dijkstra’s algorithm, with diagrams accompanied by audio, text, or both. We find neither a modality effect in favor of the audio condition nor a verbal redundancy effect in favor of using only a single modality rather than both. Taken together with earlier research, our findings suggest that the modality effect is difficult to apply reliably and computing educators should not rush to integrate audio into visualizations in expectation of the effect. We discuss theoretical viewpoints that future research should attend to; these include alternative part-explanations of the modality effect and attention-based models of working memory, among others.
- 16 August 2021
- Published by Association for Computing Machinery (ACM)
- Vol. 35, 368-378
Open AccessAlgorithm Visualization and the Elusive Modality Effect
The modality effect in multimedia learning suggests that pictures are best accompanied by audio explanations rather than text, but this finding has not been replicated in computing education. We investigate which instructional modality works best as an accompaniment for algorithm visualizations. In a randomized controlled trial, learners were split into three conditions who viewed an instructional video on Dijkstra’s algorithm, with diagrams accompanied by audio, text, or both. We find neither a modality effect in favor of the audio condition nor a verbal redundancy effect in favor of using only a single modality rather than both. Taken together with earlier research, our findings suggest that the modality effect is difficult to apply reliably and computing educators should not rush to integrate audio into visualizations in expectation of the effect. We discuss theoretical viewpoints that future research should attend to; these include alternative part-explanations of the modality effect and attention-based models of working memory, among others.
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Automatic recognition of misconceptions in visual algorithm simulation exercises
Visual algorithm simulation (VAS) is an activity in which students practice their understanding of algorithms: They simulate the steps of an algorithm by manipulating a bespoke visualization within a supporting software system. Multiple instances of a VAS exercise may be automatically generated for different learners or for repetitive practice by a single learner. In this work-in-progress report, we discuss how misconceptions might be automatically detected in students' solutions to VAS exercises and how misconception-aware feedback might be provided in VAS. We identify two strategies for producing multiple instances of VAS exercises and evaluate them against several criteria. The tradeoffs so identified are also pertinent for similar process-simulation practice beyond VAS and computing education.
- 1 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Automatic recognition of misconceptions in visual algorithm simulation exercises
Visual algorithm simulation (VAS) is an activity in which students practice their understanding of algorithms: They simulate the steps of an algorithm by manipulating a bespoke visualization within a supporting software system. Multiple instances of a VAS exercise may be automatically generated for different learners or for repetitive practice by a single learner. In this work-in-progress report, we discuss how misconceptions might be automatically detected in students' solutions to VAS exercises and how misconception-aware feedback might be provided in VAS. We identify two strategies for producing multiple instances of VAS exercises and evaluate them against several criteria. The tradeoffs so identified are also pertinent for similar process-simulation practice beyond VAS and computing education.
- Open Access
- 28 July 2014
- Published by Association for Computing Machinery (ACM)
- p. 27-34
Theoretical underpinnings of computing education research
We analyze the Computing Education Research (CER) literature to discover what theories, conceptual models and frameworks recent CER builds on. This gives rise to a broad understanding of the theoretical basis of CER that is useful for researchers working in that area, and has the potential to help CER develop its own identity as an independent field of study. Our analysis takes in seven years of publications (2005-2011, 308 papers) in three venues that publish long research papers in computing education: the journals ACM Transactions of Computing Education (TOCE) and Computer Science Education (CSEd), and the conference International Computing Education Research Workshop (ICER). We looked at the theoretical background works that are used or extended in the papers, not just referred to when describing related work. These background works include theories, conceptual models and frameworks. For each background work we tried to identify the discipline from which it originates, to gain an understanding of how CER relates to its neighboring fields. We also identified theoretical works originating within CER itself, showing that the field is building on its own theoretical works. Our main findings are that there is a great richness of work on which recent CER papers build; there are no prevailing theoretical or technical works that are broadly applied across CER; about half the analyzed papers build on no previous theoretical work, but a considerable share of these are building their own theoretical constructions. We discuss the significance of these findings for the whole field and conclude with some recommendations
- 28 July 2014
- Published by Association for Computing Machinery (ACM)
- p. 27-34
Open AccessTheoretical underpinnings of computing education research
We analyze the Computing Education Research (CER) literature to discover what theories, conceptual models and frameworks recent CER builds on. This gives rise to a broad understanding of the theoretical basis of CER that is useful for researchers working in that area, and has the potential to help CER develop its own identity as an independent field of study. Our analysis takes in seven years of publications (2005-2011, 308 papers) in three venues that publish long research papers in computing education: the journals ACM Transactions of Computing Education (TOCE) and Computer Science Education (CSEd), and the conference International Computing Education Research Workshop (ICER). We looked at the theoretical background works that are used or extended in the papers, not just referred to when describing related work. These background works include theories, conceptual models and frameworks. For each background work we tried to identify the discipline from which it originates, to gain an understanding of how CER relates to its neighboring fields. We also identified theoretical works originating within CER itself, showing that the field is building on its own theoretical works. Our main findings are that there is a great richness of work on which recent CER papers build; there are no prevailing theoretical or technical works that are broadly applied across CER; about half the analyzed papers build on no previous theoretical work, but a considerable share of these are building their own theoretical constructions. We discuss the significance of these findings for the whole field and conclude with some recommendations
- 1 April 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 41-46
Software Architectures for Implementing Achievement Badges - Practical Experiences
There are multiple commercial and non-commercial products available to integrate gamification aspects to existing services. Some of these are platform dependent whilst others are more general purpose. Commercial systems come with some problems - for example, lack of control and privacy issues. To avoid these problems, we created two iterations of badge systems and tested both of them on large courses (ca. 300 students each). In this paper, we present these systems and evaluate their merits and flaws. Based on our experiences, we present design principles on how to implement badge systems to existing online learning environments.
- 1 April 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 41-46
Software Architectures for Implementing Achievement Badges - Practical Experiences
There are multiple commercial and non-commercial products available to integrate gamification aspects to existing services. Some of these are platform dependent whilst others are more general purpose. Commercial systems come with some problems - for example, lack of control and privacy issues. To avoid these problems, we created two iterations of badge systems and tested both of them on large courses (ca. 300 students each). In this paper, we present these systems and evaluate their merits and flaws. Based on our experiences, we present design principles on how to implement badge systems to existing online learning environments.