Paisktabelialgoritmide läbimängu automaatse hindaja loomine

Abstract

One of the topics in the course “Algorithms and data structures” is classical data structures and algorithms related to them. One way of teaching this is to have students play through the algorithms step-by-step. To avoid having them do it on paper, an environment is needed where the playthroughs can be done and where each playthrough is automatically evaluated for correctness. In this thesis the solution for the automatic evaluation of the playthrough of hash table algorithms was created. As part of this, a command line interface was also created, where the user can solve the playthrough task.