Computational Thinking Vocabulary Quiz
12 multiple-choice questions on computational thinking vocabulary: algorithm, decomposition, abstraction, debugging, pseudocode, iteration, recursion, variable, logic gate and more. B2 level.
This quiz focuses on how the target vocabulary for Computational Thinking is actually used in context at B2 Level level, rather than testing bare definitions. Correct answers you will need to identify include terms such as algorithm, decomposition, abstraction, pattern and debugging, each embedded in a full example sentence so you have to judge meaning from context, not just recognise an isolated word.
Working through all these questions and checking the explanations in the FAQ below is a quick way to spot any terms you are still unsure of. Revisiting the quiz again after a day or two, rather than only once, is one of the most reliable ways to move new vocabulary from passive recognition into words you can use confidently yourself in speaking and writing.
Keep building your computational thinking vocabulary.
Computational Thinking Vocabulary — FAQ
What is an 'algorithm'?
An algorithm is a precise, step-by-step set of instructions for solving a problem or completing a task. Algorithms must be unambiguous, finite and produce a result. They are the foundation of all computer programs — when you write code, you are translating an algorithm into a language a computer can execute. Algorithms are also used in everyday life, for example when following a recipe.
What is 'decomposition' in computational thinking?
Decomposition is the process of breaking down a complex problem into smaller, more manageable sub-problems. By dividing a large problem into smaller parts, each part can be understood, solved and tested independently. It is one of the four key pillars of computational thinking, alongside abstraction, pattern recognition and algorithmic thinking.
What is 'abstraction' in computational thinking?
Abstraction is the process of focusing on essential information while ignoring irrelevant details. In programming, it allows programmers to use functions and objects without understanding every implementation detail. For example, when using a 'sort' function, a programmer does not need to know how the sorting algorithm works internally.
What is 'debugging' in programming?
Debugging is the process of finding and fixing errors (bugs) in a program. Common types of bugs include syntax errors (incorrect code structure), logic errors (the code runs but produces the wrong result) and runtime errors (the code crashes while running). The term 'bug' was popularised by computer scientist Grace Hopper.
What is 'pseudocode'?
Pseudocode is an informal, human-readable description of an algorithm that uses plain language mixed with some programming structures, but is not written in any specific programming language. It is used to plan and communicate the logic of a program before actually writing the code. There is no strict standard for pseudocode.
What is 'iteration' in programming?
Iteration refers to the repetition of a sequence of steps. In programming, it is implemented using loops (for loops or while loops) that repeat a block of code a specified number of times or until a condition is met. Iteration allows tasks to be performed efficiently without writing the same code multiple times.
What is 'recursion' in computing?
Recursion is a technique in which a function calls itself as part of its own definition, working on a smaller version of the problem each time. A recursive function must have a base case — a condition under which it stops calling itself. Recursion is elegant for problems such as calculating a factorial or sorting using merge sort.
What is a 'variable' in programming?
A variable is a named storage location in a program that holds a value which can change during execution. Variables have a name, a type (such as integer, string or boolean) and a value. For example, a variable called 'score' might store a player's score, starting at 0 and increasing as the game progresses.
What is a 'logic gate'?
A logic gate is an electronic circuit component that performs a basic logical operation on binary inputs (0 or 1) to produce a single binary output. The most common gates are AND, OR, NOT, NAND, NOR and XOR. Logic gates are the fundamental building blocks of all digital circuits, including processors and memory.
What is 'pattern recognition' in computational thinking?
Pattern recognition is the ability to identify similarities, trends or regularities in problems or data. Recognising patterns allows solutions developed for one problem to be applied to similar ones. It also underpins machine learning, where algorithms are trained to recognise patterns in large datasets.