3 additions and 2 deletions

2 deletions and 3 additions

3 deletions and 4 additions

3 deletions and 3 additions

**When determining the efficiency of algorithm, the space factor is measured by****A variable P is called pointer if****To represent hierarchical relationship between elements, Which data structure is suitable?****A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…****When determining the efficiency of algorithm the time factor is measured by****Which of the following data structure is not linear data structure?****In linear search algorithm the Worst case occurs when****……………. Is a pile in which items are added at one end and removed from…****The operation of processing each element in the list is known as****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 is not the required condition for binary search algorithm?****The term push and pop is related to the****Which of the following case does not exist in complexity theory****The Average case occur in linear search algorithm****Which of the following data structure is non linear type?****The complexity of linear search algorithm is****Which of the following data structure store the homogeneous data elements?****The complexity of Bubble sort algorithm is****Each array declaration need not give, implicitly or explicitly, the information about****Identify the data structure which allows deletions at both ends of the list but insertion at only one…****The memory address of fifth element of an array can be calculated by the formula****Which of the following statement is false?****Each data item in a record may be a group item composed of sub-items; those items which are indecomposable…****Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…****The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…****Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…****Which of the following algorithm design technique is used in the quick sort algorithm?****The difference between linear array and a record is****Finding the location of the element with a given value is:****Which of the following is true about the characteristics of abstract data types? i) It exports a type.…**