1
GATE CSE 2013
MCQ (Single Correct Answer)
+1
-0.3
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
2
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
3
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?
4
GATE CSE 2010
MCQ (Single Correct Answer)
+1
-0.3
Two alternate packages A and B are available for processing a database having 10k records. Package A requires 0.0001n2 time units and package B requires $$10n.\log _{10}^n$$ time units to process n records. What is the smallest value of k for which package B will be preferred over A?
Questions Asked from Complexity Analysis and Asymptotic Notations (Marks 1)
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