1.4.2 Data Structures

Question 1

Which of the following data structures are ordered?

• List
• Record
• Tuple
• Array

Answer 1

List
Array
Tuple

Question 2

Which of the following data structures can store multiple data types?

• List
• Record
• Tuple
• Array

Answer 2

List
Record
Tuple

Question 3

Which of the following data structures are immutable (read-only)?

• List
• Record
• Tuple
• Array

Answer 3

Tuple

Contents cannot be modified at run-time

Question 4

Which of the following data structures have no predefined scope?

• List
• Record
• Tuple
• Array

Answer 4

List

Question 5

Which of the following data structures can store multiple values under one identifier?

• List
• Record
• Tuple
• Array

Answer 5

All of them

List
Record
Tuple
Array

Question 6

Which of the following data structures are accessed using an index?

• List
• Record
• Tuple
• Array

Answer 6

List
Tuple
Array

Question 7

Which of the following data structures can have multiple dimensions?

• List
• Record
• Tuple
• Array

Answer 7

Array

2D | 3D

Question 8

Which of the following data structures can have multiple dimensions?

• List
• Record
• Tuple
• Array

Answer 8

Array

2D | 3D

Question 9

How many pointers are used in a queue?

Answer 9

2 - Front and Rear

Question 10

How many pointers are used in a stack?

Answer 10

1 - Top

Question 11

What pointer is impacted when you enqueue an item

Answer 11

Rear/Tail - Incremented by one

Question 12

What pointer is impacted when you dequeue an item

Answer 12

Front/Head - incremented by one

Question 13

Which data structure operates on a FIFO basis?

Answer 13

Queue

First in first out

Question 14

Which data structure operates on a LIFO basis?

Answer 14

Stack

Last in first out

Question 15

Where might a queue be used?

Answer 15

Printer Queue

Keyboard Buffer

Question 16

Where might a stack be used?

Answer 16

Web Browser History

Undo button in a word processor

Question 17

What is the process for pushing an item to a stack?

Answer 17

• If stack is full then report error and stop.
• Else increment pointer
• Add data item at position ‘pointer’

Question 18

What type of error could occur if an item is added to a full stack or queue?

Answer 18

Overflow Error

Question 19

What type of error could occur if an item is removed from to an empty stack or queue?

Answer 19

Underflow Error

Question 20

What is the process for enqueuing an item to a queue?

Answer 20

• If queue is full then report error and stop.
• If not full then increment tail by 1
• Add item to tail index

(Assuming that the pointer is set to point at last item, and not the space after)

Question 21

What is the process for dequeuing an item from a queue?

Answer 21

• Check if the queue is empty, If it is then output message reporting an error.
• If it is not empty, then output the element located at the head
• Increment head by 1

Question 22

What is the process for popping an item from a stack?

Answer 22

• If stack is empty then report error & stop.
• Else output the data at the top
• decrement the top pointer.