Show simple item record

dc.contributor.authorToivonen, Tapani
dc.contributor.authorOyelere, Solomon
dc.contributor.editor-
dc.date.accessioned2020-01-08T12:37:13Z
dc.date.available2020-01-08T12:37:13Z
dc.date.issued2019
dc.identifier.urihttps://erepo.uef.fi/handle/123456789/7901
dc.description.abstractAnalysis of algorithms is a part of computing curriculums throughout the world in both undergraduate and graduate levels. However, students in general find this topic to be difficult subject due its theoretical and mathematical nature. This paper presents BiGO, a tool to support the students to understand and learn to analyze the time complexity of algorithms in rigorous manner. BiGO has four main features: i. it enables students to encode any given primitive recursive function with a specific scripting language in order to ii. automatically compute the upper bounds of the script and to, iii. visualize the behavior of the upper bounds in comparison to the most commonly occurring time complexity classes and, iv. view how long it takes for a computer to process the algorithm based on the different input values. This paper outlines the pedagogical goals of the tool and the system implementation architecture. Furthermore, we discuss future developmental plans for the tool and an evaluation within undergraduate and graduate level courses such as Data structures and algorithms and Design and analysis of algorithms.
dc.language.isoenglanti
dc.publisherACM Press
dc.relation.ispartofKoli Calling '19 Proceedings of the 19th Koli Calling International Conference on Computing Education Research
dc.relation.urihttp://dx.doi.org/10.1145/3364510.3364530
dc.rightsAll rights reserved
dc.titleBiGO: A Toolset to Support CS Students to Learn to Analyze Time Complexities of Algorithms
dc.description.versionfinal draft
dc.contributor.departmentSchool of Computing, activities
uef.solecris.id67141481en
dc.type.publicationArtikkelit ja abstraktit tieteellisissä konferenssijulkaisuissa
dc.rights.accessrights© Authors
dc.relation.doi10.1145/3364510.3364530
dc.description.reviewstatuspeerReviewed
dc.relation.articlenumber3
dc.relation.isbn978-1-4503-7715-7
dc.rights.accesslevelopenAccess
dc.type.okmA4
uef.solecris.openaccessEi


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record