BTRecurTutor: A Tutorial for Practicing Recursion in Binary Trees
Saved in:
| Title: | BTRecurTutor: A Tutorial for Practicing Recursion in Binary Trees |
|---|---|
| Language: | English |
| Authors: | Hamouda, Sally, Edwards, Stephen H., Elmongui, Hicham G. (ORCID |
| Source: | Computer Science Education. 2020 30(2):216-248. |
| Availability: | Routledge. Available from: Taylor & Francis, Ltd. 530 Walnut Street Suite 850, Philadelphia, PA 19106. Tel: 800-354-1420; Tel: 215-625-8900; Fax: 215-207-0050; Web site: http://www.tandf.co.uk/journals |
| Peer Reviewed: | Y |
| Page Count: | 33 |
| Publication Date: | 2020 |
| Sponsoring Agency: | National Science Foundation (NSF) |
| Contract Number: | DUE0836940 DUE0937863 DUE0840719 |
| Document Type: | Journal Articles Reports - Research |
| Education Level: | Higher Education Postsecondary Education |
| Descriptors: | Computer Science Education, Programming, Coding, Student Attitudes, Misconceptions, Tutorial Programs, Semantics, Feedback (Response), Instructional Effectiveness, Student Improvement, Programmed Tutoring, Difficulty Level, Performance Factors, College Students |
| DOI: | 10.1080/08993408.2020.1714533 |
| ISSN: | 0899-3408 |
| Abstract: | Background and Context: Recursion in binary trees has proven to be a hard topic. There was not much research on enhancing student understanding of this topic. Objective: We present a tutorial to enhance learning through practice of recursive operations in binary trees, as it is typically taught post-CS2. Method: 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. Findings: 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. Implications: 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. |
| Abstractor: | As Provided |
| Entry Date: | 2020 |
| Accession Number: | EJ1261190 |
| Database: | ERIC |
| Abstract: | Background and Context: Recursion in binary trees has proven to be a hard topic. There was not much research on enhancing student understanding of this topic. Objective: We present a tutorial to enhance learning through practice of recursive operations in binary trees, as it is typically taught post-CS2. Method: 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. Findings: 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. Implications: 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. |
|---|---|
| ISSN: | 0899-3408 |
| DOI: | 10.1080/08993408.2020.1714533 |
