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 2013
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object in to a binary search tree of n nodes?
A
O(1)
B
O(log n)
C
O(n)
D
O(n log n)
2
GATE CSE 2013
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
A
O(log n)
B
O(n)
C
O(n log n)
D
O(n2)
3
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
The worst case running time to search for an element in a balanced binary search tree with n2n elements is
A
$$\Theta (n\,\log \,n)$$
B
$$\Theta (n{2^n})$$
C
$$\Theta (n)$$
D
$$\Theta (\log \,n)$$
4
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
A
$$A(n) = \Omega (W(n))$$
B
$$A(n) = \Theta (W(n))$$
C
$$A(n) = O (W(n))$$
D
$$A(n) = 0 (W(n))$$
Previous Next
Questions Asked from Marks 1
GATE CSE 2025 Set 2 (1) GATE CSE 2025 Set 1 (1) GATE CSE 2024 Set 2 (1) GATE CSE 2024 Set 1 (1) GATE CSE 2023 (1) GATE CSE 2022 (1) GATE CSE 2021 Set 1 (1) GATE CSE 2020 (1) GATE CSE 2017 Set 1 (1) GATE CSE 2015 Set 3 (1) GATE CSE 2013 (3) GATE CSE 2012 (2) GATE CSE 2010 (1) GATE CSE 2007 (1) GATE CSE 2006 (1) GATE CSE 2005 (1) GATE CSE 2003 (2) GATE CSE 2002 (1) GATE CSE 2001 (1) GATE CSE 1999 (1) GATE CSE 1997 (1) GATE CSE 1996 (1)
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