Company: Tescra MCQ
Difficulty: medium
An array B[1][20] is stored as column wise, B[2][2] is stored at 1024, and B[3][3] is stored at 1084. What will be the address of B[5][3]? 1100 1104 1094 1098 An element is added in max heap of height h. The maximum time required to add an element into existing heap of n elements is: O(hlogn) O(h) O(n) O(nlogn) Determine the sorting technique in which an array divides a list into sublists by using pivot elements such that items to the left of pivot are less and items to the right of pivot are more. Selection sort Insertion sort Internal sorting algorithm Quick sort Which of the given statements specifies the following code? "INCREASE-KEY(S, x, k): increases value of element x's key to k. Assume k ≥ x's current key value." Max-priority queue Avg-priority queue None of the given options Min-priority queue Heapsort uses a min-heap to improve upon which of the following sorting algorithms? Shell sort Insertion sort Selection sort Bubble sort Consider a 2-D array A[5..10][5..10] stored in r