AQA Paper 1 - Fundamentals of data structures - Flashcards in A Level and IB Computing

1. A non-linear array which represents a grid of data (Columns and Rows) (3, 11, 5)
5. A hierarchal data structure consisting of nodes. It is in the form of parent and children nodes (4)
7. A type of array that is one-dimensional. This means it stores data of a single type (6)

2. A data structure that uses keys and values to store data (10)
3. A data structure that stores data in an array format with each data value having an associated index value (4, 5)
4. A root node has no parent nodes, only child nodes (usually found at the top of the tree) (4, 4)
6. A set of nodes (points/vertices) connected to one another by edges. Edges can be directed or weighted (allocated a value) (5)
8. A list of values which can be used to represent a graph (9, 4)
9. A data structure that uses FIFO logic (First In First Out) (5)
10. A data structure that uses LIFO logic (Last In First Out) (5)

Get Revising