Input Generation for Tree and Heap Algorithms
Name
Renno Sepp
Abstract
The main goal of this thesis work is to create a program that assists in generating inputs for the course “Algorithms and Data Structures”. The program is capable of composing inputs for tree and heap algorithms. During the generation of inputs, it is possible to specify the desired complexity level of the input solution and the parameters characterizing the data structure. The program enables instructors to efficiently generate a large amount of inputs with a consistent level of difficulty, which are non-repeating and suitable for both practice and knowledge testing. Specifically, the program can create inputs for binary search tree, AVL-tree, and heap algorithms.
Graduation Thesis language
Estonian
Graduation Thesis type
Bachelor - Computer Science
Supervisor(s)
Ahti Põder, Tõnis Hendrik Hlebnikov
Defence year
2024