Algorithms and Programming Flashcards
6 cards from real GCSE practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.
Read the first 6 Algorithms and Programming flashcards as text
What term describes a precise, step-by-step set of instructions used to solve a problem?
Answer: An algorithm
An algorithm is an unambiguous sequence of steps designed to solve a specific problem.
What is the process of breaking a complex problem down into smaller, more manageable sub-problems called?
Answer: Decomposition
Decomposition splits a large problem into smaller parts that are easier to understand and solve individually.
Which searching algorithm repeatedly divides a sorted list in half to quickly locate a target value?
Answer: Binary search
Binary search works only on sorted data and eliminates half the remaining items with each comparison.
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?
Answer: Linear search
Linear search examines each element in sequence and works on both sorted and unsorted lists.
What is the process of removing unnecessary detail to focus only on the important features of a problem called?
Answer: Abstraction
Abstraction filters out irrelevant detail, allowing a programmer to focus on what matters for solving the problem.
Which sorting algorithm repeatedly compares adjacent items in a list and swaps them if they are in the wrong order?
Answer: Bubble sort
Bubble sort passes through the list multiple times, swapping adjacent out-of-order items until the list is sorted.