Journal
COMPUTER SCIENCE EDUCATION
Volume 30, Issue 2, Pages 216-248Publisher
ROUTLEDGE JOURNALS, TAYLOR & FRANCIS LTD
DOI: 10.1080/08993408.2020.1714533
Keywords
Recursion; binary Trees; auto-graded Exercises; misconceptions
Categories
Funding
- National Science Foundation [DUE-0836940, DUE-0937863, DUE-0840719]
- VT-MENA
Ask authors/readers for more resources
Recursion in binary trees has proven to be a hard topic. There was not much research on enhancing student understanding of this topic. We present a tutorial to enhance learning through practice of recursive operations in binary trees, as it is typically taught post-CS2. We identified the misconceptions students have in recursive operations on binary trees. We designed a code writing exam question to measure those misconceptions. We built a tutorial that trains students on avoiding those misconceptions through the use of a semantic code analyzer that detects misconceptions and provides appropriate feedback. Our results show an improvement in student performance when using the tutorial along with the practice exercises, and even more improvement when the same exercises are used with a semantic code analyzer. The best way to use our tutorial to enhance student performance on advanced recursion is to allow students solving the tutorial exercises with the the semantic feedback.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available