Planning on Paper: Problem Decomposition with Diagrams in Introductory Computing

• URL: http://arxiv.org/abs/2606.12427v1
• Date: Thu, 14 May 2026 19:27:02 GMT
• Title: Planning on Paper: Problem Decomposition with Diagrams in Introductory Computing
• Abstract summary: Problem decomposition is a core concern of computing education.<n>Many CS1 educators are advocating for shifting instructional emphasis away from code writing.<n>There is a lack of knowledge in how novices do decomposition in large, multifunction tasks.
• Score: 3.0773704200707233
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Background and Context. Problem decomposition is a core concern of computing education. It has also become increasingly relevant: in response to GenAI, many CS1 educators are advocating for shifting instructional emphasis away from code writing and towards decomposition and higher-level planning. Currently, there is a lack of knowledge in how novices do decomposition in large, multifunction tasks. Objectives. In this study, we describe how students represent solutions to a decomposition task, and characterize common issues that arise in those representations. Method. In a 50-minute lab, students were given a description of a word game and asked to draw (with pencil and paper) a decomposition diagram for a program that would implement this game. We performed an inductive thematic analysis with negotiated agreement on 55 of the diagrams, coding salient elements (e.g. functions and the relationships between them) and issues that arose. Findings. Students used multiple representational strategies, including hierarchical function calls and sequencing (order of execution). We identified issues in notation (including use of differing, incompatible notations within the same diagram), order of execution, abstraction and reuse, encapsulation, clarity, and problem-specific misunderstandings. Implications. These findings suggest that novice decomposition is shaped by multiple underlying models of program behavior, with tensions between structural and sequence-focused reasoning. We discuss implications for decomposition instruction and future work, including clarifying representational constraints and plan tracing as simulation.

Related papers

• Is your algorithm unlearning or untraining? [57.25293122855155]
  We argue that the term unlearning'' has been overloaded, with different research efforts spanning two distinct problem formulations.<n>We identify two notions that we identify as unlearning and untraining, illustrated in Figure 1.<n>We discuss technical definitions of these problems and map problem settings studied in the literature to each.
  arXiv  Detail & Related papers  (2026-04-09T08:24:52Z)
• Moving Pictures of Thought: Extracting Visual Knowledge in Charles S. Peirce's Manuscripts with Vision-Language Models [0.5352699766206808]
  Diagrams are crucial yet underexplored tools in many disciplines.<n>Their iconic form poses obstacles to visual studies, intermedial analysis, and text-based digital captions.<n>Visual Language Models (VLMs) can help us identify and interpret such hybrid pages in context.
  arXiv  Detail & Related papers  (2025-11-17T13:52:23Z)
• Assessing Problem Decomposition in CS1 for the GenAI Era [0.32622301272834514]
  This paper details the development of questions to assess the skill of problem decomposition.<n>A challenge unique to problem decomposition questions is their necessarily lengthy context.<n>We describe the use of open-ended drawing of decomposition diagrams as another form of assessment.
  arXiv  Detail & Related papers  (2025-11-07T23:21:27Z)
• Explain with Visual Keypoints Like a Real Mentor! A Benchmark for Multimodal Solution Explanation [19.4261670152456]
  We introduce the multimodal solution explanation task, designed to evaluate whether models can identify visual keypoints, such as auxiliary lines, points, angles, and generate explanations that incorporate these key elements essential for understanding.<n>Our empirical results show that, aside from recent large-scale open-source and closed-source models, most generalist open-source models, and even math-specialist models, struggle with the multimodal solution explanation task.<n>This highlights a significant gap in current LLMs' ability to reason and explain with visual grounding in educational contexts.
  arXiv  Detail & Related papers  (2025-04-04T06:03:13Z)
• Contextualize-then-Aggregate: Circuits for In-Context Learning in Gemma-2 2B [51.74607395697567]
  In-Context Learning (ICL) is an intriguing ability of large language models (LLMs)<n>We use causal interventions to identify information flow in Gemma-2 2B for five naturalistic ICL tasks.<n>We find that the model infers task information using a two-step strategy we call contextualize-then-aggregate.
  arXiv  Detail & Related papers  (2025-03-31T18:33:55Z)
• Shedding Light in Task Decomposition in Program Synthesis: The Driving Force of the Synthesizer Model [2.355460994057843]
  Task decomposition is a fundamental mechanism in program synthesis, enabling complex problems to be broken down into manageable subtasks.<n>In this work, we develop REGISM, an adaptation of ExeDec that removes decomposition guidance and relies solely on iterative execution-driven synthesis.<n>Our findings indicate that ExeDec exhibits significant advantages in length generalization and concept composition tasks, likely due to its explicit decomposition strategies.
  arXiv  Detail & Related papers  (2025-03-11T06:30:49Z)
• Reasoning with Graphs: Structuring Implicit Knowledge to Enhance LLMs Reasoning [73.2950349728376]
  Large language models (LLMs) have demonstrated remarkable success across a wide range of tasks.<n>However, they still encounter challenges in reasoning tasks that require understanding and inferring relationships between pieces of information.<n>This challenge is particularly pronounced in tasks involving multi-step processes, such as logical reasoning and multi-hop question answering.<n>We propose Reasoning with Graphs (RwG) by first constructing explicit graphs from the context.
  arXiv  Detail & Related papers  (2025-01-14T05:18:20Z)
• Faith and Fate: Limits of Transformers on Compositionality [109.79516190693415]
  We investigate the limits of transformer large language models across three representative compositional tasks. These tasks require breaking problems down into sub-steps and synthesizing these steps into a precise answer. Our empirical findings suggest that transformer LLMs solve compositional tasks by reducing multi-step compositional reasoning into linearized subgraph matching.
  arXiv  Detail & Related papers  (2023-05-29T23:24:14Z)
• Binary Diffing as a Network Alignment Problem via Belief Propagation [0.0]
  We introduce a new formulation of this problem as a particular instance of a graph edit problem over the call graphs of the programs. We show that this formulation is equivalent to a network alignment problem. We implement a prototype of our method, called QBinDiff, and propose an extensive evaluation which shows that our approach outperforms state of the art diffing tools.
  arXiv  Detail & Related papers  (2021-12-31T07:54:11Z)
• Video as Conditional Graph Hierarchy for Multi-Granular Question Answering [80.94367625007352]
  We argue that while video is presented in frame sequence, the visual elements are not sequential but rather hierarchical in semantic space. We propose to model video as a conditional graph hierarchy which weaves together visual facts of different granularity in a level-wise manner.
  arXiv  Detail & Related papers  (2021-12-12T10:35:19Z)
• Hierarchical Bayesian Bandits [51.67132887113412]
  We analyze a natural hierarchical Thompson sampling algorithm (hierTS) that can be applied to any problem in this class. Our regret bounds hold under many instances of such problems, including when the tasks are solved sequentially or in parallel. Experiments show that the hierarchical structure helps with knowledge sharing among the tasks.
  arXiv  Detail & Related papers  (2021-11-12T20:33:09Z)
• Encoding Compositionality in Classical Planning Solutions [0.8122270502556374]
  It is desirable to encode the trace of literals throughout the plan to capture the dependencies between actions selected. The approach of this paper is to view the actions as maps between literals and the selected plan as a composition of those maps.
  arXiv  Detail & Related papers  (2021-07-13T05:05:11Z)

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.