Question
A programmer needs task scheduling and buffering, and the chosen structure has the property that insertion occurs at the rear and removal at the front. Which choice fits best?
Select an option. Your answer will be checked instantly.
Correct Answer: D. Queue
Explanation:
Queue fits because it supports task scheduling and buffering and insertion occurs at the rear and removal at the front.
Both clues point to this choice.
Leave a Reply