View in EDS

BTRecurTutor: A Tutorial for Practicing Recursion in Binary Trees

Saved in:
Bibliographic Details
Title: BTRecurTutor: A Tutorial for Practicing Recursion in Binary Trees
Language: English
Authors: Hamouda, Sally, Edwards, Stephen H., Elmongui, Hicham G. (ORCID 0000-0001-5947-7450), Ernst, Jeremy V., Shaffer, Clifford A.
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
FullText Text:
  Availability: 0
Header DbId: eric
DbLabel: ERIC
An: EJ1261190
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: BTRecurTutor: A Tutorial for Practicing Recursion in Binary Trees
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Hamouda%2C+Sally%22">Hamouda, Sally</searchLink><br /><searchLink fieldCode="AR" term="%22Edwards%2C+Stephen+H%2E%22">Edwards, Stephen H.</searchLink><br /><searchLink fieldCode="AR" term="%22Elmongui%2C+Hicham+G%2E%22">Elmongui, Hicham G.</searchLink> (ORCID <externalLink term="http://orcid.org/0000-0001-5947-7450">0000-0001-5947-7450</externalLink>)<br /><searchLink fieldCode="AR" term="%22Ernst%2C+Jeremy+V%2E%22">Ernst, Jeremy V.</searchLink><br /><searchLink fieldCode="AR" term="%22Shaffer%2C+Clifford+A%2E%22">Shaffer, Clifford A.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="SO" term="%22Computer+Science+Education%22"><i>Computer Science Education</i></searchLink>. 2020 30(2):216-248.
– Name: Avail
  Label: Availability
  Group: Avail
  Data: 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
– Name: PeerReviewed
  Label: Peer Reviewed
  Group: SrcInfo
  Data: Y
– Name: Pages
  Label: Page Count
  Group: Src
  Data: 33
– Name: DatePubCY
  Label: Publication Date
  Group: Date
  Data: 2020
– Name: SourceSuprt
  Label: Sponsoring Agency
  Group: SrcSuprt
  Data: National Science Foundation (NSF)
– Name: NumberContract
  Label: Contract Number
  Group: NumCntrct
  Data: DUE0836940<br />DUE0937863<br />DUE0840719
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: Journal Articles<br />Reports - Research
– Name: Audience
  Label: Education Level
  Group: Audnce
  Data: <searchLink fieldCode="EL" term="%22Higher+Education%22">Higher Education</searchLink><br /><searchLink fieldCode="EL" term="%22Postsecondary+Education%22">Postsecondary Education</searchLink>
– Name: Subject
  Label: Descriptors
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Computer+Science+Education%22">Computer Science Education</searchLink><br /><searchLink fieldCode="DE" term="%22Programming%22">Programming</searchLink><br /><searchLink fieldCode="DE" term="%22Coding%22">Coding</searchLink><br /><searchLink fieldCode="DE" term="%22Student+Attitudes%22">Student Attitudes</searchLink><br /><searchLink fieldCode="DE" term="%22Misconceptions%22">Misconceptions</searchLink><br /><searchLink fieldCode="DE" term="%22Tutorial+Programs%22">Tutorial Programs</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Feedback+%28Response%29%22">Feedback (Response)</searchLink><br /><searchLink fieldCode="DE" term="%22Instructional+Effectiveness%22">Instructional Effectiveness</searchLink><br /><searchLink fieldCode="DE" term="%22Student+Improvement%22">Student Improvement</searchLink><br /><searchLink fieldCode="DE" term="%22Programmed+Tutoring%22">Programmed Tutoring</searchLink><br /><searchLink fieldCode="DE" term="%22Difficulty+Level%22">Difficulty Level</searchLink><br /><searchLink fieldCode="DE" term="%22Performance+Factors%22">Performance Factors</searchLink><br /><searchLink fieldCode="DE" term="%22College+Students%22">College Students</searchLink>
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.1080/08993408.2020.1714533
– Name: ISSN
  Label: ISSN
  Group: ISSN
  Data: 0899-3408
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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.
– Name: AbstractInfo
  Label: Abstractor
  Group: Ab
  Data: As Provided
– Name: DateEntry
  Label: Entry Date
  Group: Date
  Data: 2020
– Name: AN
  Label: Accession Number
  Group: ID
  Data: EJ1261190
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=eric&AN=EJ1261190
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/08993408.2020.1714533
    Languages:
      – Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 33
        StartPage: 216
    Subjects:
      – SubjectFull: Computer Science Education
        Type: general
      – SubjectFull: Programming
        Type: general
      – SubjectFull: Coding
        Type: general
      – SubjectFull: Student Attitudes
        Type: general
      – SubjectFull: Misconceptions
        Type: general
      – SubjectFull: Tutorial Programs
        Type: general
      – SubjectFull: Semantics
        Type: general
      – SubjectFull: Feedback (Response)
        Type: general
      – SubjectFull: Instructional Effectiveness
        Type: general
      – SubjectFull: Student Improvement
        Type: general
      – SubjectFull: Programmed Tutoring
        Type: general
      – SubjectFull: Difficulty Level
        Type: general
      – SubjectFull: Performance Factors
        Type: general
      – SubjectFull: College Students
        Type: general
    Titles:
      – TitleFull: BTRecurTutor: A Tutorial for Practicing Recursion in Binary Trees
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Hamouda, Sally
      – PersonEntity:
          Name:
            NameFull: Edwards, Stephen H.
      – PersonEntity:
          Name:
            NameFull: Elmongui, Hicham G.
      – PersonEntity:
          Name:
            NameFull: Ernst, Jeremy V.
      – PersonEntity:
          Name:
            NameFull: Shaffer, Clifford A.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2020
          Identifiers:
            – Type: issn-print
              Value: 0899-3408
          Numbering:
            – Type: volume
              Value: 30
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Computer Science Education
              Type: main
ResultId 1