Time Left - 10:00 mins
GATE CS 2018 - Algorithms Quiz 3 (Divide & Conquer-1)
Attempt now to get your rank among 830 students!
Question 1
What is recurrence relation for the worst case of Quicksort and time complexity in the Worst case of Quick Sort respectively?
Question 2
What will be the recursion of T(n) = 2 T(n / 2) + cn?
Question 3
Consider the Quick sort algorithm. Suppose there is a procedure for finding a pivot element which splits the list into two sub-lists each of which contains at least one-fifth of the elements. Let T(n) be the number of comparisons required to sort n elements. Then
Question 4
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 5
A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is
- 830 attempts
- 2 upvotes
- 32 comments
Tags :
GATE & PSU CSAlgorithmsJun 25GATE & PSU CS
