The Impact of Remote Pair Programming in an Upper-Level CS Course

• URL: http://arxiv.org/abs/2204.03066v1
• Date: Wed, 6 Apr 2022 20:01:01 GMT
• Title: The Impact of Remote Pair Programming in an Upper-Level CS Course
• Authors: Zachariah J. Beasley and Ayesha R. Johnson
• Abstract summary: Pair programming has been highlighted as an active learning technique with several benefits to students. This work analyzes the effect of pair programming in an upper-level computer science course.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Pair programming has been highlighted as an active learning technique with several benefits to students, including increasing participation and improving outcomes, particularly for female computer science students. However, most of the literature highlights the effects of pair programming in introductory courses, where students have varied levels of prior programming experience and thus may experience related group issues. This work analyzes the effect of pair programming in an upper-level computer science course, where students have a more consistent background education, particularly in languages learned and best practices in coding. Secondly, the effect of remote pair programming on student outcomes is still an open question and one of increasing importance with the advent of Covid-19. This work utilized split sections with a control and treatment group in a large, public university. In addition to comparing pair programming to individual programming, results were analyzed by modality (remote vs. in person) and by gender, focusing on how pair programming benefits female computer science students in confidence, persistence in the major, and outcomes. We found that pair programming groups scored higher on assignments and exams, that remote pair programming groups performed as well as in person groups, and that female students increased their confidence in asking questions in class and scored 12\% higher in the course when utilizing pair programming.

Related papers

• Evaluating Contextually Personalized Programming Exercises Created with Generative AI [4.046163999707179]
  This article reports on a user study conducted in an elective programming course that included contextually personalized programming exercises created with GPT-4. The results demonstrate that the quality of exercises generated with GPT-4 was generally high. This suggests that AI-generated programming problems can be a worthwhile addition to introductory programming courses.
  arXiv  Detail & Related papers  (2024-06-11T12:59:52Z)
• Enhancing Computer Science Education with Pair Programming and Problem Solving Studios [0.0]
  This study examines the adaptation of the problem-solving studio to computer science education by combining it with pair programming. PSS involves teams of students solving open-ended problems with real-time feedback given by the instructor. PSS uses problems of adjustable difficulty to keep students of all levels engaged and functioning within the zone of proximal development.
  arXiv  Detail & Related papers  (2023-11-03T03:40:55Z)
• Psychological Aspects of Pair Programming [0.0]
  This study aims to gain quantitative and qualitative insights into pair programming. The research's goal is to use the findings to design further studies on pairing with artificial intelligence.
  arXiv  Detail & Related papers  (2023-06-12T20:57:50Z)
• Exploring the Use of ChatGPT as a Tool for Learning and Assessment in Undergraduate Computer Science Curriculum: Opportunities and Challenges [0.3553493344868413]
  This paper addresses the prospects and obstacles associated with utilizing ChatGPT as a tool for learning and assessment in undergraduate Computer Science curriculum. Group B students were given access to ChatGPT and were encouraged to use it to help solve the programming challenges. Results show that students using ChatGPT had an advantage in terms of earned scores, however there were inconsistencies and inaccuracies in the submitted code.
  arXiv  Detail & Related papers  (2023-04-16T21:04:52Z)
• Hierarchical Programmatic Reinforcement Learning via Learning to Compose Programs [58.94569213396991]
  We propose a hierarchical programmatic reinforcement learning framework to produce program policies. By learning to compose programs, our proposed framework can produce program policies that describe out-of-distributionally complex behaviors. The experimental results in the Karel domain show that our proposed framework outperforms baselines.
  arXiv  Detail & Related papers  (2023-01-30T14:50:46Z)
• Learning from Self-Sampled Correct and Partially-Correct Programs [96.66452896657991]
  We propose to let the model perform sampling during training and learn from both self-sampled fully-correct programs and partially-correct programs. We show that our use of self-sampled correct and partially-correct programs can benefit learning and help guide the sampling process. Our proposed method improves the pass@k performance by 3.1% to 12.3% compared to learning from a single reference program with MLE.
  arXiv  Detail & Related papers  (2022-05-28T03:31:07Z)
• Lifelong Learning Metrics [63.8376359764052]
  The DARPA Lifelong Learning Machines (L2M) program seeks to yield advances in artificial intelligence (AI) systems. This document outlines a formalism for constructing and characterizing the performance of agents performing lifelong learning scenarios.
  arXiv  Detail & Related papers  (2022-01-20T16:29:14Z)
• Enforcing Consistency in Weakly Supervised Semantic Parsing [68.2211621631765]
  We explore the use of consistency between the output programs for related inputs to reduce the impact of spurious programs. We find that a more consistent formalism leads to improved model performance even without consistency-based training.
  arXiv  Detail & Related papers  (2021-07-13T03:48:04Z)
• Distributed Deep Learning in Open Collaborations [49.240611132653456]
  We propose a novel algorithmic framework designed specifically for collaborative training. We demonstrate the effectiveness of our approach for SwAV and ALBERT pretraining in realistic conditions and achieve performance comparable to traditional setups at a fraction of the cost.
  arXiv  Detail & Related papers  (2021-06-18T16:23:13Z)
• Who does what? Work division and allocation strategies of computer science student teams [5.863264019032882]
  The aim of this research is to gain insight into the work division and allocation strategies applied by computer science students during group assignments. Motivated primarily by grade and efficiency factors, students choose and allocate tasks based on their prior expertise and preferences. Based on our findings, we argue that the setup of group assignments can limit student motivation for practicing new software engineering skills.
  arXiv  Detail & Related papers  (2021-03-04T12:27:07Z)
• BUSTLE: Bottom-Up Program Synthesis Through Learning-Guided Exploration [72.88493072196094]
  We present a new synthesis approach that leverages learning to guide a bottom-up search over programs. In particular, we train a model to prioritize compositions of intermediate values during search conditioned on a set of input-output examples. We show that the combination of learning and bottom-up search is remarkably effective, even with simple supervised learning approaches.
  arXiv  Detail & Related papers  (2020-07-28T17:46:18Z)

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.