Understanding Learners' Problem-Solving Strategies in Concurrent and Parallel Programming: A Game-Based Approach

• URL: http://arxiv.org/abs/2005.04789v1
• Date: Sun, 10 May 2020 21:29:10 GMT
• Title: Understanding Learners' Problem-Solving Strategies in Concurrent and Parallel Programming: A Game-Based Approach
• Abstract summary: This paper presents our results of using Parallel, an educational game about concurrent and parallel programming. Based on a study of 44 undergraduate students, our research shows that self-efficacy increased significantly after playing the game.
• Score: 5.2998037386426615
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Concurrent and parallel programming (CPP) is an increasingly important subject in Computer Science Education. However, the conceptual shift from sequential programming is notoriously difficult to make. Currently, relatively little research exists on how people learn CPP core concepts. This paper presents our results of using Parallel, an educational game about CPP, focusing on the learners' self-efficacy and how they learn CPP concepts. Based on a study of 44 undergraduate students, our research shows that (a) self-efficacy increased significantly after playing the game; (b) the problem-solving strategies employed by students playing the game can be classified in three main types: trial and error, single-thread, and multi-threaded strategies, and (c) that self-efficacy is correlated with the percentage of time students spend in multithreaded problem-solving.

Related papers

• Hands-on PDC in Undergraduate Computing Education [0.0]
  This paper presents a practical assignment in which students engage directly with the University of Florida's HiPerGator supercomputer.<n>Students navigate batch scheduling, core allocation, and performance tuning, experiences that are rarely accessible at the undergraduate level.
  arXiv  Detail & Related papers  (2026-04-28T16:20:37Z)
• Learning to Share: Selective Memory for Efficient Parallel Agentic Systems [49.78267008828593]
  Agentic systems solve complex tasks by coordinating multiple agents that iteratively reason, invoke tools, and exchange intermediate results.<n>Recent approaches deploy multiple agent teams running in parallel to explore diverse reasoning trajectories.<n>We propose Learning to Share (LTS), a learned shared-memory mechanism for parallel agentic frameworks.
  arXiv  Detail & Related papers  (2026-02-05T18:20:21Z)
• The Right Kind of Help: Evaluating the Effectiveness of Intervention Methods in Elementary-Level Visual Programming [19.887538703101168]
  We present a large-scale study comparing the effectiveness of various intervention methods in elementary programming.<n>Specifically, we compare three intervention methods: code-edit recommendations (Code-Rec), quizzes based on code edits (Code-Quiz), and quizzes based on metacognitive strategies (Plan-Quiz)<n>All intervention methods significantly improved learning performance over the control group while preserving students' problem-solving skills in the post-learning phase.
  arXiv  Detail & Related papers  (2025-12-12T17:22:06Z)
• A Comparative Study of OpenMP Scheduling Algorithm Selection Strategies [4.068270792140994]
  We propose and evaluate learning-based approaches for selecting scheduling algorithms in OpenMP.<n>Our results show that RL methods are capable of learning high-performing scheduling decisions.<n>The approach can also be extended to MPI-based programs, enabling optimization of scheduling decisions across multiple levels of parallelism.
  arXiv  Detail & Related papers  (2025-07-27T15:10:30Z)
• Let Students Take the Wheel: Introducing Post-Quantum Cryptography with Active Learning [4.804847392457553]
  Post-quantum cryptography (PQC) has been identified as the solution to secure existing software systems. This research proposes a novel active learning approach and assesses the best practices for teaching PQC to undergraduate and graduate students.
  arXiv  Detail & Related papers  (2024-10-17T01:52:03Z)
• Machine Learning for the Multi-Dimensional Bin Packing Problem: Literature Review and Empirical Evaluation [52.560375022430236]
  Bin Packing Problem (BPP) is a well-established optimization (CO) problem. In this article, we first formulate BPP, introducing its variants and practical constraints. Then, a comprehensive survey on machine learning for multi-dimensional BPP is provided.
  arXiv  Detail & Related papers  (2023-12-13T12:39:25Z)
• 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)
• NCL++: Nested Collaborative Learning for Long-Tailed Visual Recognition [63.90327120065928]
  We propose a Nested Collaborative Learning (NCL++) which tackles the long-tailed learning problem by a collaborative learning. To achieve the collaborative learning in long-tailed learning, the balanced online distillation is proposed. In order to improve the meticulous distinguishing ability on the confusing categories, we further propose a Hard Category Mining.
  arXiv  Detail & Related papers  (2023-06-29T06:10:40Z)
• UKP-SQuARE: An Interactive Tool for Teaching Question Answering [61.93372227117229]
  The exponential growth of question answering (QA) has made it an indispensable topic in any Natural Language Processing (NLP) course. We introduce UKP-SQuARE as a platform for QA education. Students can run, compare, and analyze various QA models from different perspectives.
  arXiv  Detail & Related papers  (2023-05-31T11:29:04Z)
• Class-Incremental Learning via Knowledge Amalgamation [14.513858688486701]
  Catastrophic forgetting has been a significant problem hindering the deployment of deep learning algorithms in the continual learning setting. We put forward an alternative strategy to handle the catastrophic forgetting with knowledge amalgamation (CFA) CFA learns a student network from multiple heterogeneous teacher models specializing in previous tasks and can be applied to current offline methods.
  arXiv  Detail & Related papers  (2022-09-05T19:49:01Z)
• Understanding Curriculum Learning in Policy Optimization for Online Combinatorial Optimization [66.35750142827898]
  This paper presents the first systematic study on policy optimization methods for online CO problems. We show that online CO problems can be naturally formulated as latent Markov Decision Processes (LMDPs), and prove convergence bounds on natural policy gradient (NPG) Furthermore, our theory explains the benefit of curriculum learning: it can find a strong sampling policy and reduce the distribution shift.
  arXiv  Detail & Related papers  (2022-02-11T03:17:15Z)
• MALib: A Parallel Framework for Population-based Multi-agent Reinforcement Learning [61.28547338576706]
  Population-based multi-agent reinforcement learning (PB-MARL) refers to the series of methods nested with reinforcement learning (RL) algorithms. We present MALib, a scalable and efficient computing framework for PB-MARL.
  arXiv  Detail & Related papers  (2021-06-05T03:27:08Z)
• Adversaries in Online Learning Revisited: with applications in Robust Optimization and Adversarial training [55.30970087795483]
  We revisit the concept of "adversary" in online learning, motivated by solving robust optimization and adversarial training problems. We establish a general approach for a large variety of problem classes using imaginary play.
  arXiv  Detail & Related papers  (2021-01-27T14:23:06Z)
• Multi-Objective Parameter-less Population Pyramid for Solving Industrial Process Planning Problems [3.4389143174241315]
  Evolutionary methods are effective tools for obtaining high-quality results when solving hard practical problems. One of the state-of-the-art methods that employ learning is the. the-less Population Pyramid (P3) Recent research shows that P3 is highly competitive when addressing problems with so-called overlapping blocks.
  arXiv  Detail & Related papers  (2020-09-10T09:40:57Z)
• Algorithms in Multi-Agent Systems: A Holistic Perspective from Reinforcement Learning and Game Theory [2.5147566619221515]
  Deep reinforcement learning has achieved outstanding results in recent years. Recent works are exploring learning beyond single-agent scenarios and considering multi-agent scenarios. Traditional game-theoretic algorithms, which, in turn, show bright application promise combined with modern algorithms and boosting computing power.
  arXiv  Detail & Related papers  (2020-01-17T15:08:04Z)

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.