Which data structure only allows removing data elements from front and inserting at rear?A ) QueuesB ) None of these answers are correctC ) Binary search treeD ) Linked ListsE ) Stacks

Which of the following data structures allows to insert elements from one end and remove them from the same end?Group of answer choicesDequeCircular QueueBoth Deque and StackStack

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle is?a) Queueb) Circular queuec) Dequeued) Priority queue

A data structure in which elements can be inserted or deleted at/from both the ends but not in the middle:AQueueBCircular queueCDequeueDPriority queue

91. Which of the following data structures are indexed structures?#a) linear arraysb) linked listsc)Dequesd) Treese)Stacks92. Which of the following is not the required condition for binary search algorithm?a) The list must be sortedb) there should be the direct access to the middle element in any sublist#c)There must be mechanism to delete and/or insert elements in listd) The list must be partitionede) none of the above93. Which of the following is not a limitation of binary search algorithm?a) must use a sorted arrayb) requirement of sorted array is expensive when a lot of insertion and deletions areneededc)there must be a mechanism to access middle element directly#d) binary search algorithm is not efficient when the data elements are more than 1000.e) both a and b94. A variable P is called pointer if#a)P contains the address of an element in DATA.b) P points to the address of first element in DATAc) P can store only memory addressesd) P contain the DATA and the address of DATAe) P can store only the DATA95. Which of the following data structure can't store the non-homogeneous data elements?#a)Arraysb) Recordsc)Pointersd) LinkedListe)Trees96. Which of the following data structure store the homogeneous data elements?

Retrieval operation is fastest in which data structure a) Heapb) Stack c) Linked list d) None