Suppose we create a deque (double-ended queue) data structure. It is basically a queue, with its addLast and removeFirst operations, but we also add the addFirst and removeLast operations. Which of the following is best modeled by the deque data structure?
A) A toll booth on a highway.
B) A cross country race.
C) A computer keyboard typing buffer.
D) A Memorial Day parade.

Question

Quizplus · Accepted Answer

A computer keyboard typing buffer can be modeled by a deque as it allows characters to be added at the end (addLast) and removed from the front (removeFirst), while also allowing for corrections or changes by adding or removing characters from the front or back.

Suppose We Create a Deque (Double-Ended Queue) Data Structure