Skip to content
Exit presentation

Computational Thinking Basics

Track quiz

Before the quiz, a quick cheat-sheet of the whole track.

Computational thinking basics: how to turn a big job into exact steps
IdeaWhat to remember
Splitting a big jobDecomposition splits a big job into smaller, named parts.
Spotting the repeatA pattern is a small piece that repeats.
What is an algorithm?An algorithm is an exact list of steps, in order.
Following steps exactlyRun each step exactly as written. See where it breaks.
Testing the tricky caseA rule that works once can fail on another case.
SortingCompare two neighbours. Swap them if the left one is bigger.

You must plan a picnic and do not know where to start. What do you do first?

  • Do it all at once, in any order.
  • Split it into named parts, like food and games.
  • Wait for someone else to plan it.

The beads go circle, circle, diamond, circle, circle, diamond, circle, circle. What comes next?

  • Circle
  • Diamond
  • Square

Is an algorithm only for computers?

  • Yes. Only a computer can run one.
  • No. Any exact list of steps, in order, is one.
  • Only if it uses numbers.

A robot runs its five steps. Step 3 hits a box. What should you do?

  • Trust your guess about where it ends.
  • Trace it one step at a time and see.
  • Say the robot is broken.

Your sharing rule works for 3 friends. What should you try next?

  • Nothing. It worked once, so it always works.
  • A tricky case, like zero friends.
  • The same 3 friends again.

Cards read 4, 1. The rule says swap if the left one is bigger. What happens?

  • Nothing. They are in order.
  • They swap, giving 1, 4.
  • Both cards go away.

Next: How a Computer Works. Meet the parts of a real device.

Jump to lesson

This track

  1. 0 Start here
  2. 1 Split the big job
  3. 2 Spot the repeat
  4. 3 Algorithm = exact steps, in order
  5. 4 Follow the steps exactly
  6. 5 Test the tricky case
  7. 6 Sorting is an algorithm too
  8. 7 The big picture
  9. 8 Track quiz

Other tracks