Classifying and recognizing students' sorting algorithm implementations in a data structures and algorithms course

dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.authorTaherkhani, Ahmad
dc.contributor.authorKorhonen, Ari
dc.contributor.authorMalmi, Lauri
dc.contributor.departmentTietotekniikan laitosfi
dc.contributor.departmentDepartment of Computer Science and Engineeringen
dc.contributor.schoolPerustieteiden korkeakoulufi
dc.contributor.schoolSchool of Scienceen
dc.date.accessioned2012-06-13T08:46:45Z
dc.date.available2012-06-13T08:46:45Z
dc.date.issued2012
dc.description.abstractWe discuss an instrument for recognizing and classifying algorithms (Aari) in terms of whiteboxtesting. We examined freshmen students' sorting algorithm implementations in a datastructures and algorithms course in two rounds: at the beginning of the course before thestudents received any instruction on sorting algorithms, and after taking lectures on sortingalgorithms. We evaluated the performance of Aari with the implementations of each roundseparately. The results show that the sorting algorithms (in Java), which Aari has been trainedto recognize (Insertion sort, Selection sort, Bubble sort, Quicksort and Mergesort), arerecognized with an average accuracy of about 90%. When considering all the submitted sortingalgorithm implementations (including the variations of the standard algorithms), Aari achievedan overall accuracy being 71% and 81% for the first and second round, respectively. The manual analysis of the implementations revealed that students have manymisconceptions related to sorting algorithms. For example, they include unnecessary swaps intheir Insertion or Selection sort implementations. Based on the data, we present acategorization of these types of variations. We also discuss how these categories can be used toimprove education of sorting methods, and to further develop Aari as a white-box testing tool,which gives feedback to the students on their inappropriate solutions and asks them to correctthe problem; something black-box testing is not capable of doing.en
dc.format.extent21
dc.format.mimetypeapplication/pdf
dc.identifier.isbn978-952-60-4526-9 (electronic)
dc.identifier.issn1799-490X (electronic)
dc.identifier.issn1799-4896 (printed)
dc.identifier.issn1799-4896 (ISSN-L)
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/3579
dc.identifier.urnURN:ISBN:978-952-60-4526-9
dc.language.isoenen
dc.publisherAalto Universityen
dc.publisherAalto-yliopistofi
dc.relation.ispartofseriesAalto University publication series SCIENCE+TECHNOLOGYen
dc.relation.ispartofseries4/2012
dc.subject.keywordalgorithm recognitionen
dc.subject.keywordclassifying students' sorting implementationsen
dc.subject.keywordroles of variablesen
dc.subject.keywordautomatic assessment of toolsen
dc.subject.keywordwhite-box testingen
dc.subject.otherComputer scienceen
dc.titleClassifying and recognizing students' sorting algorithm implementations in a data structures and algorithms courseen
dc.typeD4 Julkaistu kehittämis- tai tutkimusraportti tai -selvitysfi
dc.type.dcmitypetexten
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
taherkhani_ahmad_ST_4_2012.pdf
Size:
211.44 KB
Format:
Adobe Portable Document Format