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 cross country race.
B)A toll booth on a highway.
C)A Memorial Day parade.
D)A computer keyboard typing buffer.

Question

Quizplus · Accepted Answer

A computer keyboard typing buffer can benefit from the addFirst and removeLast operations of a deque. As a user types on a keyboard, the characters are added to the buffer at the end, and when the user deletes a character, it is removed from the end. However, if the user needs to undo a character, it should be removed from the beginning of the buffer, which is where the addFirst operation of a deque comes in handy. The other options do not necessarily require a data structure with both addFirst and removeLast operations.

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