A unified framework to experiment with algorithm optimality and efficiency

It is common in algorithm courses to assess the correctness of algorithms via testing as well as conducting experiments to measure their run‐time performance. However, two severe problems must be addressed: both activities are conducted using different procedures and tools, and algorithm assessment...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer applications in engineering education 2021-11, Vol.29 (6), p.1793-1810
1. Verfasser: Velázquez‐Iturbide, J. Ángel
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:It is common in algorithm courses to assess the correctness of algorithms via testing as well as conducting experiments to measure their run‐time performance. However, two severe problems must be addressed: both activities are conducted using different procedures and tools, and algorithm assessment systems do not support well optimization problems due to their unique characteristics. Given the relevant role of optimization algorithms in computing, we present a unified framework to support experimentation with both criteria, that is, optimality and efficiency. The contributions of the article are twofold. First, we present a unified framework to experiment with both criteria, by using explicit principles and by presenting its instantiation in the AlgorEx system. The homogeneous treatment of optimality and time efficiency contributes to smoother integration of experimentation into a course syllabus and to easier adoption of the system. Second, we present our experience in several academic years in an algorithm course. Initially, it was noticed that students had severe difficulties dealing with experimentation, but their academic performance sharply increased by fully integrating experimentation along the complete course. The article also identifies some opportunities for extension in AlgorEx.
ISSN:1061-3773
1099-0542
DOI:10.1002/cae.22423