LOC(Array[5]=Base(Array)+w(5-lower bound), where w is the number of words per memory cell for the array

LOC(Array[5])=Base(Array[5])+(5-lower bound), where w is the number of words per memory cell for the array

LOC(Array[5])=Base(Array[4])+(5-Upper bound), where w is the number of words per memory cell for the array

None of above

**To represent hierarchical relationship between elements, Which data structure is suitable?****The difference between linear array and a record is****A data structure where elements can be added or removed at either end but not in the middle****Which data structure is used in breadth first search of a graph to hold nodes?****The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort…****The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a…****A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called…****_______ level is where the model becomes compatible executable code****Two main measures for the efficiency of an algorithm are****Which of the following name does not relate to stacks?****The operation of processing each element in the list is known as****Inserting an item into the stack when stack is not full is called _______ Operation and deletion of…****Arrays are best data structures****Which of the following data structure is non linear type?****The complexity of linear search algorithm is****Which of the following is true about the characteristics of abstract data types? i) It exports a type.…****When determining the efficiency of algorithm the time factor is measured by****Which of the following data structure can't store the non-homogeneous data elements?****Finding the location of the element with a given value is:****The number of possible ordered trees with three nodes A,B,C is?****Each array declaration need not give, implicitly or explicitly, the information about****Which of the following algorithm design technique is used in the quick sort algorithm?****If the values of a variable in one module is indirectly changed by another module, this situation is…****Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case…****The memory address of the first element of an array is called****Which of the following is not a limitation of binary search algorithm?****Which if the following is/are the levels of implementation of data structure****When new data are to be inserted into a data structure, but there is no available space; this situation…****A ______ is a data structure that organizes data similar to a line in the supermarket, where the first…****Which of the following case does not exist in complexity theory**