One operation that we might want to implement on a Stack and a Queue is full, which determines if the data structure has room for another item to be added. This operation would be useful
A) only if the Queue or Stack is implemented using an array
B) only if the Queue or Stack is implemented using a linked list
C) only for a Queue
D) only for a Stack
E) none of the above, a full operation is not useful at all

Question

Quizplus · Accepted Answer

A) Since the array is a static sized object, if it becomes filled, then any add type of operation, whether it is a List insert, a Queue enqueue or a Stack push, should be prevented. This can be determined by first checking to see if the structure is full or not. This is not necessary if the data structure is implemented using a linked list since (we assume that) there will always be dynamic memory available to add a new element.

One Operation That We Might Want to Implement on a Stack