Lesson 1.4.2
1.4.2 Arrays, records, lists, graphs, stacks, queues, trees and hash tables Quiz: OCR Computer Science, Unit 4
20 questions
In partnership with Revision Ninja
Lesson 1.4.2, Arrays, records, lists, graphs, stacks, queues, trees and hash tables: 20 multiple choice questions for the OCR Computer Science (H446), Unit 4: Data types, data structures and algorithms, written with Revision Ninja.
Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.
The 20 questions
-
Which data structure uses a fixed size and indexed elements stored in contiguous memory locations?
- Array
- Linked list
- Queue
- Hash table
-
Which data structure is immutable, meaning its elements cannot be modified after creation?
- List
- Array
- Tuple
- Record
-
Which abstract data type operates on a Last-In, First-Out (LIFO) principle?
- Graph
- Queue
- Tree
- Stack
-
Which data structure operates on a First-In, First-Out (FIFO) principle?
- Queue
- Binary tree
- Hash table
- Stack
-
What prevents space waste in a fixed-size queue when items are repeatedly added and removed?
- Circular queue
- Static array
- Linear queue
- Priority queue
-
Which operation adds a new item onto the top of a stack data structure?
- Enqueue
- Pop
- Push
- Dequeue
-
Which operation removes and returns the front item from a queue data structure?
- Enqueue
- Pop
- Dequeue
- Push
-
What term describes a graph connection that has a specific start and end node direction?
- Adjacency matrix
- Undirected edge
- Weighted vertex
- Directed edge
-
In a binary search tree, where must values smaller than a node be located?
- Left subtree
- Parent node
- Root node
- Right subtree
-
What occurs when a hash function generates the same index for two different keys?
- Hash collision
- Underflow
- Null pointer
- Hash overflow
-
What value indicates that the pointer at the end of a linked list points nowhere?
- False
- Null
- Void
- Zero
-
What is the top node of a tree data structure called?
- Root
- Leaf
- Parent
- Branch
-
Which structure uses a two-dimensional array to record edges between vertices in a graph?
- Hash table
- Pointer array
- Adjacency list
- Adjacency matrix
-
Which collision resolution method places colliding items into a linked list at that index?
- Double hashing
- Separate chaining
- Open addressing
- Linear probing
-
How many total elements can be stored in a 3D array of size 3x4x2?
- 48
- 9
- 24
- 14
-
Which data structure contains a fixed set of fields, potentially of different data types?
- Tuple
- Array
- List
- Record
-
Which tree traversal visits the root node before visiting its left and right subtrees?
- In-order
- Pre-order
- Post-order
- Breadth-first
-
Which characteristic distinguishes a dynamic data type from a static data type?
- Immutable elements
- Variable memory size
- Fixed memory size
- Faster access time
-
Which queue variation dequeues elements based on an assigned importance value rather than arrival order?
- Linear queue
- Circular queue
- Double-ended queue
- Priority queue
-
What is a node in a tree structure called if it has no child nodes?
- Branch
- Parent
- Leaf
- Root
Related quizzes
- Primitive data types and binary number representation Quiz · 1.4.1a · 20 questions
- Hexadecimal, floating point and bitwise manipulation Quiz · 1.4.1b · 20 questions
- Character sets: ASCII and Unicode Quiz · 1.4.1c · 20 questions
- Boolean problems, simplification and Karnaugh maps Quiz · 1.4.3a · 20 questions
- Logic gates, truth tables, flip-flops, half and full adders Quiz · 1.4.3b · 20 questions
- Processor components: ALU, control unit, registers and buses Quiz · 1.1.1a · 20 questions
- Operating systems and memory management Quiz · 1.2.1a · 20 questions
- Compression, encryption and hashing Quiz · 1.3.1 · 20 questions
- Data Protection Act 1998 and Computer Misuse Act 1990 Quiz · 1.5.1a · 20 questions
- The nature and need for abstraction and abstract models Quiz · 2.1.1 · 20 questions