1
GATE CSE 1992
Subjective
+2
-0
Assume that the last element of the set is used as partition element in Quicksort. If n distinct elements from the set [1…n] are to be sorted, give an input for which Quicksort takes maximum time.
2
GATE CSE 1987
MCQ (Single Correct Answer)
+2
-0.6
Let P be a quicksort program to sort numbers in ascending order. Let t1 and t2 be the time taken by the program for the inputs [1 2 3 4] and [5 4 3 2 1], respectively. Which of the following holds?
3
GATE CSE 1987
Subjective
+2
-0
Find a solution to the following recurrence equation
T(n) = T(n - 1)+ n
T(1) = 1
T(n) = T(n - 1)+ n
T(1) = 1
Questions Asked from Divide and Conquer Method (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude