3 additions and 2 deletions

2 deletions and 3 additions

3 deletions and 4 additions

3 deletions and 3 additions

**Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…****Linked lists are best suited****……………. Is a pile in which items are added at one end and removed from…****The Average case occur in linear search algorithm****Which one of the following permutations can be obtained the output using stack assuming that the input…****The complexity of Bubble sort algorithm is****When determining the efficiency of algorithm the time factor is measured by****Which of the following is not a limitation of binary search algorithm?****Which of the following data structure is linear type?****Which of the following data structure is not linear data structure?****Which of the following data structure is non linear type?****The situation when in a linked list START=NULL is****The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…****Which of the following is not the part of ADT description?****Which of the following data structure can't store the non-homogeneous data elements?****Which if the following is/are the levels of implementation of data structure****Herder node is used as sentinel in ____****For an algorithm the complexity of the average case is****The operation of processing each element in the list is known as****Which of the following statement is false?****A variable P is called pointer if****When determining the efficiency of algorithm, the space factor is measured by****The elements of an array are stored successively in memory cells because****Which of the following is two way list?****Finding the location of the element with a given value is:****Which of the following name does not relate to stacks?****Which of the following is true about the characteristics of abstract data types? i) It exports a type.…****Which of the following data structures are indexed structures?****The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…****The complexity of Binary search algorithm is**