Best case

Null case

Worst case

Average case

**The difference between linear array and a record is****Which of the following data structure is non linear type?****When determining the efficiency of algorithm, the space factor is measured by****A data structure where elements can be added or removed at either end but not in the middle****The memory address of fifth element of an array can be calculated by the formula****Two main measures for the efficiency of an algorithm are****Which of the following is not the part of ADT description?****Herder node is used as sentinel in ____****Which one of the following permutations can be obtained the output using stack assuming that the input…****The memory address of the first element of an array is called****Stack is also called as****The complexity of Binary search algorithm is****Which of the following is two way list?****In linear search algorithm the Worst case occurs when****Finding the location of the element with a given value is:****Which data structure allows deleting data elements from and inserting at rear?****Binary search algorithm can not be applied to****When determining the efficiency of algorithm the time factor is measured by****Linked list are not suitable data structure of which one of the following problems ?****A variable P is called pointer if****Which of the following data structure is linear data structure?****Which of the following data structure is linear type?****Linked lists are best suited****Which of the following data structure is not linear data structure?****The complexity of Bubble sort algorithm 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 data structures are indexed structures?****Identify the data structure which allows deletions at both ends of the list but insertion at only one…****Which of the following data structure store the homogeneous data elements?****Which of the following name does not relate to stacks?**