Implementation of Split Deadlines in a Large CS1 Course

• URL: http://arxiv.org/abs/2608.06753v1
• Date: Fri, 07 Aug 2026 03:19:09 GMT
• Title: Implementation of Split Deadlines in a Large CS1 Course
• Abstract summary: A large computer science course implemented a split deadlines policy.<n>Students were divided into two groups with staggered release and due dates.<n>Overall we found that the split deadline policy increased office hour efficiency, resulted in no significant difference in performance between groups, and was considered fair and effective by most students.
• Score: 5.048595941681163
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Office hour utilization in computer science courses can spike near deadlines, producing long wait times, frustrated students, and overworked staff. To address this problem, a large CS1 course implemented a split deadlines policy. Students were randomly divided into two groups with staggered release and due dates. Each group had the same amount of time to complete assignments, but the number of students with each due date was reduced by half. Our study evaluates the effectiveness of this policy. We measure office hour utilization and staff efficiency near deadlines, examine the policy's impact on student performance, and investigate student perception of the policy's fairness and effectiveness. Overall we found that the split deadline policy increased office hour efficiency, resulted in no significant difference in performance between groups, and was considered fair and effective by most students. Our experience report includes reflections and student feedback indicating how to implement and further improve similar policies.

Related papers

• Changes in Coding Behavior and Performance Since the Introduction of LLMs [1.7482685917723753]
  We analyze five years of student source code submissions in a graduate-level cloud computing course.<n>Student coding behavior has changed significantly since Fall 2022.
  arXiv  Detail & Related papers  (2026-01-16T23:51:31Z)
• Ungraded Assignments in Introductory Computing: A Report [0.8379286663107844]
  This experience report explores the effects of ungraded assignments on the learning experience of students in an introductory computing course.<n>Our study examines the impact of ungraded assignments on student engagement, understanding, and overall academic performance.
  arXiv  Detail & Related papers  (2025-12-28T17:09:45Z)
• Behaviour Policy Optimization: Provably Lower Variance Return Estimates for Off-Policy Reinforcement Learning [52.97053840476386]
  We show that well-designed behaviour policies can be used to collect off-policy data for provably lower variance return estimates.<n>We extend this key insight to the online reinforcement learning setting, where both policy evaluation and improvement are interleaved.
  arXiv  Detail & Related papers  (2025-11-13T23:06:40Z)
• Learning to Optimize Feedback for One Million Students: Insights from Multi-Armed and Contextual Bandits in Large-Scale Online Tutoring [1.3184846764437286]
  We present an online tutoring system that learns to provide effective feedback to students after they answer questions incorrectly.<n>Using data from one million students, the system learns which assistance action to provide for each question to optimize student learning.<n>We evaluate the resulting MAB policies in 166,000 practice sessions, verifying significant improvements in student outcomes.
  arXiv  Detail & Related papers  (2025-08-01T02:30:29Z)
• Learning Long-Context Diffusion Policies via Past-Token Prediction [48.86967836229684]
  We propose an alternative approach that explicitly regularizes the retention of past information.<n>We introduce Past-Token Prediction, an auxiliary task in which the policy learns to predict past action tokens alongside future ones.<n> Experiments across four real-world and six simulated tasks demonstrate that our proposed method improves the performance of long-context diffusion policies by 3x and accelerates policy training by more than 10x.
  arXiv  Detail & Related papers  (2025-05-14T17:00:47Z)
• Bidirectional Decoding: Improving Action Chunking via Guided Test-Time Sampling [51.38330727868982]
  We show how action chunking impacts the divergence between a learner and a demonstrator.<n>We propose Bidirectional Decoding (BID), a test-time inference algorithm that bridges action chunking with closed-loop adaptation.<n>Our method boosts the performance of two state-of-the-art generative policies across seven simulation benchmarks and two real-world tasks.
  arXiv  Detail & Related papers  (2024-08-30T15:39:34Z)
• Reduced-Rank Multi-objective Policy Learning and Optimization [57.978477569678844]
  In practice, causal researchers do not have a single outcome in mind a priori. In government-assisted social benefit programs, policymakers collect many outcomes to understand the multidimensional nature of poverty. We present a data-driven dimensionality-reduction methodology for multiple outcomes in the context of optimal policy learning.
  arXiv  Detail & Related papers  (2024-04-29T08:16:30Z)
• Does Starting Deep Learning Homework Earlier Improve Grades? [63.20583929886827]
  Students who start a homework assignment earlier and spend more time on it should receive better grades on the assignment. Existing literature on the impact of time spent on homework is not clear-cut and comes mostly from K-12 education. We develop a hierarchical Bayesian model to help make principled conclusions about the impact on student success.
  arXiv  Detail & Related papers  (2023-09-30T09:34:30Z)
• Fair and skill-diverse student group formation via constrained k-way graph partitioning [65.29889537564455]
  This work introduces an unsupervised algorithm for fair and skill-diverse student group formation. The skill sets of students are determined using unsupervised dimensionality reduction of course mark data via the Laplacian eigenmap. The problem is formulated as a constrained graph partitioning problem, whereby the diversity of skill sets in each group are maximised.
  arXiv  Detail & Related papers  (2023-01-12T14:02:49Z)
• Quantifying the relationship between student enrollment patterns and student performance [0.0]
  It is not uncommon for students to alternate between full-time and part-time enrollment each semester based on finances, scheduling, or family needs. While prior research has established full-time students maintain better outcomes then their part-time counterparts, limited study has examined the impact of enrollment patterns or strategies on academic outcomes. Analysis of data collected from the University of Central Florida from 2008 to 2017 indicates that first-time-in-college students that apply a mixed enrollment strategy are closer in performance to full-time students.
  arXiv  Detail & Related papers  (2020-03-22T02:29:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.