Traversal

Search

Sort

None of above

**Which of the following algorithm design technique is used in the quick sort algorithm?****Which of the following data structures are indexed structures?****Which of the following is two way list?****Which one of the following permutations can be obtained the output using stack assuming that the input…****Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…****Linked lists are best suited****Which of the following is not the required condition for binary search algorithm?****______ is very useful in situation when data have to stored and then retrieved in reverse order.****Stack is also called as****Two dimensional arrays are also 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…****The Average case occur in linear search algorithm****Which of the following statement is true ?****Which of the following data structure is linear type?****If the values of a variable in one module is indirectly changed by another module, this situation is…****Which of the following data structure is non linear type?****_______ level is where the model becomes compatible executable code****Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…****Binary search algorithm can not be applied to****The memory address of fifth element of an array can be calculated by the formula****Which of the following is not a limitation of binary search algorithm?****A variable P is called pointer if****Which of the following data structure can't store the non-homogeneous data elements?****The operation of processing each element in the list is known as****_____ is not the component of data structure.****A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…****For an algorithm the complexity of the average case is****Which data structure allows deleting data elements from and inserting at rear?****The elements of an array are stored successively in memory cells because****When determining the efficiency of algorithm, the space factor is measured by**