Data Structures Learning Quizzes for Year 11 Computing Students

Question 1

What is the distinction between a stack and a queue?

Accepted Answer

Stacks use Last In, First Out (LIFO) and queues use First In, First Out (FIFO).

Answer

Queues use LIFO and stacks use FIFO.

Answer

Stacks and queues are identical data structures.

Answer

Stacks store data in nodes while queues store data in arrays.

Question 2

Which data structure represents hierarchical relationships?

Accepted Answer

Tree

Answer

LinkedList

Answer

Array

Answer

Stack

Question 3

What is the time complexity of accessing an element in an array by its index?

Accepted Answer

O(1)

Answer

O(n)

Answer

O(log n)

Answer

O(n^2)

Question 4

Describe a doubly linked list.

Accepted Answer

A linked list where each node references both its preceding and succeeding nodes.

Answer

A linked list where each node references only its preceding node.

Answer

A linked list where each node references only its succeeding node.

Answer

A circular linked list where the last node points to the first node.

Question 5

What is an advantage of an array over a linked list?

Accepted Answer

Arrays offer faster random access.

Answer

Linked lists are more efficient for handling dynamic sizing.

Answer

Arrays are inherently more complex to implement.

Answer

Linked lists consume less memory.

Question 6

What differentiates a graph from a tree?

Accepted Answer

Graphs allow cycles, while trees do not.

Answer

Trees allow cycles, while graphs do not.

Answer

Graphs are always connected, while trees are not.

Answer

Trees are always connected, while graphs are not.

Question 7

Which of the following operations is NOT supported by a queue?

Accepted Answer

Pushing an element onto the front

Answer

Enqueueing an element at the rear

Answer

Dequeueing an element from the front

Answer

Peeking at the element at the front

Question 8

Which data structure is best suited for representing a network of interconnected nodes and their relationships?

Accepted Answer

Graph

Answer

Array

Answer

Linked list

Answer

Stack

Question 9

Which tree traversal method visits all nodes in depth-first order, starting from the root node?

Accepted Answer

Pre-order traversal

Answer

In-order traversal

Answer

Post-order traversal

Answer

Level-order traversal

Question 10

Which data structure can efficiently search for a specific element in a large sorted array?

Accepted Answer

Binary search

Answer

Linear search

Answer

Breadth-first search

Answer

Depth-first search

Question 11

Which characteristic is unique to a linked list?

Accepted Answer

Nodes contain a reference to the next node

Answer

Nodes are stored consecutively in memory

Answer

Any node can be accessed in constant time

Answer

Linked lists are always the most efficient data structure

Question 12

Which data structure is a linear collection of elements that allows constant-time access to any element?

Accepted Answer

Array

Answer

Linked list

Answer

Stack

Answer

Queue

Question 13

What is the time complexity of searching for an element in a linked list?

Accepted Answer

O(n)

Answer

O(1)

Answer

O(log n)

Answer

O(n^2)

Question 14

Which data structure is used to implement a breadth-first search algorithm?

Accepted Answer

Queue

Answer

Stack

Answer

Tree

Answer

Graph

Question 15

How do binary search trees differ from binary trees?

Accepted Answer

Binary search trees enforce a specific ordering of elements.

Answer

Binary trees are more efficient for searching.

Answer

They are fundamentally similar data structures.

Answer

Binary search trees can only store numerical values.

Question 16

Which data structure is appropriate for representing connections between objects?

Accepted Answer

Graph

Answer

Array

Answer

Linked list

Answer

Tree

Question 17

What is the time complexity of deleting an element from the middle of a linked list?

Accepted Answer

O(n)

Answer

O(1)

Answer

O(log n)

Answer

O(n^2)

Question 18

Which data structure is a collection of nodes connected by pointers, where each node contains a value?

Accepted Answer

Linked List

Answer

Array

Answer

Stack

Answer

Queue

Question 19

Which data structure follows the Last-In-First-Out (LIFO) principle?

Accepted Answer

Stack

Answer

Queue

Answer

Array

Answer

Linked List

Question 20

Which data structure follows the First-In-First-Out (FIFO) principle?

Accepted Answer

Queue

Answer

Stack

Answer

Array

Answer

Linked List

Question 21

Which data structure represents a network of interconnected nodes and edges?

Accepted Answer

Graph

Answer

Tree

Answer

Array

Answer

Linked List

Question 22

Which data structure is more efficient for implementing a depth-first search algorithm?

Accepted Answer

Stack

Answer

Queue

Answer

Array

Answer

Linked List

Question 23

Which data structure is commonly used to model a maze or labyrinth?

Accepted Answer

Graph

Answer

Tree

Answer

Array

Answer

Linked List

Question 24

Which of the following is NOT a potential drawback of using data structures?

Accepted Answer

Increased code complexity

Answer

Improved organization of data

Answer

Faster data retrieval

Answer

Efficient storage

Question 25

How do self-balancing binary search trees maintain balance when adding or removing elements?

Accepted Answer

By rotating nodes to adjust the tree's height after insertions or deletions.

Answer

By storing duplicate nodes in multiple parts of the tree.

Answer

By deleting nodes that cause imbalance.

Answer

By not maintaining balance and always being unbalanced.

Question 26

What is a key benefit of using a circular queue compared to a linear queue?

Accepted Answer

Circular queues are more efficient for enqueue and dequeue operations.

Answer

Circular queues have a larger storage capacity.

Answer

Circular queues support both FIFO and LIFO operations.

Answer

Circular queues are easier to implement in code.

Question 27

Which data structure is a sequential collection of homogeneous elements stored in contiguous memory locations?

Accepted Answer

Array

Answer

Tree

Answer

Stack

Answer

Queue

Question 28

Which data structure represents hierarchical relationships between elements, where each element can have multiple child elements?

Accepted Answer

Tree

Answer

Graph

Answer

Linked List

Answer

Array

Question 29

Which data structure represents a collection of interconnected elements or vertices, where each pair of elements can be connected by an edge?

Accepted Answer

Graph

Answer

Tree

Answer

Queue

Answer

Array

Question 30

Which data structure consists of a sequence of elements connected in a linear fashion, where each element references the next element in the sequence?

Accepted Answer

LinkedList

Answer

Tree

Answer

ArrayList

Answer

Array

Question 31

Which data structure is designed to store key-value pairs, providing efficient retrieval based on the provided key?

Accepted Answer

HashMap

Answer

Tree

Answer

LinkedList

Answer

Array

Question 32

Which data structure exhibits last-in, first-out (LIFO) behavior, where the most recently added element is the first to be removed?

Accepted Answer

Stack

Answer

Tree

Answer

Array

Answer

Queue

Question 33

Which data structure follows the first-in, first-out (FIFO) principle, ensuring that the first element added is the first to be removed?

Accepted Answer

Queue

Answer

Stack

Answer

Tree

Answer

Array

Question 34

What is the fundamental difference between a linked list and an array?

Accepted Answer

Arrays store elements in consecutive memory locations while linked lists store elements in non-consecutive memory locations.

Answer

Linked lists store elements in consecutive memory locations while arrays store elements in non-consecutive memory locations.

Question 35

Which data structure follows a last-in, first-out (LIFO) approach?

Accepted Answer

Stack

Answer

Queue

Answer

Linked List

Answer

Array

Question 36

What is the primary purpose of a hash table?

Accepted Answer

To store key-value pairs for efficient lookup.

Answer

To sort data in ascending or descending order.

Answer

To represent relationships between objects.

Answer

To store data in a hierarchical structure.

Question 37

What is the time complexity of searching for an element in a binary search tree?

Accepted Answer

O(log n)

Answer

O(n)

Answer

O(n^2)

Answer

O(1)

Question 38

Which of the following is not a type of graph?

Accepted Answer

Linear graph

Answer

Weighted graph

Answer

Directed graph

Answer

Undirected graph

Question 39

What is the primary purpose of a depth-first search (DFS) algorithm?

Accepted Answer

To traverse a graph and explore each branch as far as possible before backtracking.

Answer

To traverse a graph and visit all nodes in a breadth-first manner.

Answer

To find the shortest path between two nodes in a graph.

Question 40

Which of the following data structures can be used to represent a hierarchical structure?

Accepted Answer

Tree

Answer

Hash table

Answer

Array

Answer

Queue