3,4,5,2,1

3,4,5,1,2

5,4,3,1,2

1,5,2,3,4

**Herder node is used as sentinel in ____****Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…****_____ is not the component of data structure.****The complexity of merge sort algorithm is****The complexity of linear search algorithm is****When determining the efficiency of algorithm the time factor is measured by****Merge sort uses ?****The memory address of the first element of an array is called****……………. Is a pile in which items are added at one end and removed from…****______ is very useful in situation when data have to stored and then retrieved in reverse order.****Which data structure allows deleting data elements from and inserting at rear?****Two dimensional arrays are also called****A variable P is called pointer if****A data structure where elements can be added or removed at either end but not in the middle****Linked lists are best suited****Which of the following data structure is not linear data structure?****Which of the following data structure is non linear type?****The memory address of fifth element of an array can be calculated by the formula****Identify the data structure which allows deletions at both ends of the list but insertion at only one…****The term push and pop is related to the****Which of the following statement is false?****Which of the following is true about the characteristics of abstract data types? i) It exports a type.…****The complexity of Binary search algorithm is****Which of the following is not the required condition for binary search algorithm?****Which of the following algorithm design technique is used in the quick sort algorithm?****Which of the following is not the part of ADT description?****Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…****Which if the following is/are the levels of implementation of data structure****Which of the following statement is true ?****The complexity of Bubble sort algorithm is**