Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3304221.3325553acmconferencesArticle/Chapter ViewAbstractPublication PagesiticseConference Proceedingsconference-collections
poster

Insights from using Supplemental Instruction (SI) in Data Structures Course to Increase Retention

Published: 02 July 2019 Publication History

Abstract

Data Structures (CS 242) ranks as one of the most challenging courses in our core curriculum. It has the steepest learning curve for our students and has the lowest retention rate. Students find it challenging to master the mathematical concepts, learn the data structures and apply them in large programs. Three years ago, the department decided to offer Supplemental Instruction (SI) in CS 242 and in Discrete Structures (CS 225), a co-requisite for CS 242, in the hope of increasing retention in CS 242. In this poster, the author shares experiences with the SI approach, and the results of a student survey to assess the efficacy of SI in both these courses.

References

[1]
S. Loos, S. Menzel and M. Poparad, (2005), Three Perspectives on peer tutoring for CS1, Proceedings of the Midwest Celebration of Women in Computing Conference, https://cgi.sice.indiana.edu/~midwic/papers/uploads/loos.pdf
[2]
https://info.umkc.edu/si/
[3]
C. Murphy, R. Powell, K, Parton and A. Cannon (2011), Lessons Learned from a PLTL-CS Program, SIGCSE'11, March 9--12, Dallas, Texas, USA, pp 207--212.
[4]
J. Cottam, S. Menzel, and J. Greenblatt, (2011) Tutoring for Retention, SIGCSE'11, March 9--12, Dallas, Texas, USA, pp 213--218.

Cited By

View all
  • (2022)BlockList: A Game to Teach Basic Linked Lists Operations To Novice ProgrammersProceedings of the 15th Annual ACM India Compute Conference10.1145/3561833.3561844(35-40)Online publication date: 9-Nov-2022

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ITiCSE '19: Proceedings of the 2019 ACM Conference on Innovation and Technology in Computer Science Education
July 2019
583 pages
ISBN:9781450368957
DOI:10.1145/3304221
Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 July 2019

Check for updates

Author Tags

  1. curriculum issues
  2. data structures
  3. instruction
  4. pedagogy
  5. student engagement
  6. student retention

Qualifiers

  • Poster

Conference

ITiCSE '19
Sponsor:

Acceptance Rates

Overall Acceptance Rate 552 of 1,613 submissions, 34%

Upcoming Conference

ITiCSE '25
Innovation and Technology in Computer Science Education
June 27 - July 2, 2025
Nijmegen , Netherlands

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)BlockList: A Game to Teach Basic Linked Lists Operations To Novice ProgrammersProceedings of the 15th Annual ACM India Compute Conference10.1145/3561833.3561844(35-40)Online publication date: 9-Nov-2022

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media