Time Left - 15:00 mins
Optimal Merge Pattern II Starter Quiz
Attempt now to get your rank among 68 students!
Question 1
Choose the incorrect statement about merge sort from the following?
Question 2
What will be the recursion of T(n) = 2 T(n / 2) + cn?
Question 3
The minimum number of comparisons required in order to find the maximum and minimum of 64 numbers using divide and conquer is equal to ________.
Question 4
A sorting technique is called stable if?
Question 5
What is the time complexity for counting the inversion pairs in an array size of n, using merge sort?
Question 6
Assume that a merge sort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?
Question 7
Suppose there are 4 stored lists of n/4 elements each. If we merge these lists into a single sorted list of n element, how many key comparisons in the worst case using an efficient algorithm?
- 68 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSGeneralAug 3GATE & PSU CS
