OCR A LEVEL COMPUTER SCIENCE
QUESTIONS AND CORRECT ANSWERS
RATED A+ UPDATED
QUESTION
What is a one-dimensional array?
CORRECT ANSWER
A standard list array where only one index is needed to search for or access an item.
QUESTION
What is a two-dimensional array?
CORRECT ANSWER
An array that requires two indexes to search, such as a table with rows and columns.
QUESTION
What is interpretation of pseudocode?
CORRECT ANSWER
The ability to pick out and explain parts of code written in pseudocode.
QUESTION
What is Big O notation?
CORRECT ANSWER
A measure of the complexity or efficiency of an algorithm.
QUESTION
What is recursion?
,CORRECT ANSWER
A process where a function calls itself repeatedly until a condition is met.
QUESTION
What is a function?
CORRECT ANSWER
A decomposed part of code that performs a specific task and may return an output.
QUESTION
What is iteration?
CORRECT ANSWER
The repetition of a section of code multiple times.
QUESTION
What is a subroutine?
CORRECT ANSWER
A decomposed part of a program that performs a specific task.
QUESTION
What is data mining?
CORRECT ANSWER
The process of collecting and analysing data about user habits or requests.
QUESTION
What is a binary search?
CORRECT ANSWER
A search algorithm that repeatedly compares the midpoint of a sorted array to the target value.
QUESTION
What is insertion sort?
,CORRECT ANSWER
A sorting algorithm that iteratively compares each value with the values before it and inserts it
in the correct position.
QUESTION
What is bubble sort?
CORRECT ANSWER
A sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in
the wrong order.
QUESTION
What is quick sort?
CORRECT ANSWER
A sorting algorithm that divides a list around a pivot value and recursively sorts the sublists.
QUESTION
What is merge sort?
CORRECT ANSWER
A sorting algorithm that divides a list into smaller sublists, sorts them, and then merges them
back together.
QUESTION
What is a global variable?
CORRECT ANSWER
A variable that can be accessed anywhere in a program.
QUESTION
What is a local variable?
CORRECT ANSWER
A variable that can only be accessed within a specific function or block of code.
, QUESTION
What is Dijkstra’s algorithm?
CORRECT ANSWER
An algorithm used to find the shortest path between nodes in a graph.
QUESTION
What is the Travelling Salesman Algorithm?
CORRECT ANSWER
An algorithm that finds the shortest possible route that visits each location once and returns to
the starting point.
QUESTION
What is decomposition?
CORRECT ANSWER
Breaking a problem down into smaller, more manageable parts.
QUESTION
What is a graph tree?
CORRECT ANSWER
A hierarchical data structure made up of nodes connected by edges with no cycles.
QUESTION
What is a heuristic?
CORRECT ANSWER
A rule or method used to make problem-solving faster by producing a good-enough solution.
QUESTION
What is pipelining?
QUESTIONS AND CORRECT ANSWERS
RATED A+ UPDATED
QUESTION
What is a one-dimensional array?
CORRECT ANSWER
A standard list array where only one index is needed to search for or access an item.
QUESTION
What is a two-dimensional array?
CORRECT ANSWER
An array that requires two indexes to search, such as a table with rows and columns.
QUESTION
What is interpretation of pseudocode?
CORRECT ANSWER
The ability to pick out and explain parts of code written in pseudocode.
QUESTION
What is Big O notation?
CORRECT ANSWER
A measure of the complexity or efficiency of an algorithm.
QUESTION
What is recursion?
,CORRECT ANSWER
A process where a function calls itself repeatedly until a condition is met.
QUESTION
What is a function?
CORRECT ANSWER
A decomposed part of code that performs a specific task and may return an output.
QUESTION
What is iteration?
CORRECT ANSWER
The repetition of a section of code multiple times.
QUESTION
What is a subroutine?
CORRECT ANSWER
A decomposed part of a program that performs a specific task.
QUESTION
What is data mining?
CORRECT ANSWER
The process of collecting and analysing data about user habits or requests.
QUESTION
What is a binary search?
CORRECT ANSWER
A search algorithm that repeatedly compares the midpoint of a sorted array to the target value.
QUESTION
What is insertion sort?
,CORRECT ANSWER
A sorting algorithm that iteratively compares each value with the values before it and inserts it
in the correct position.
QUESTION
What is bubble sort?
CORRECT ANSWER
A sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in
the wrong order.
QUESTION
What is quick sort?
CORRECT ANSWER
A sorting algorithm that divides a list around a pivot value and recursively sorts the sublists.
QUESTION
What is merge sort?
CORRECT ANSWER
A sorting algorithm that divides a list into smaller sublists, sorts them, and then merges them
back together.
QUESTION
What is a global variable?
CORRECT ANSWER
A variable that can be accessed anywhere in a program.
QUESTION
What is a local variable?
CORRECT ANSWER
A variable that can only be accessed within a specific function or block of code.
, QUESTION
What is Dijkstra’s algorithm?
CORRECT ANSWER
An algorithm used to find the shortest path between nodes in a graph.
QUESTION
What is the Travelling Salesman Algorithm?
CORRECT ANSWER
An algorithm that finds the shortest possible route that visits each location once and returns to
the starting point.
QUESTION
What is decomposition?
CORRECT ANSWER
Breaking a problem down into smaller, more manageable parts.
QUESTION
What is a graph tree?
CORRECT ANSWER
A hierarchical data structure made up of nodes connected by edges with no cycles.
QUESTION
What is a heuristic?
CORRECT ANSWER
A rule or method used to make problem-solving faster by producing a good-enough solution.
QUESTION
What is pipelining?