The CTSkills App -- Measuring Problem Decomposition Skills of Students in Computational Thinking

• URL: http://arxiv.org/abs/2411.14945v1
• Date: Fri, 22 Nov 2024 13:57:49 GMT
• Title: The CTSkills App -- Measuring Problem Decomposition Skills of Students in Computational Thinking
• Authors: Dorit Assaf, Giorgia Adorni, Elia Lutz, Lucio Negrini, Alberto Piatti, Francesco Mondada, Francesca Mangili, Luca Maria Gambardella,
• Abstract summary: This paper addresses the incorporation of problem decomposition skills as an important component of computational thinking (CT) in K-12 computer science education. "CTSKills" is a web-based skill assessment tool developed to measure students' problem decomposition skills.
• Score: 2.267572868634791
• License:
• Abstract: This paper addresses the incorporation of problem decomposition skills as an important component of computational thinking (CT) in K-12 computer science (CS) education. Despite the growing integration of CS in schools, there is a lack of consensus on the precise definition of CT in general and decomposition in particular. While decomposition is commonly referred to as the starting point of (computational) problem-solving, algorithmic solution formulation often receives more attention in the classroom, while decomposition remains rather unexplored. This study presents "CTSKills", a web-based skill assessment tool developed to measure students' problem decomposition skills. With the data collected from 75 students in grades 4-9, this research aims to contribute to a baseline of students' decomposition proficiency in compulsory education. Furthermore, a thorough understanding of a given problem is becoming increasingly important with the advancement of generative artificial intelligence (AI) tools that can effectively support the process of formulating algorithms. This study highlights the importance of problem decomposition as a key skill in K-12 CS education to foster more adept problem solvers.

Related papers

• Can We Further Elicit Reasoning in LLMs? Critic-Guided Planning with Retrieval-Augmentation for Solving Challenging Tasks [68.49251303172674]
  State-of-the-art large language models (LLMs) exhibit impressive problem-solving capabilities but may struggle with complex reasoning and factual correctness. Existing methods harness the strengths of chain-of-thought and retrieval-augmented generation (RAG) to decompose a complex problem into simpler steps and apply retrieval to improve factual correctness. We introduce Critic-guided planning with Retrieval-augmentation, CR-Planner, a novel framework that leverages fine-tuned critic models to guide both reasoning and retrieval processes through planning.
  arXiv  Detail & Related papers  (2024-10-02T11:26:02Z)
• Center-Sensitive Kernel Optimization for Efficient On-Device Incremental Learning [88.78080749909665]
  Current on-device training methods just focus on efficient training without considering the catastrophic forgetting. This paper proposes a simple but effective edge-friendly incremental learning framework. Our method achieves average accuracy boost of 38.08% with even less memory and approximate computation.
  arXiv  Detail & Related papers  (2024-06-13T05:49:29Z)
• Incorporating Graph Attention Mechanism into Geometric Problem Solving Based on Deep Reinforcement Learning [14.445184687705094]
  In most instances, problems are addressed by adding auxiliary components such as lines or points. We present deep reinforcement learning framework based on the language model, such as BERT. A novel algorithm, named A3C-RL, is proposed by forcing an agent to select top strategies.
  arXiv  Detail & Related papers  (2024-03-14T11:00:09Z)
• Skills in computational thinking of engineering students of the first school year [0.0]
  The competence in Computational Thinking (CT) is one of the fundamental competences that students must acquire. Measuring and evaluating which of the CT skills students have acquired is fundamental.
  arXiv  Detail & Related papers  (2024-02-06T19:22:31Z)
• On Robust Numerical Solver for ODE via Self-Attention Mechanism [82.95493796476767]
  We explore training efficient and robust AI-enhanced numerical solvers with a small data size by mitigating intrinsic noise disturbances. We first analyze the ability of the self-attention mechanism to regulate noise in supervised learning and then propose a simple-yet-effective numerical solver, Attr, which introduces an additive self-attention mechanism to the numerical solution of differential equations.
  arXiv  Detail & Related papers  (2023-02-05T01:39:21Z)
• Sample-Efficient Reinforcement Learning in the Presence of Exogenous Information [77.19830787312743]
  In real-world reinforcement learning applications the learner's observation space is ubiquitously high-dimensional with both relevant and irrelevant information about the task at hand. We introduce a new problem setting for reinforcement learning, the Exogenous Decision Process (ExoMDP), in which the state space admits an (unknown) factorization into a small controllable component and a large irrelevant component. We provide a new algorithm, ExoRL, which learns a near-optimal policy with sample complexity in the size of the endogenous component.
  arXiv  Detail & Related papers  (2022-06-09T05:19:32Z)
• An Optimization Method-Assisted Ensemble Deep Reinforcement Learning Algorithm to Solve Unit Commitment Problems [3.303380427144773]
  Unit commitment is a fundamental problem in the day-ahead electricity market. It is critical to solve UC problems efficiently. Recent advances in artificial intelligence have demonstrated the capability of reinforcement learning to solve UC problems.
  arXiv  Detail & Related papers  (2022-06-09T03:36:18Z)
• Learning to Detect Critical Nodes in Sparse Graphs via Feature Importance Awareness [53.351863569314794]
  The critical node problem (CNP) aims to find a set of critical nodes from a network whose deletion maximally degrades the pairwise connectivity of the residual network. This work proposes a feature importance-aware graph attention network for node representation. It combines it with dueling double deep Q-network to create an end-to-end algorithm to solve CNP for the first time.
  arXiv  Detail & Related papers  (2021-12-03T14:23:05Z)
• Accelerating Recursive Partition-Based Causal Structure Learning [4.357523892518871]
  Recursive causal discovery algorithms provide good results by using Conditional Independent (CI) tests in smaller sub-problems. This paper proposes a generic causal structure refinement strategy that can locate the undesired relations with a small number of CI-tests. We then empirically evaluate its performance against the state-of-the-art algorithms in terms of solution quality and completion time in synthetic and real datasets.
  arXiv  Detail & Related papers  (2021-02-23T08:28:55Z)
• Do Abstractions Have Politics? Toward a More Critical Algorithm Analysis [19.08810272234958]
  We argue for affordance analysis, a more critical algorithm analysis based on an affordance account of value embedding. We illustrate 5 case studies of how affordance analysis refutes social determination of technology.
  arXiv  Detail & Related papers  (2021-01-04T05:59:26Z)
• Machine Number Sense: A Dataset of Visual Arithmetic Problems for Abstract and Relational Reasoning [95.18337034090648]
  We propose a dataset, Machine Number Sense (MNS), consisting of visual arithmetic problems automatically generated using a grammar model--And-Or Graph (AOG) These visual arithmetic problems are in the form of geometric figures. We benchmark the MNS dataset using four predominant neural network models as baselines in this visual reasoning task.
  arXiv  Detail & Related papers  (2020-04-25T17:14:58Z)

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.