Bright Tutorials Bright Tutorials
CBSE Class 12 Computer Science Question 25 of 63

Data Structures in Python — Question 8

Back to all questions
8
Question

Question 8

A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a:

  1. Queue
  2. Stack
  3. Tree
  4. Linked list
Answer

Queue

Reason — A queue is represented as a linear list where insertion (enqueue) can be performed at one end (rear) and deletion (dequeue) can be performed at the other end (front). This characteristic of queues follows the First-In-First-Out (FIFO) principle.