1
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
Suppose T(n) = 2T (n/2) + n, T(0) = T(1) = 1
Which one of the following is FALSE?
Which one of the following is FALSE?
2
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
Let T(n) be the function defined by $$T(1) =1, \: T(n) = 2T (\lfloor \frac{n}{2} \rfloor ) + \sqrt{n}$$
Which of the following statements is true?
Which of the following statements is true?
3
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
The recurrence relation
T(1) = 2
T(n) = 3T(n/4) + n
has the solution, T(n) equals to
T(1) = 2
T(n) = 3T(n/4) + n
has the solution, T(n) equals to
4
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
Quicksort is run on two inputs shown below to sort in ascending order taking first element as pivot
i) 1, 2, 3,......., n
ii) n, n-1, n-2,......, 2, 1
Let C1 and C2 be the number of comparisons made for the inputs (i) and (ii) respectively. Then,
i) 1, 2, 3,......., n
ii) n, n-1, n-2,......, 2, 1
Let C1 and C2 be the number of comparisons made for the inputs (i) and (ii) respectively. Then,
Questions Asked from Divide and Conquer Method (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages