Operations

Algorithms

Storage Structures

None of above

**Merge sort uses ?****The elements of an array are stored successively in memory cells because****Which data structure allows deleting data elements from and inserting at rear?****Linked list are not suitable data structure of which one of the following problems ?****Which of the following algorithm design technique is used in the quick sort algorithm?****Which data structure is used in breadth first search of a graph to hold nodes?****……………. Is a pile in which items are added at one end and removed from…****A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…****Which of the following is two way list?****In linear search algorithm the Worst case occurs when****Which of the following is not a limitation of binary search algorithm?****The complexity of Binary search algorithm is****Which of the following data structure can't store the non-homogeneous data elements?****The situation when in a linked list START=NULL is****Which of the following is true about the characteristics of abstract data types? i) It exports a type.…****The Average case occur in linear search algorithm****Arrays are best data structures****Which of the following data structure cant store the non-homogeneous data elements?****The operation of processing each element in the list is known as****The memory address of fifth element of an array can be calculated by the formula****The complexity of merge sort algorithm is****The term push and pop is related to the****Which of the following data structure store the homogeneous data elements?****Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…****To represent hierarchical relationship between elements, Which data structure is suitable?****Which of the following data structure is not linear data structure?****When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return****If the values of a variable in one module is indirectly changed by another module, this situation is…****Two main measures for the efficiency of an algorithm are****Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…**