3.1 Fundamentals of AlgorithmsHigh Exam FrequencyOCR

Computational Thinking

Revise Computational Thinking in 3.1 Fundamentals of Algorithms for GCSE Computer Science with 15 exam-style questions and 8 flashcards. This is a high-frequency exam topic, so students should expect to explain it clearly under timed conditions.

Sample Flashcards

What is abstraction?
Removing unnecessary detail to focus on what's important
What is decomposition?
Breaking a problem into smaller, manageable parts

Exam questions for Computational Thinking

Which computational thinking technique involves breaking a complex problem into smaller, more manageable sub-problems?

  • A. Abstraction
  • B. Decomposition
  • C. Algorithmic thinking
  • D. Pattern recognition
1 markfoundation

A developer is building a school website. Explain how decomposition could be used to help plan and solve this problem. [3 marks]

3 marksstandard

15

exam-style questions

8

revision flashcards

Ready to revise Computational Thinking?

Get personalised daily study plans, adaptive quizzes, and spaced repetition flashcards.

Start revising free