Multiple choice

Which data structure allows deleting data elements from front and inserting at rear ends?

  1. Stacks

  2. Queues

  3. Linked list

  4. Bubble sort
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Queues are specifically designed as FIFO (First-In-First-Out) data structures where elements are removed from the front and inserted at the rear. Stacks use LIFO order (last-in-first-out). Linked lists allow insertion/deletion at any position, and bubble sort is a sorting algorithm, not a data structure.

Keep practicing — related questions