ExamSIDE
Questions (Powered by ExamGOAL)
Algorithms
Complexity Analysis and Asymptotic Notations
Marks 1Marks 2
Searching and Sorting
Marks 1Marks 2
Divide and Conquer Method
Marks 1Marks 2
Greedy Method
Marks 1Marks 2
P and NP Concepts
Marks 1Marks 2
Dynamic Programming
Marks 1Marks 2
Previous Next
1
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
The solution to the recurrence equation
T(2k) = 3 T(2k-1) + 1, T (1) = 1, is:
A
2k
B
(3k+1 - 1)/2
C
3 log 2K
D
2 log 3K
2
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using randomized quicksort?
A
O(n)
B
O(n Log n)
C
O(n2)
D
O(n!)
3
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s. which of the following statements is true?
A
t (n) is O(1)
B
n < t (n) < $$n\log _2^n$$
C
$$n\log _2^n$$ < t (n) < $$\left( {\matrix{ n \cr 2 \cr } } \right)$$
D
t(n) = $$\left( {\matrix{ n \cr 2 \cr } } \right)$$
4
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
If one uses straight two-way merge sort algorithm to sort the following elements in ascending order 20, 47, 15, 8, 9, 4, 40, 30, 12, 17 then the order of these elements after the second pass of the algorithm is:
A
8, 9, 15, 20, 47, 4, 12, 17, 30, 40
B
8, 15, 20, 47, 4, 9, 30, 40, 12, 17
C
15, 20, 47, 4, 8, 9, 12, 30, 40, 17
D
4, 8, 9, 15, 20, 47, 12, 17, 30, 40
Previous Next
Questions Asked from Marks 1
GATE CSE 2021 Set 2 (2) GATE CSE 2021 Set 1 (1) GATE CSE 2019 (1) GATE CSE 2014 Set 3 (2) GATE CSE 2014 Set 2 (1) GATE CSE 2014 Set 1 (1) GATE CSE 2009 (1) GATE CSE 2003 (1) GATE CSE 2002 (1) GATE CSE 2001 (1) GATE CSE 2000 (1) GATE CSE 1999 (2) GATE CSE 1995 (3)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization