Binary search

Insertion sort

Radix sort

Polynomial manipulation

**Identify the data structure which allows deletions at both ends of the list but insertion at only one…****A variable P is called pointer if****For an algorithm the complexity of the average case is****Which of the following is not the part of ADT description?****Linked list are not suitable data structure of which one of the following problems ?****Which of the following is two way list?****Which of the following data structure cant store the non-homogeneous data elements?****In linear search algorithm the Worst case occurs when****The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…****Which of the following data structures are indexed structures?****Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…****Which of the following is true about the characteristics of abstract data types? i) It exports a type.…****Which of the following is not a limitation of binary search algorithm?****Which data structure allows deleting data elements from and inserting at rear?****Which of the following algorithm design technique is used in the quick sort algorithm?****When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return****Which of the following is not the required condition for binary search algorithm?****Which of the following data structure can't store the non-homogeneous data elements?****The complexity of Binary search algorithm is****When determining the efficiency of algorithm the time factor is measured by****Which if the following is/are the levels of implementation of data structure****______ is very useful in situation when data have to stored and then retrieved in reverse order.****A data structure where elements can be added or removed at either end but not in the middle****The elements of an array are stored successively in memory cells because****Two main measures for the efficiency of an algorithm are****When new data are to be inserted into a data structure, but there is no available space; this situation…****Arrays are best data structures****The complexity of Bubble sort algorithm is****When determining the efficiency of algorithm, the space factor is measured by****Finding the location of the element with a given value is:**