The abstract data structure in which data are added at the rear and deleted…
2023
The abstract data structure in which data are added at the rear and deleted from the front is called:
- A.
Stack
- B.
Queue
- C.
Linked list
- D.
More than one of the above
- E.
None of the above
Attempted by 1214 students.
Show answer & explanation
Correct answer: B
Correct answer: Queue
The statement describes the FIFO operation pattern of a queue: insertion happens at the rear and deletion happens from the front.
Queue: this is the abstract data structure defined by enqueue at the rear and dequeue from the front.
Linked list: this is an implementation structure. A linked list can be used to implement a queue, but a linked list by itself does not enforce this rear/front FIFO rule.
Stack: this follows LIFO behavior, where insertion and deletion happen at the same end.
So only queue directly matches the behavior asked in the question.