If a queue is implemented as the ADT list,which of the following queue operations can be implemented as list.remove(1)?
A)enqueue()
B)dequeue()
C)isEmpty()
D)peek()

Question

Quizplus · Accepted Answer

Removing an element from the front of a list can be implemented as dequeuing operation in a queue implemented using the ADT list. Therefore, option B is the correct choice. Enqueue() inserts an element at the end of the list, isEmpty() checks if the list is empty or not, and peek() returns the element at the front of the list but it does not remove it, so these operations cannot be implemented using list.remove(1).

If a Queue Is Implemented as the ADT List,which of the Following