GCSE Algorithms and Programming

Question 1

What term describes a precise, step-by-step set of instructions used to solve a problem?

Accepted Answer

An algorithm

Answer

An algorithm is an unambiguous sequence of steps designed to solve a specific problem.

Question 2

What is the process of breaking a complex problem down into smaller, more manageable sub-problems called?

Accepted Answer

Decomposition

Answer

Decomposition splits a large problem into smaller parts that are easier to understand and solve individually.

Question 3

Which searching algorithm repeatedly divides a sorted list in half to quickly locate a target value?

Accepted Answer

Binary search

Answer

Binary search works only on sorted data and eliminates half the remaining items with each comparison.

Question 4

Which searching algorithm checks every item in a list one at a time, starting from the beginning, until it finds the target or reaches the end?

Accepted Answer

Linear search

Answer

Linear search examines each element in sequence and works on both sorted and unsorted lists.

Question 5

What is the process of removing unnecessary detail to focus only on the important features of a problem called?

Accepted Answer

Abstraction

Answer

Abstraction filters out irrelevant detail, allowing a programmer to focus on what matters for solving the problem.

GCSE - General Certificate of Secondary Education Practice Test