Which of the following best describes a queue data structure?
A linear data structure where elements are added to the rear and removed from the front, operating on a First-In-First-Out (FIFO) basis.
A linear data structure where elements are added and removed from the same end, operating on a Last-In-First-Out (LIFO) basis.
A hierarchical data structure consisting of nodes, where each node has at most two children.
A composite data structure that stores a collection of key-value pairs where each unique key maps to a specific value.
36 exam-style questions on AQA GCSE Computer Science Data structures. Each one has a worked solution and a mark scheme showing where the marks go.