Master Stacks and Queues: Interactive Learning Quizzes for Computer Science MEng Students

Question 1

For implementing Depth-First Search (DFS), which data structure is appropriate?

Accepted Answer

Stack

Answer

Queue

Answer

Linked List

Answer

Array

Question 2

For a queue implementation using an array, what is the time complexity of the enqueue operation?

Accepted Answer

O(1)

Answer

O(n)

Answer

O(log n)

Answer

O(n^2)

Question 3

To determine if a stack is empty, which method should be used?

Accepted Answer

isEmpty()

Answer

size()

Answer

top()

Answer

clear()

Question 4

What is the key difference between a circular queue and a regular queue?

Accepted Answer

Circular queues allow for wrapping around the underlying array, while regular queues do not

Answer

Regular queues have faster enqueue operations than circular queues

Answer

Circular queues require less memory than regular queues

Answer

There is no significant difference between circular and regular queues

Question 5

Which of the following operations is not valid for a queue?

Accepted Answer

Push

Answer

Enqueue

Answer

Dequeue

Answer

Peek

Question 6

What is the time complexity of the push operation in a stack?

Accepted Answer

O(1)

Answer

O(n)

Answer

O(log n)

Answer

O(n^2)

Question 7

Which data structure is most suitable for implementing undo/redo functionality in a text editor?

Accepted Answer

Stack

Answer

Queue

Answer

Linked List

Answer

Array

Question 8

What is the distinction between a stack and a queue in terms of their operational order?

Accepted Answer

Stacks follow LIFO (Last In First Out), while queues follow FIFO (First In First Out).

Answer

Queues follow LIFO (Last In First Out), while stacks follow FIFO (First In First Out).

Answer

Stacks and queues both follow LIFO (Last In First Out).

Answer

Stacks and queues both follow FIFO (First In First Out).

Question 9

In a circular queue, what happens when the insertion point reaches the end of the array?

Accepted Answer

The insertion point wraps around to the beginning of the array.

Answer

An error occurs.

Answer

The queue becomes full and no more elements can be inserted.

Answer

The queue is resized to accommodate more elements.

Question 10

What is the primary difference between a deque and a queue?

Accepted Answer

A deque allows insertions and deletions at both ends, while a queue only allows insertions at one end and deletions at the other.

Answer

A deque only allows insertions at one end and deletions at the other, while a queue allows insertions and deletions at both ends.

Answer

A deque is implemented using an array, while a queue is implemented using a linked list.

Answer

There is no difference between a deque and a queue.

Question 11

A priority queue processes elements based on their:

Accepted Answer

Priority

Answer

Arrival time

Answer

Size

Answer

Type

Question 12

Which of the following accurately describes the key characteristic of a stack data structure?

Accepted Answer

Last-in, first-out (LIFO)

Answer

First-in, first-out (FIFO)

Answer

Random-in, random-out (RIRO)

Answer

First-in, last-out (FILO)

Question 13

Consider a queue implemented using an array. What is the time complexity of a dequeue operation?

Accepted Answer

O(1)

Answer

O(n)

Answer

O(log n)

Answer

O(n^2)

Question 14

Which of the following scenarios best illustrates the LIFO nature of a stack?

Accepted Answer

A stack of books

Answer

A queue of people in a grocery store

Answer

A linked list of elements

Answer

A binary search tree

Question 15

Consider a situation where requests need to be processed in the order they arrive, with urgent requests prioritized. Which data structure would be most appropriate?

Accepted Answer

Priority queue

Answer

Stack

Answer

Queue

Answer

Binary tree

Question 16

Explain the key difference between array and linked list implementations of a stack.

Accepted Answer

Array implementation offers faster performance but has a fixed size, while linked list implementation is slower but more flexible

Answer

Linked list implementation offers faster performance but has a fixed size, while array implementation is slower but more flexible

Answer

There is no difference between array and linked list implementations of a stack

Answer

Array implementation is only suitable for primitive data types, while linked list implementation can store complex objects

Question 17

What is the main advantage of a circular queue compared to a regular queue?

Accepted Answer

Circular queues are more efficient when the number of elements varies frequently

Answer

Circular queues can accommodate more elements than regular queues

Answer

Circular queues support faster enqueue and dequeue operations

Answer

Circular queues require less memory than regular queues

Question 18

Which data structure adheres to the Last In First Out (LIFO) principle?

Accepted Answer

Stack

Answer

Queue

Answer

Linked list

Answer

Array

Question 19

In which scenario is a stack data structure most effectively applied?

Accepted Answer

Evaluating function calls

Answer

Traversing a binary tree

Answer

Managing a print job queue

Question 20

What is the primary distinction between stacks and queues?

Accepted Answer

Order of element retrieval

Answer

Storage capacity

Answer

Underlying data structure

Answer

Time complexity of operations

Question 21

Which advantage does a queue offer over a stack?

Accepted Answer

FIFO order ensures fair resource allocation

Answer

More efficient implementation

Answer

Faster access to the last inserted element

Answer

Reduced memory overhead

Question 22

What is the time complexity of dequeuing an element from a circular queue?

Accepted Answer

O(1)

Answer

O(n)

Answer

O(log n)

Answer

O(n^2)

Question 23

What is a core principle in the implementation of a priority queue?

Accepted Answer

Comparing and ordering elements based on priorities

Answer

Maintaining a sorted array of elements

Answer

Using a hash table to store elements

Question 24

Which data structure is best suited for implementing a breadth-first search (BFS) algorithm?

Accepted Answer

Queue

Answer

Stack

Answer

Binary tree