floor address

foundation address

first address

base address

**Merge sort uses ?****Linked list are not suitable data structure of which one of the following problems ?****The operation of processing each element in the list is known as****Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…****Which of the following is not a limitation of binary search algorithm?****Arrays are best data structures****The complexity of merge sort algorithm is****Identify the data structure which allows deletions at both ends of the list but insertion at only one…****……………. Is a pile in which items are added at one end and removed from…****Which of the following case does not exist in complexity theory****For an algorithm the complexity of the average case is****Each array declaration need not give, implicitly or explicitly, the information about****Which if the following is/are the levels of implementation of data structure****The situation when in a linked list START=NULL is****______ is very useful in situation when data have to stored and then retrieved in reverse order.****Which of the following data structure cant store the non-homogeneous data elements?****Which of the following is not the part of ADT description?****The memory address of fifth element of an array can be calculated by the formula****The complexity of Bubble sort algorithm is****Which of the following is non-liner data structure?****_______ level is where the model becomes compatible executable code****Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…****Finding the location of the element with a given value is:****In linear search algorithm the Worst case occurs when****The difference between linear array and a record is****Which of the following data structure store the homogeneous data elements?****The elements of an array are stored successively in memory cells because****Which of the following data structure is linear type?****A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…****Which one of the following permutations can be obtained the output using stack assuming that the input…**