Binary search

Insertion sort

Radix sort

Polynomial manipulation

**Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…****The memory address of fifth element of an array can be calculated by the formula****The complexity of Bubble sort algorithm is****A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…****Merge sort uses ?****Which data structure allows deleting data elements from and inserting at rear?****The Average case occur in linear search algorithm****When new data are to be inserted into a data structure, but there is no available space; this situation…****Which of the following is not the required condition for binary search algorithm?****Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…****Which one of the following permutations can be obtained the output using stack assuming that the input…****Which of the following data structures are indexed structures?****The elements of an array are stored successively in memory cells because****Which of the following data structure is non linear type?****A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…****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 part of ADT description?****The term push and pop is related to the****In linear search algorithm the Worst case occurs when****Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…****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 linear type?****Which data structure is used in breadth first search of a graph to hold nodes?****The complexity of Binary search algorithm is****The number of possible ordered trees with three nodes A,B,C is?****Which of the following statement is true ?****A variable P is called pointer if****Stack is also called as****Finding the location of the element with a given value is:****For an algorithm the complexity of the average case is**