Computer · Part A - the Learner-Facing Foundation · Major topic 3 of 39

Computational Thinking, Problem Solving and Design

The reusable process of transforming a need into a precise, testable solution—before and alongside coding.

130 items insideAsked 3× in the RPSC/RSSB papers we analysed, most recently 2021COM-03

Also look at: Reasoning: Ranking/Arrangement/Problem SolvingPhysics: Computational Physics, Modelling & Scientific ComputingScience & Technology: Scientific Thinking, Literacy and MeasurementScience & Technology: Computers, Digital Literacy and School Computer Education

  1. 1

    Historical evolution — key dates

    • Arithmetic procedures, geometric constructions and mechanical rules embody algorithmic thinking before electronic computers.Ancient to early modern
    • Formal models make precise descriptions of effective procedures central to computation.1936
    • Flowcharts, structured problem solving and algorithm design enter computing practice.1940s-1960s
    • Structured programming and stepwise refinement respond to difficult software maintenance.1968-1970s
    • Object-oriented design, design patterns, iterative methods and human- centred design broaden problem-solving practice.1980s-2000s
    • Computational thinking becomes a K-12 learning objective; data and AI require explicit problem framing and evaluation.2010s-2020s
  2. 2

    Define the problem

    Asked 3× · last 2021

    • User, stakeholder, need, pain point, objective, context, assumptions, constraints, scope, non- goals.
    • Inputs, outputs, transformations, rules, exceptions, success criteria, acceptance criteria.
    • Functional vs non-functional needs; measurable requirement; edge condition; risk
      4 more points
      • Functional vs non-functional needs
      • Measurable requirement
      • Edge condition
      • Risk
  3. 3

    Decomposition

    • Break task into subtasks; sequence dependencies; identify reusable parts; assign interfaces
      4 more points
      • Break task into subtasks
      • Sequence dependencies
      • Identify reusable parts
      • Assign interfaces
    • Top-down refinement; bottom-up composition; functional decomposition; domain decomposition; divide-and-conquer
      5 more points
      • Top-down refinement
      • Bottom-up composition
      • Functional decomposition
      • Domain decomposition
      • Divide-and-conquer
  4. 4

    Pattern recognition and generalization

    • Repetition, regularity, similarity, analogy, classification, feature selection, rule extraction.
    • Identify when two cases share a solution; recognize exceptions; avoid overgeneralization
      3 more points
      • Identify when two cases share a solution
      • Recognize exceptions
      • Avoid overgeneralization
  5. 5

    Abstraction and modelling

    • Essential vs incidental detail; variables; diagrams; tables; state diagrams; entity models; mathematical models
      7 more points
      • Essential vs incidental detail
      • Variables
      • Diagrams
      • Tables
      • State diagrams
      • Entity models
      • Mathematical models
    • Input-process-output model; flowchart; pseudocode; data-flow diagram; UML preview; finite- state model
      6 more points
      • Input-process-output model
      • Flowchart
      • Pseudocode
      • Data-flow diagram
      • UML preview
      • Finite- state model
    • Assumptions and limits; abstraction levels; model validation
      3 more points
      • Assumptions and limits
      • Abstraction levels
      • Model validation
  6. 6

    Algorithm design

    • Sequence; selection; iteration; events; recursion; modularity; parameterization; data choice
      8 more points
      • Sequence
      • Selection
      • Iteration
      • Events
      • Recursion
      • Modularity
      • Parameterization
      • Data choice
    • Exhaustive search; greedy choice; divide-and-conquer; dynamic programming; backtracking; randomized methods
      6 more points
      • Exhaustive search
      • Greedy choice
      • Divide-and-conquer
      • Dynamic programming
      • Backtracking
      • Randomized methods
  7. 7

    Testing and debugging

    • Trace tables; desk checks; example-based tests; boundary cases; invalid input; missing input; overflow; timeout
      8 more points
      • Trace tables
      • Desk checks
      • Example-based tests
      • Boundary cases
      • Invalid input
      • Missing input
      • Overflow
      • Timeout
    • Expected vs actual results; reproducible bug report; hypothesis; minimal failing case; root- cause analysis
      5 more points
      • Expected vs actual results
      • Reproducible bug report
      • Hypothesis
      • Minimal failing case
      • Root- cause analysis
    • Unit, integration, system, acceptance and regression test concepts.
  8. 8

    Evaluate and improve

    • Correctness, time, memory, usability, accessibility, safety, maintainability, energy, fairness and cost.
    • Compare alternatives; evidence-based revision; trade-off table; peer review; retrospective
      5 more points
      • Compare alternatives
      • Evidence-based revision
      • Trade-off table
      • Peer review
      • Retrospective
  9. 9

    Design processes

    • Human-centred design; design thinking; systems thinking; participatory design; rapid prototyping
      5 more points
      • Human-centred design
      • Design thinking
      • Systems thinking
      • Participatory design
      • Rapid prototyping
    • Observe -> define -> ideate -> prototype -> test -> iterate; engineering design cycle; scientific method
      3 more points
      • Observe -> define -> ideate -> prototype -> test -> iterate
      • Engineering design cycle
      • Scientific method
  10. 10

    Visual and unplugged thinking

    • Sorting physical cards; route planning; binary bead patterns; robot-on-grid instructions; condition games; graph paper art
      6 more points
      • Sorting physical cards
      • Route planning
      • Binary bead patterns
      • Robot-on-grid instructions
      • Condition games
      • Graph paper art
    • Blocks, loops, decisions, debugging cards, graph traversal games, data classification activities.
  11. 11

    AI-era problem framing

    • Decide whether AI is needed; baseline non-AI solution; data requirements; target; labels; evaluation metric
      6 more points
      • Decide whether AI is needed
      • Baseline non-AI solution
      • Data requirements
      • Target
      • Labels
      • Evaluation metric
    • Human-in-the-loop; failure consequences; model uncertainty; safety constraints; fallback plan; monitoring
      6 more points
      • Human-in-the-loop
      • Failure consequences
      • Model uncertainty
      • Safety constraints
      • Fallback plan
      • Monitoring