Who does what? Work division and allocation strategies of computer science student teams

• URL: http://arxiv.org/abs/2103.09048v1
• Date: Thu, 4 Mar 2021 12:27:07 GMT
• Title: Who does what? Work division and allocation strategies of computer science student teams
• Authors: Anna van der Meulen, Efthimia Aivaloglou
• Abstract summary: 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.
• Score: 5.863264019032882
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Collaboration skills are important for future software engineers. In computer science education, these skills are often practiced through group assignments, where students develop software collaboratively. The approach that students take in these assignments varies widely, but often involves a division of labour. It can then be argued whether collaboration still takes place. The discipline of computing education is especially interesting in this context, because some of its specific features (such as the variation in entry skill level and the use of source code repositories as collaboration platforms) are likely to influence the approach taken within groupwork. The aim of this research is to gain insight into the work division and allocation strategies applied by computer science students during group assignments. To this end, we interviewed twenty students of four universities. The thematic analysis shows that students tend to divide up the workload to enable working independently, with pair programming and code reviews being often employed. Motivated primarily by grade and efficiency factors, students choose and allocate tasks primarily 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, and that interventions are needed towards encouraging experimentation and learning.

Related papers

• Decentralized and Lifelong-Adaptive Multi-Agent Collaborative Learning [57.652899266553035]
  Decentralized and lifelong-adaptive multi-agent collaborative learning aims to enhance collaboration among multiple agents without a central server. We propose DeLAMA, a decentralized multi-agent lifelong collaborative learning algorithm with dynamic collaboration graphs.
  arXiv  Detail & Related papers  (2024-03-11T09:21:11Z)
• CLGT: A Graph Transformer for Student Performance Prediction in Collaborative Learning [6.140954034246379]
  We present an extended graph transformer framework for collaborative learning (CLGT) for evaluating and predicting the performance of students. The experimental results confirm that the proposed CLGT outperforms the baseline models in terms of performing predictions based on the real-world datasets.
  arXiv  Detail & Related papers  (2023-07-30T09:54:30Z)
• Team Composition in Software Engineering Education [0.5439020425819]
  The study presented in this paper aims to better understand the student team composition in software engineering education. The initial findings of the ongoing Action research study are presented.
  arXiv  Detail & Related papers  (2023-06-14T11:00:05Z)
• Detecting and Optimising Team Interactions in Software Development [58.720142291102135]
  This paper presents a data-driven approach to detect the functional interaction structure for software development teams. Our approach considers differences in the activity levels of team members and uses a block-constrained configuration model. We show how our approach enables teams to compare their functional interaction structure against synthetically created benchmark scenarios.
  arXiv  Detail & Related papers  (2023-02-28T14:53:29Z)
• 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)
• Identifying Different Student Clusters in Functional Programming Assignments: From Quick Learners to Struggling Students [2.0386745041807033]
  We analyze student assignment submission data collected from a functional programming course taught at McGill university. This allows us to identify four clusters of students: "Quick-learning", "Hardworking", "Satisficing", and "Struggling" We then analyze how work habits, working duration, the range of errors, and the ability to fix errors impact different clusters of students.
  arXiv  Detail & Related papers  (2023-01-06T17:15:58Z)
• Autonomous Open-Ended Learning of Tasks with Non-Stationary Interdependencies [64.0476282000118]
  Intrinsic motivations have proven to generate a task-agnostic signal to properly allocate the training time amongst goals. While the majority of works in the field of intrinsically motivated open-ended learning focus on scenarios where goals are independent from each other, only few of them studied the autonomous acquisition of interdependent tasks. In particular, we first deepen the analysis of a previous system, showing the importance of incorporating information about the relationships between tasks at a higher level of the architecture. Then we introduce H-GRAIL, a new system that extends the previous one by adding a new learning layer to store the autonomously acquired sequences
  arXiv  Detail & Related papers  (2022-05-16T10:43:01Z)
• The Impact of Remote Pair Programming in an Upper-Level CS Course [0.0]
  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.
  arXiv  Detail & Related papers  (2022-04-06T20:01:01Z)
• 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)
• Towards Explainable Student Group Collaboration Assessment Models Using Temporal Representations of Individual Student Roles [12.945344702592557]
  We propose using simple temporal-CNN deep-learning models to assess student group collaboration. We check the applicability of dynamically changing feature representations for student group collaboration assessment. We also use Grad-CAM visualizations to better understand and interpret the important temporal indices that led to the deep-learning model's decision.
  arXiv  Detail & Related papers  (2021-06-17T16:00:08Z)
• CausalWorld: A Robotic Manipulation Benchmark for Causal Structure and Transfer Learning [138.40338621974954]
  CausalWorld is a benchmark for causal structure and transfer learning in a robotic manipulation environment. Tasks consist of constructing 3D shapes from a given set of blocks - inspired by how children learn to build complex structures.
  arXiv  Detail & Related papers  (2020-10-08T23:01:13Z)

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.