2025 ASEE Annual Conference & Exposition

An analysis on the effectiveness of randomized, auto-graded activities in introductory programming courses

Presented at Computers in Education Division (COED) Track 3.D

Introductory programming courses are often overwhelming to students who have no prior coding experience. The design of an introductory programming course (CS1) can influence a student's choice of pursuing computer science in their career. Research shows that breaking down programming concepts to simpler and smaller pieces decreases the cognitive load and struggle for students thereby increasing student interest and retention.

This paper analyzes data from four online, interactive introductory programming textbooks (C, C++, Java, and Python) with activities that use a scaffolded approach to teach students programming concepts. The textbooks cover a variety of programming concepts from basic topics such as variables and branches to more advanced concepts such as recursion, across multiple languages. The textbooks have a series of randomized, auto-graded activities presented in a multi-level format, where each level is progressively harder than the previous. The activities are designed as code reading or code writing exercises to assess students' mastery to read and write code.

We analyzed over 726 such activities with 2179 levels attempted by 107,825 students across 572 universities. We study the average completion rate, the average time spent on an activity, and the average number of attempts per problem level. We further examined the study trends for how often students repeated completed activities for practice. The data validates the effectiveness of a scaffolding approach, and shows the effectiveness of randomized, auto-graded activities to teach programming concepts.

Authors
  1. Jamie Emily Loeber zyBooks, A Wiley Brand [biography]
  2. Ms. Efthymia Kazakou zyBooks, A Wiley Brand [biography]
  3. Dr. Yamuna Rajasekhar zyBooks, A Wiley Brand [biography]
  4. Dr. Annie Hui zyBooks, A Wiley Brand [biography]
Note

The full paper will be available to logged in and registered conference attendees once the conference starts on June 22, 2025, and to all visitors after the conference ends on June 25, 2025