EASy-DSBuilder: automated assessment of tree data structures in computer science teaching
Pages 220 - 226
Abstract
This paper presents EASy-DSBuilder, an e-assessment tool for assessing fundamental concepts of binary tree data structure operations (i.e. search, insert, and delete operations) taught in Computer Science (CS) lectures. Students can manipulate data structures by adding nodes and freely move them, as well as connect and disconnect nodes within a drag-and-drop interface. At the same time, teachers can easily create new exercises based on their own data structures by uploading their Java implementation. We discuss EASy-DSBuilder's user interface and its general feedback mechanism. We also conducted a user study evaluating EASy-DSBuilder's user interface, visualisation techniques, and overall performance. Both qualitative and quantitative results show that usability is well-liked and learning success is promising.
References
[1]
Computer science curricula 2013. ACM Press and IEEE Computer Society Press, 2013.
[2]
S. Buchanan and J. J. Laviola, Jr. Cstutor: A sketch-based tool for visualizing data structures. ACM Transactions on Computing Education (TOCE), 14(1):3:1--3:28, Mar. 2014.
[3]
J. Cook and V. Jenkins. Getting started with e-assessment. University of Bath, 2010.
[4]
S. Davies. Effective assessment in a digital age. Technical report, JISC, 2010.
[5]
S. Gruttmann, H. Kuchen, and D. Böhm. An e-assessment system for mathematical proofs. In Proceedings of the 11th IASTED International Conference on Computers and Advanced Technologies in Education, Crete 2008, pages 120--125, 2008.
[6]
J. Heywood. Assessment in Higher Education: Student Learning, Teaching, Programmes and Institutions. Number 56 in Higher Education Policy. May 2000.
[7]
M. Krebs, T. Lauer, T. Ottmann, and S. Trahasch. Student-built algorithm visualizations for assessment: flexible generation, feedback and grading. In ACM SIGCSE Bulletin, volume 37, pages 281--285. ACM, 2005.
[8]
M. Laakso, T. Salakoski, A. Korhonen, and L. Malmi. Automatic assessment of exercises for algorithms and data structures--a case study with trakla2. In Proceedings of the 4th Finnish/Baltic Sea Conference on Computer Science Education, pages 28--36, 2004.
[9]
L. Malmi, A. Korhonen, and R. Saikkonen. Experiences in automatic assessment on mass courses and issues for designing virtual courses. volume 34, pages 55--59. ACM, 2002.
[10]
W. McAllister. Data Structures and Algorithms Using Java. Jones & Bartlett Learning, 2010.
[11]
T. L. Naps, G. Rößling, V. Almstrum, et al. Exploring the role of visualization and engagement in computer science education. In ACM SIGCSE Bulletin, volume 35, pages 131--152. ACM, 2002.
[12]
R. P. Pargas and S. Bryfczynski. What were they thinking? In Proceedings of the 14th Annual ACM SIGCSE Conference on Innovation and Technology in Computer Science Education, ITiCSE '09, pages 134--138, New York, NY, USA, 2009. ACM.
[13]
S. S. Sane and N. A. Deshpande. Data Structures And Algorithms. Technical Publications, 2006.
[14]
C. A. Usener, T. A. Majchrzak, and H. Kuchen. E-assessment and software testing. Interactive Technology and Smart Education, 9(1):45--54, 2012.
Index Terms
- EASy-DSBuilder: automated assessment of tree data structures in computer science teaching
Recommendations
Bounding restricted rotation distance
Restricted rotation distance between pairs of rooted binary trees quantifies differences in tree shape. Cleary exhibited a linear upper bound of 12n for the restricted rotation distance between two trees with n interior nodes, and a lower bound of (n - ...
Multidimensional Binary Search Trees in Database Applications
The multidimensional binary search tree (abbreviated k-d tree) is a data structure for storing multikey records. This structure has been used to solve a number of "geometric" problems in statistics and data analysis. The purposes of this paper are to ...
A new method for updating and rebalancing tree-type main memory dictionaries
The most important methods for balancing search trees are periodical rebuilding of the whole tree, which takes Ω(N) time, and rebalancing the tree during each update operation, in O(logN) time. Recently, a new method called relaxed balancing has been ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
April 2015
2418 pages
ISBN:9781450331968
DOI:10.1145/2695664
- Conference Chairs:
- Roger L. Wainwright,
- Juan Manuel Corchado,
- Program Chairs:
- Alessio Bechini,
- Jiman Hong
Copyright © 2015 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 13 April 2015
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SAC 2015
Sponsor:
Acceptance Rates
SAC '15 Paper Acceptance Rate 291 of 1,211 submissions, 24%;
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Upcoming Conference
SAC '25
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 114Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in