AQA Paper 1 - Fundamentals of data structures
- Created by: The_Pimp_Daddy
- Created on: 07-09-22 17:35
N | S | T | A | C | K | O | P | E | R | A | T | I | O | N | P | U | S | H | A | A |
A | O | N | E | D | I | M | E | N | S | I | O | N | A | L | A | R | R | A | Y | V |
D | E | Y | R | Q | Y | F | L | D | O | K | V | R | N | D | Y | B | J | T | J | C |
J | D | U | V | G | N | N | Y | M | E | A | F | J | I | M | D | I | I | F | F | U |
A | H | J | E | J | L | R | V | Q | E | E | F | C | F | D | L | N | V | R | E | F |
C | K | Q | S | B | A | N | X | D | T | O | T | A | M | S | G | A | D | O | H | U |
E | M | T | W | W | B | V | W | Q | E | I | A | H | C | H | J | R | A | O | E | V |
N | D | F | O | Y | C | A | B | I | O | U | B | D | I | N | D | Y | A | T | J | V |
C | R | Q | E | I | W | V | D | N | F | L | P | J | K | Q | B | T | P | N | X | L |
Y | Y | S | C | H | L | R | A | M | P | G | M | T | W | D | D | R | O | O | T | X |
L | O | Q | Y | U | U | R | W | D | U | G | T | T | V | R | X | E | F | D | W | T |
I | N | V | G | V | Y | Q | A | H | L | T | W | S | D | X | J | E | N | E | O | I |
S | H | E | A | D | J | A | C | E | N | C | Y | M | A | T | R | I | X | P | B | Y |
T | P | S | S | T | A | C | K | O | P | E | R | A | T | I | O | N | P | O | P | I |
Y | G | F | P | Y | G | D | T | Y | W | N | A | L | Y | G | N | I | W | O | D | T |
X | V | L | T | H | M | K | K | I | C | R | I | Q | G | O | P | R | C | Y | Q | N |
N | Y | A | Q | N | U | P | X | E | H | A | S | H | T | A | B | L | E | D | B | H |
B | R | J | F | P | W | L | U | R | I | S | B | D | K | O | O | M | D | E | P | O |
P | T | W | O | D | I | M | E | N | S | I | O | N | A | L | A | R | R | A | Y | P |
O | L | E | V | D | R | O | F | K | N | E | F | I | M | D | X | D | S | C | L | K |
H | M | D | H | E | R | D | R | U | X | N | H | W | A | J | H | S | T | Q | P | Y |
Clues
- A data structure that stores data in an array format with each data value having an associated index value (4, 5)
- A data structure that uses keys and values to store data (10)
- A grid containing all the edges (connections between nodes) of a graph (9, 6)
- A linear array which represents a single row or column of data (3, 11, 5)
- A list of values which can be used to represent a graph (9, 4)
- A non-linear array which represents a grid of data (Columns and Rows) (3, 11, 5)
- A root node has no parent nodes, only child nodes (usually found at the top of the tree) (4, 4)
- A tree with at most two children nodes per parent node (6, 4)
- Accessing and removing from the top of the stack (5, 9, 3)
- Inserting an element onto the top of a stack (5, 9, 4)
Similar Computing resources:
Teacher recommended
Comments
No comments have yet been made