In a doubly linked chain implementation of a queue, what is the performance when the dequeue operation
a. o(1)
b. o(n)
c. o(logn)
d. o(n2)

A) O(1)

Explanation:Double linked chain is the type of the data structures that are linked with each other .There are the components that contain the set of records in a queue manner and forms the links which are referred as the nodes.

The operation performed by the dequeue operator is of  eliminating the element which is at the front. So, when the operation of the dequeue operation gets invoked then the functioning of initializing of new dequeue and removing the front value by O(1) method.

leaning back,   no eye contact,   fidgeting in the seat