Data Structures Learning Quizzes for Year 13 ICT Students

Question 1

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

Accepted Answer

Stack

Answer

Array

Answer

Linked List

Answer

Queue

Question 2

Which of the following is not a fundamental data structure used in computer science?

Accepted Answer

Algorithm

Answer

Array

Answer

Linked list

Answer

Stack

Question 3

Which data structure is specifically designed to maintain a Last-In-First-Out (LIFO) order of elements?

Accepted Answer

Stack

Answer

Array

Answer

Queue

Answer

Tree

Question 4

What is the primary distinction between an array and a linked list data structure?

Accepted Answer

Arrays are contiguous in memory, while linked lists are not.

Answer

Linked lists are contiguous in memory, while arrays are not.

Answer

Arrays allow faster access to elements, while linked lists are slower.

Answer

Linked lists allow faster access to elements, while arrays are slower.

Question 5

Which data structure is commonly used to perform a Breadth-First Search (BFS) algorithm?

Accepted Answer

Queue

Answer

Array

Answer

Stack

Answer

Tree

Question 6

How is data organized within a binary tree data structure?

Accepted Answer

Each node can have at most two child nodes.

Answer

Each node can have at most one child node.

Answer

Each node must have at least one child node.

Answer

Each node must have at least two child nodes.

Question 7

What is the time complexity of searching for an element in an unsorted array?

Accepted Answer

O(n)

Answer

O(1)

Answer

O(log n)

Answer

O(n^2)

Question 8

What is the main purpose of a hash table data structure?

Accepted Answer

To efficiently store key-value pairs.

Answer

To efficiently store a collection of unique elements.

Answer

To efficiently store data in a sorted order.

Answer

To efficiently store large binary objects.

Question 9

Which of the following data structures exhibits a recursive definition?

Accepted Answer

Tree

Answer

Array

Answer

Stack

Answer

Linked list

Question 10

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

Accepted Answer

Arrays store elements contiguously in memory, while linked lists store elements in nodes connected by pointers.

Answer

Linked lists store elements contiguously in memory, while arrays store elements in nodes connected by pointers.

Answer

Arrays and linked lists both store elements contiguously in memory.

Answer

Arrays and linked lists both store elements in nodes connected by pointers.

Question 11

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

Accepted Answer

Queue

Answer

Array

Answer

Stack

Answer

Tree

Question 12

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

Accepted Answer

O(log n)

Answer

O(1)

Answer

O(n)

Answer

O(n^2)

Question 13

Which data structure is suitable for representing a hierarchical structure, such as a family tree?

Accepted Answer

Tree

Answer

Array

Answer

Linked list

Answer

Stack

Question 14

What is the purpose of a null pointer in a linked list?

Accepted Answer

To indicate the end of the list

Answer

To store data that is not currently being used

Answer

To connect two nodes in the list

Answer

To prevent memory leaks

Question 15

Which of the following is not a type of queue?

Accepted Answer

Last-In-First-Out (LIFO)

Answer

First-In-First-Out (FIFO)

Answer

Priority queue

Answer

Double-ended queue

Question 16

What is the difference between a complete binary tree and a perfect binary tree?

Accepted Answer

A complete binary tree has all levels filled except possibly the last level, while a perfect binary tree has all levels completely filled.

Answer

A perfect binary tree has all levels filled except possibly the last level, while a complete binary tree has all levels completely filled.

Answer

Complete and perfect binary trees are the same.

Answer

Complete binary trees have a maximum height, while perfect binary trees do not.

Question 17

What is the time complexity of inserting an element into an array at an arbitrary index?

Accepted Answer

O(n)

Answer

O(1)

Answer

O(log n)

Answer

O(n^2)

Question 18

In a singly linked list, each element contains a reference to the:

Accepted Answer

Next element

Answer

Previous element

Answer

First element

Answer

Last element

Question 19

Which operation on a stack adds an element to the top of the stack?

Accepted Answer

Push

Answer

Pop

Answer

Peek

Answer

Enqueue

Question 20

What is the maximum number of elements that can be stored in a queue with a fixed size of n?

Accepted Answer

n

Answer

2n

Answer

n-1

Answer

n+1

Question 21

Which data structure is a hierarchical collection of nodes?

Accepted Answer

Tree

Answer

Array

Answer

Linked list

Answer

Graph

Question 22

What is the time complexity of searching for an element in a balanced binary tree of height h?

Accepted Answer

O(log h)

Answer

O(h)

Answer

O(n)

Answer

O(n^2)

Question 23

Which type of tree is used to represent hierarchical data in a computer file system?

Accepted Answer

B-tree

Answer

Binary search tree

Answer

Balanced binary tree

Answer

Red-black tree

Question 24

What is the purpose of a hash function in a hash table?

Accepted Answer

To distribute elements evenly across the table

Answer

To sort elements in ascending order

Answer

To store elements in a contiguous block of memory

Answer

To reduce the size of the table

Question 25

Which of the following is not a benefit of using a database?

Accepted Answer

Data redundancy

Answer

Data integrity

Answer

Data security

Answer

Data accessibility

Question 26

What is the purpose of a primary key in a relational database?

Accepted Answer

To uniquely identify each row in a table

Answer

To sort the rows in a table

Answer

To store the most important data in a table

Answer

To link tables together

Question 27

Which of the following is not considered a fundamental data structure?

Accepted Answer

Tuple

Answer

Array

Answer

Stack

Answer

Linked list

Question 28

A linked list offers what primary advantage over an array?

Accepted Answer

Faster insertions and deletions

Answer

More efficient memory utilization

Answer

Easier to traverse

Answer

Better suited for storing exceptionally large datasets

Question 29

Which data structure is commonly used to implement a last-in, first-out (LIFO) behavior?

Accepted Answer

Stack

Answer

Queue

Answer

Array

Answer

Linked list

Question 30

What is a key distinction between a binary search tree and a binary heap?

Accepted Answer

Binary search trees are inherently sorted, while binary heaps are not.

Answer

Binary heaps are inherently sorted, while binary search trees are not.

Answer

Binary search trees are balanced, while binary heaps are not.

Answer

None of the above accurately describes their distinction.

Question 31

Queues do not support which of the following operations?

Accepted Answer

Append

Answer

Enqueue

Answer

Dequeue

Answer

Peek

Question 32

The average-case time complexity of searching for an element in a hash table with 'n' keys is:

Accepted Answer

O(1)

Answer

O(n)

Answer

O(log n)

Answer

O(n^2)

Question 33

Which data structure is employed to implement a priority queue?

Accepted Answer

Binary heap

Answer

Array

Answer

Linked list

Answer

Hash table

Question 34

What is the defining characteristic that differentiates directed graphs from undirected graphs?

Accepted Answer

Directed graphs have edges with a specific direction, whereas undirected graphs do not.

Answer

Directed graphs have weighted edges, whereas undirected graphs do not.

Answer

Directed graphs can represent cyclical relationships, whereas undirected graphs cannot.

Answer

None of the above accurately describes their distinction.

Question 35

Which of the following is NOT an advantage of utilizing data structures?

Accepted Answer

Absolute assurance of sensitive data security

Answer

Improved organization of data

Answer

Enhanced efficiency in data retrieval

Answer

Elimination of the requirement for manual data manipulation

Question 36

Which of the following operations is not applicable to a stack?

Accepted Answer

Insertion at an arbitrary position

Answer

Push

Answer

Pop

Answer

Peek

Question 37

Which data structure is best suited for implementing a first-in, first-out (FIFO) behavior?

Accepted Answer

Queue

Answer

Stack

Answer

Tree

Answer

Array

Question 38

The time complexity of searching for an element in a linked list of n elements is:

Accepted Answer

O(n)

Answer

O(1)

Answer

O(log n)

Answer

O(n^2)

Question 39

Which of the following Python data structures is used to implement a hash table?

Accepted Answer

dictionary

Answer

list

Answer

tuple

Answer

set

Question 40

Which of the following is NOT considered a fundamental data structure?

Accepted Answer

Tuple

Answer

Array

Answer

Linked List

Answer

Tree

Question 41

What is the time complexity of accessing an element in an array of size n?

Accepted Answer

O(1)

Answer

O(log n)

Answer

O(n)

Answer

O(n^2)

Question 42

Which data structure is used to implement a Last-In-First-Out (LIFO) behavior?

Accepted Answer

Stack

Answer

Array

Answer

Linked List

Answer

Queue

Question 43

What is the key difference between a singly-linked list and a doubly-linked list?

Accepted Answer

Singly-linked lists have one pointer per node, while doubly-linked lists have two.

Answer

Doubly-linked lists are more efficient for searching.

Answer

Singly-linked lists are more suitable for scenarios where memory is constrained.

Question 44

Which data structure is primarily used to represent hierarchical relationships?

Accepted Answer

Tree

Answer

Array

Answer

Queue

Answer

Stack

Question 45

In a balanced binary search tree, what is the typical time complexity of searching for a specific element?

Accepted Answer

O(log n)

Answer

O(1)

Answer

O(n)

Answer

O(n^2)

Question 46

Which data structure is most appropriate for implementing a queue, which follows the FIFO (first-in-first-out) principle?

Accepted Answer

Linked List

Answer

Stack

Answer

Tree

Answer

Array

Question 47

In a linked list, what is the role of the head node?

Accepted Answer

It stores a reference to the first node in the list.

Answer

It serves as a placeholder indicating the end of the list.

Answer

It points to the last node in the list.

Answer

It stores the count of nodes in the list.

Question 48

Which data structure is best suited for representing a hierarchical structure, such as a family tree or organizational chart?

Accepted Answer

Tree

Answer

Stack

Answer

Array

Answer

Queue

Question 49

What is the worst-case time complexity for performing a sequential search on an array of size n?

Accepted Answer

O(n)

Answer

O(log n)

Answer

O(1)

Answer

O(n^2)

Question 50

Which data structure adheres to the last-in-first-out (LIFO) access pattern, meaning the last element added is the first to be retrieved?

Accepted Answer

Stack

Answer

Queue

Answer

Array

Answer

Tree

Question 51

What differentiates a circular linked list from a regular linked list?

Accepted Answer

The last node in a circular linked list points back to the first node, creating a circular structure.

Answer

Regular linked lists are more efficient for insertions and deletions.

Answer

Circular linked lists can be traversed in both directions.