must use a sorted array

requirement of sorted array is expensive when a lot of insertion and deletions are needed

there must be a mechanism to access middle element directly

binary search algorithm is not efficient when the data elements are more than 1000.

**Which of the following data structure cant store the non-homogeneous data elements?****Which of the following is true about the characteristics of abstract data types? i) It exports a type.…****If the values of a variable in one module is indirectly changed by another module, this situation is…****Merge sort uses ?****Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…****When new data are to be inserted into a data structure, but there is no available space; this situation…****Which of the following data structure can't store the non-homogeneous data elements?****In linear search algorithm the Worst case occurs when****The operation of processing each element in the list is known as****Which data structure is used in breadth first search of a graph to hold nodes?****Linked list are not suitable data structure of which one of the following problems ?****The Average case occur in linear search algorithm****The memory address of the first element of an array is called****The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…****For an algorithm the complexity of the average case is****The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…****Which of the following data structure is linear type?****The complexity of merge sort algorithm is****Finding the location of the element with a given value is:****To represent hierarchical relationship between elements, Which data structure is suitable?****Which of the following algorithm design technique is used in the quick sort algorithm?****A data structure where elements can be added or removed at either end but not in the middle****The memory address of fifth element of an array can be calculated by the formula****Which data structure allows deleting data elements from and inserting at rear?****Arrays are best data structures****______ is very useful in situation when data have to stored and then retrieved in reverse order.****Which one of the following permutations can be obtained the output using stack assuming that the input…****When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return****Two dimensional arrays are also called****Which of the following data structure is linear data structure?**