Algorithmic Thinking Flashcards

1️⃣ Familiarise yourself with the flashcards:

  • Look through all the flashcards to see what's on both sides.
  • Make sure you understand the information on each card. If something's unclear, click the link to the revision notes at the bottom of the page for more details.

2️⃣ Test yourself:

  • Look at the question or prompt on each card and try to remember the answer before flipping it over.
  • Check the answer and make a note of any cards you find challenging and need to go over more.

3️⃣ Consistently Review and Practice:

  • Use spaced repetition: spend more time on the cards you struggle with and go over them more often.
  • Regularly review all the flashcards to help you better understand and retain the information over time.

Note: We may include questions that have multiple correct answers. It's useful to remember specific examples to understand these concepts better.

PERSONALISED 1-TO-1 TUTORING

Need more help on this topic? Get 1-to-1 support

Get support with clear explanations, practice and feedback (Ages 5 to 16).

  • DBS-checked tutors
  • Flexible times
  • Parents can be updated

Want an ad-free experience? Subscribe to remove ads

What is an algorithm?

A step-by-step set of rules to solve a problem or do a task.

What is algorithmic thinking?

Thinking clearly to break problems into steps a computer can follow.

Why plan an algorithm before writing code?

It helps you plan, spot mistakes early, and choose clear steps.

What does sequence mean in algorithms?

Doing steps in the correct order, one after another.

What does selection mean in algorithms?

Choosing between paths using a condition, like IF something is true.

What does iteration mean in algorithms?

Repeating steps, often with a loop, until a goal is met.

What is decomposition in algorithmic thinking?

Breaking a big problem into smaller, easier parts.

What is abstraction in algorithmic thinking?

Ignoring unneeded detail and keeping only what matters for the task.

What are inputs and outputs in an algorithm?

Inputs are data you put in; outputs are results you get out.

How do you test an algorithm without a computer?

Do a dry run by hand with sample inputs and check the outputs.

How is an algorithm different from a program?

An algorithm is the plan; a program is the code that follows it.