4.2: Fundamentals of Data Structures: revision quiz and key terms
Free practice for 4.2: Fundamentals of Data Structures in AQA A Level Computer Science (7517). It has 11 parts, listed below. Try the questions, then check the key terms.
Try 5 free questions
Which method of handling collisions in a hash table stores all items that hash to the same index in a list at that index?
A graph is a data structure used to represent complex relationships between items.
Which data structure is most suitable for holding print jobs so that they are printed in the order in which they were sent?
Vector addition achieves scaling of a vector's length.
What is the dot product of the vectors [2, 3] and [4, 1]?
In RADevo, this topic has fill-in-the-blank, matching, multiple-choice and true or false activities, and every question you get wrong comes back in Revise today until you've learnt it.
Key terms for 4.2: Fundamentals of Data Structures
- Adjacency list
- A structure listing, for each vertex, the other vertices it is directly connected to.
- Graph
- A data structure used to represent complex relationships between items.
- Hash table
- A data structure that uses a hashing function to calculate the location at which a value is stored.
- n-dimensional array
- A set of elements of the same data type, indexed by a tuple of n integers.
- Queue
- A first in, first out data structure in which items are added at the rear and removed from the front.
- Stack
- A last in, first out data structure in which items are added and removed at the top.
- Text file
- A file that stores data as plain, human-readable characters.
- Tree
- A connected, undirected graph with no cycles.
What 4.2: Fundamentals of Data Structures covers
In RADevo this topic has a full topic test and a focused quiz for each part:
- 4.2.1.1 Data Structures
- 4.2.1.2 Single- and Multi-Dimensional Arrays
- 4.2.1.3 Fields, Records and Files
- 4.2.1.4 Abstract Data Types/Data Structures
- 4.2.2.1 Queues
- 4.2.3.1 Stacks
- 4.2.4.1 Graphs
- 4.2.5.1 Trees (Including Binary Trees)
- 4.2.6.1 Hash Tables
- 4.2.7.1 Dictionaries
- 4.2.8.1 Vectors
Teaching AQA A Level Computer Science (7517)?
Set this topic as homework in two clicks, see who has done it and which questions your class got wrong, and start every lesson with a Do Now built from their mistakes.
Start a free 2-week trialRevising for this?
If your school uses RADevo, sign in to do the full quizzes and keep your progress. If it doesn't, show this page to your Computing teacher.
Log in to RADevo