Computational Thinking in Practice

This lesson brings together all four pillars of computational thinking — decomposition, abstraction, pattern recognition, and algorithmic thinking — and applies them to real-world problems and exam-style scenarios. Being able to apply these concepts to unfamiliar situations is a key skill for GCSE Computer Science.

---

Applying the Four Pillars Together

When faced with any problem in GCSE Computer Science, you should follow a structured approach:

1. Decompose the problem — break it into smaller sub-problems
2. Recognise patterns — look for similarities with problems you have solved before
3. Abstract — remove unnecessary detail and focus on what matters
4. Design an algorithm — create a step-by-step solution using pseudocode or a flowchart

This approach works for programming tasks, exam questions, and real-world problems.

---

Case Study 1: Building a Student Grade Calculator

Problem: A teacher wants a program that takes a student's marks for five subjects, calculates the average, and assigns a grade.

Step 1: Decomposition

Break the problem into sub-problems:

• Input marks for five subjects
• Validate each mark (must be between 0 and 100)
• Calculate the average mark
• Determine the grade based on the average
• Output the average and grade

Step 2: Pattern Recognition

• Inputting and validating marks follows the same pattern for all five subjects — use a loop
• Assigning a grade based on a value uses the same logic as any grading system — use selection (IF or CASE)
• Calculating an average is a common pattern: sum all values and divide by the count

Step 3: Abstraction

• We do not need to know the student's name, class, or school for this task
• We do not need to store the individual marks if we only need the average — we can use a running total
• The specific subjects do not matter — only the marks

Step 4: Algorithmic Thinking

total ← 0
FOR i ← 1 TO 5
    REPEAT
        OUTPUT "Enter mark for subject " + i + ":"
        INPUT mark
    UNTIL mark >= 0 AND mark <= 100
    total ← total + mark
END FOR
average ← total / 5
IF average >= 70 THEN
    grade ← "A"
ELSE IF average >= 60 THEN
    grade ← "B"
ELSE IF average >= 50 THEN
    grade ← "C"
ELSE IF average >= 40 THEN
    grade ← "D"
ELSE
    grade ← "U"
END IF
OUTPUT "Average: " + average
OUTPUT "Grade: " + grade

---

Case Study 2: Designing a Library Search System

Problem: A school library has a database of 10,000 books. Design a system that allows users to search for a book by title.

Step 1: Decomposition

• Store book records (title, author, ISBN, availability)
• Get the search term from the user
• Search the database for matching titles
• Display the results

Step 2: Pattern Recognition

• Searching a database is similar to searching a list — use a searching algorithm
• If books are stored alphabetically by title, we can use binary search
• If not sorted, we need linear search

Step 3: Abstraction

• For the search, we only need the book title — the author, ISBN, and availability are not relevant to the search itself (though they will be displayed in results)
• The internal structure of the database (tables, indexes) is abstracted away — we just need a search function

Step 4: Algorithmic Thinking

OUTPUT "Enter the book title to search for:"
INPUT searchTitle
searchTitle ← UPPER(searchTitle)
found ← FALSE
FOR i ← 0 TO LENGTH(books) - 1
    IF UPPER(books[i].title) = searchTitle THEN
        OUTPUT "Found: " + books[i].title
        OUTPUT "Author: " + books[i].author
        OUTPUT "Available: " + books[i].isAvailable
        found ← TRUE
    END IF
END FOR
IF found = FALSE THEN
    OUTPUT "No matching books found."
END IF

Exam Tip: In exam scenarios, always explain which pillar you are using and why. For example: "I used decomposition to break the problem into input, processing, and output stages. I used pattern recognition to identify that this is a search problem, similar to linear search."

---

Case Study 3: Planning a Route-Finding Application

Problem: Design an application that finds the shortest route between two locations on a map.

Decomposition

Sub-Problem	Details
Represent the map	Store locations as nodes and roads as edges with distances (a graph)
Get user input	Ask for the start and end locations
Find the shortest route	Apply a shortest-path algorithm
Display the route	Show the sequence of locations and total distance

Pattern Recognition

• This problem is a graph traversal problem — similar to network routing, GPS navigation, and game pathfinding
• The same type of algorithm (e.g., Dijkstra's algorithm) is used in many applications

Abstraction

• The map is abstracted as a graph — only locations (nodes) and connections (edges with weights) matter
• Details like road colour, terrain type, and scenery are removed
• Only distance (or time) is kept as the edge weight

Algorithmic Thinking

At GCSE level, you would not be expected to implement Dijkstra's algorithm, but you should be able to describe the approach: systematically explore routes, keeping track of the shortest distance found so far, until you reach the destination.

---

Exam-Style Practice

Decision tree for tackling an exam question

graph TD
    A["Read exam question"] --> B{"Can it be split<br/>into sub-tasks?"}
    B -->|Yes| C["Decompose"]
    B -->|No| D["Treat as a single problem"]
    C --> E{"Have I seen<br/>a similar problem?"}
    D --> E
    E -->|Yes| F["Apply pattern recognition"]
    E -->|No| G["Identify a new approach"]
    F --> H["Abstract away irrelevant detail"]
    G --> H
    H --> I["Design algorithm<br/>(pseudocode/flowchart)"]
    I --> J["Trace and check edge cases"]

Question 1

A school wants to create a program to manage student attendance. Describe how you would use computational thinking to approach this problem.

Model Answer:

• Decomposition: Break the problem into sub-problems — recording attendance each day, storing data in a database, calculating attendance percentages, generating reports, flagging students below a threshold
• Pattern Recognition: Recording attendance is the same process each day for each class — use a loop. The percentage calculation is the same for every student
• Abstraction: Focus on student ID, date, and present/absent status. Ignore irrelevant details like what the student was wearing or which seat they sat in
• Algorithmic Thinking: Design algorithms for marking attendance, calculating percentages, and generating reports

Question 2

Explain the difference between abstraction and decomposition, using the example of designing an online shopping system.

Model Answer:

• Decomposition means breaking the system into sub-problems: user registration, product browsing, adding items to basket, checkout and payment, order tracking. Each sub-problem is dealt with separately.
• Abstraction means focusing on relevant details and removing unnecessary ones. For example, when modelling a product, we need the name, price, and stock level — but not the factory where it was made or the colour of the warehouse shelf it sits on.

---

Common Exam Mistakes to Avoid

Mistake	Correction
Confusing abstraction with decomposition	Abstraction = removing detail; Decomposition = breaking into parts
Not giving specific examples	Always relate your answer to the scenario in the question
Writing vague algorithms	Be precise — use pseudocode with clear variables and logic
Forgetting to validate inputs	Always consider what happens with invalid or unexpected inputs
Not considering efficiency	Mention which algorithm is more suitable for large vs small datasets

---

Bringing It All Together