What is it about?
Algorithms, as they are presented in advanced classes, consist of a description of a process solving a well-defined problem. Properties of this process, such as its efficiency or correctness, are often reasoned about in a formal proof. This exploratory study suggests that advanced students comprehend the process and the proof on abstraction levels described in models on proof and program comprehension. However, they also connect components of the proof to components of the program, which adds another dimension to the comprehension process. These findings suggest that the wording of the problem the algorithm solves together with (possibly superficial) structural similarities between the proof and the process description may have a beneficial effect on establishing and understanding such connections.
Featured Image
Read the Original
This page is a summary of: Through (Tracking) Their Eyes: Abstraction and Complexity in Program Comprehension, ACM Transactions on Computing Education, June 2022, ACM (Association for Computing Machinery),
DOI: 10.1145/3480171.
You can read the full text:
Contributors
The following have contributed to this page