1
GATE CSE 2005
MCQ (Single Correct Answer)
+1
-0.3
The time complexity of computing the transitive closure of a binary relation on a set of elements is known to be:
2
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Consider an array multiplier for multiplying two n bit numbers. If each gate in the circuit has a unit delay, the total delay of the multiplier is
3
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
Consider the following three claims
I. (n + k)m = $$\Theta \,({n^m})$$ where k and m are constants
II. 2n+1 = O(2n)
III. 22n = O(22n)
Which of those claims are correct?
I. (n + k)m = $$\Theta \,({n^m})$$ where k and m are constants
II. 2n+1 = O(2n)
III. 22n = O(22n)
Which of those claims are correct?
4
GATE CSE 2002
MCQ (Single Correct Answer)
+1
-0.3
In the worst case, the number of comparisons needed to search a singly linked list of length n for a given element is
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