AQA GCSE Computer Science 8520 Paper 1
exam
Algorithm - A sequence of steps that can be followed to complete a task.
Decomposition - Breaking a problem into a number of sub-problems, so that each
sub- problem accomplishes an identifiable task, which might itself be further
subdivided.
Abstraction - The process of removing unnecessary detail from a problem.
Pseudo-code - Precise, English-like description of an algorithm. It has no specific
syntax, so input name and if name is bob are valid instructions.
Flowchart - A visual representation of an algorithm using specific shapes including
rectangle, diamond and parallelogram.
IPO - Where inputs, processing and outputs are taking place within an algorithm.
Linear search - A searching algorithm which looks at every element in turn until it
finds the target, it is slow but works even on unsorted data
, AQA GCSE Computer Science 8520 Paper 1
exam
Binary search - A searching algorithm that divides the search space in half each
time until it finds the target, faster than linear but requires the array to be sorted
Merge sort - A very efficient sorting algorithm that repeatedly breaks down a list
into smaller lists, then repeatedly merges them back together in order
Bubble sort - A sorting algorithm that passes over the list many times, swapping
adjacent items if they are in the wrong order. Not very efficient.
Integer - The data type of a whole number e.g. 5, 999 or -4
Real - A data type also called floating point numbers, they have a decimal part, for
example 1.5, 0.935 or the value of Pi
Boolean - This data type has only two values, TRUE and FALSE
Character - The data type of a single character e.g. "A" or "$"
exam
Algorithm - A sequence of steps that can be followed to complete a task.
Decomposition - Breaking a problem into a number of sub-problems, so that each
sub- problem accomplishes an identifiable task, which might itself be further
subdivided.
Abstraction - The process of removing unnecessary detail from a problem.
Pseudo-code - Precise, English-like description of an algorithm. It has no specific
syntax, so input name and if name is bob are valid instructions.
Flowchart - A visual representation of an algorithm using specific shapes including
rectangle, diamond and parallelogram.
IPO - Where inputs, processing and outputs are taking place within an algorithm.
Linear search - A searching algorithm which looks at every element in turn until it
finds the target, it is slow but works even on unsorted data
, AQA GCSE Computer Science 8520 Paper 1
exam
Binary search - A searching algorithm that divides the search space in half each
time until it finds the target, faster than linear but requires the array to be sorted
Merge sort - A very efficient sorting algorithm that repeatedly breaks down a list
into smaller lists, then repeatedly merges them back together in order
Bubble sort - A sorting algorithm that passes over the list many times, swapping
adjacent items if they are in the wrong order. Not very efficient.
Integer - The data type of a whole number e.g. 5, 999 or -4
Real - A data type also called floating point numbers, they have a decimal part, for
example 1.5, 0.935 or the value of Pi
Boolean - This data type has only two values, TRUE and FALSE
Character - The data type of a single character e.g. "A" or "$"
