Identify the data structure which allows deletions at both ends of the – McqOptions

MCQOPTIONS

1.	Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
A.	Input restricted dequeue
B.	Output restricted dequeue
C.	Priority queues
D.	Stack
Answer» B. Output restricted dequeue

Discussion

No Comment Found

Related MCQs

Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Which of the following data structure can't store the non-homogeneous data elements?
If a host on a network has the address 172.16.45.14/30, what is the subnetwork this host belongs to?
Which of the following is true when describing a multicast address?
What will be output of following program        #include<stdio.h> #include<string.h> int main(){ int a = 5,b = 10,c; int *p = &a,*q = &b; c = p - q; printf("%d" , c); return 0; }
What is split horizon?