DATA STRUCTURES FINAL EXAM 2026
WITH 180 PREP QUESTIONS AND
VERIFIED CORRECT ANSWERS |
ALREADY GRADED A+ | GUARANTEED
PASS | AQA A-LEVE COMPUTER SCIENCE
LATEST EXAM 2026 [NEW VERSION]
Give an example of an elementary data type
Integer, real, boolean and char.
Define composite data type (1 mark)
Any data type which can be constructed using elementary/primitive data types
Define data structure (3 marks)
A named collection of variables (1), possibly of different types (1), which are
connected in various ways (1).
Define array (5 marks)
,An ordered/indexed (1), static (fixed in size) (1) abstract data type / data
structure (1) that stores multiple values (1) of the same data type (1)
Define two-dimensional array (1 mark)
An array consisting of other arrays inside of it
Define N-dimensional array (1 mark)
A 2 dimensional array consists of arrays in an array
A 3 dimensional array consists of arrays in arrays in an array
This extends to n dimensions
More generally, a set of elements with the same data type that are indexed by a
tuple of n integers
Define array indexing (1 mark)
Accessing a value in an array using its position in the array, represented by a
number
State the notation used for array indexing
Square bracket indexing
For example, if you have an array called names, and you wannt to access the
first element, you would write (in code) names[0]
,State where indexing starts at in an array (i.e. the index value of the first item in
an array)
0
Give an example of composite data types
String, array or list.
These are all made up of multiple elementary data types. For example, a string
is a series of individual characters.
Define record data structure (2 marks)
A collection of other cells, called fields (1), that may be of different data types
(1)
Give an example of a use of a record data structure
For example, to store customer information in a record of customer data. Field
values can store things such as customer name, address, age, etc.
State the type of abstraction involved in an abstract data type
Data abstraction
Define abstract data type (4 marks)
, A logical description (1) of how the data is viewed (1) and the operations that
can be performed on it (1). How this is done is not necessarily known to the
user (1).
Give an example of an abstract data type
Graph, tree, stack, queue
An abstract data type hides the details of its implementation. What is this
called? (1 mark)
Information hiding.
Another example is python's math.sqrt() function. You, as the user/programmer,
don't know how it is implemented.
State what is meant by FIFO
First in First out
State what is meant by LILO
Last in last out
Give an example of a FIFO (First in First out) data structure
A queue