Question:

Sometimes, on calling a customer service center, the Interactive Voice Response System (IVRS) tells us to wait till a support person is available. Which data structure this application is of?

Show Hint

Whenever you encounter waiting lines, buffering, print spooling, or task scheduling, the underlying data structure is a Queue.
Updated On: Sep 7, 2026
  • Enqueue
  • Binary Tree
  • Stack
  • Queue
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is D

Solution and Explanation

Concept:
Real-world waiting lines where the earliest arriving participant is served first operate under the First-In-First-Out (FIFO) paradigm.
In computer science, this scheduling policy is implemented using a Queue data structure.

Step 1: Analyzing the Call Center IVRS Mechanism:

When multiple customers call customer support, agents can only assist one person at a time.
Callers who arrive while all agents are busy are placed on hold in a waiting line.
The caller who has been waiting the longest (arrived first) is connected to the next available agent.
This directly implements First-In-First-Out (FIFO) order: the first call entering the queue is the first one attended to.

Step 2: Evaluating the Options:

- Queue: The data structure that stores items in FIFO order.
- Stack: A LIFO structure where the newest caller would be answered first, which is unfair for customer support.
- Binary tree: A hierarchical structure used for searching or sorting, not linear waiting queues.
- Enqueue: The operation of adding an element to a queue, not a data structure itself.
Final Answer:
The waiting line system in IVRS is an application of a Queue. Thus, option (D) is the correct answer.
Was this answer helpful?
0
0