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:
A
O (n)
B
O (n log n)
C
O (n3/2)
D
O (n3)
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
A
$$\Theta \,(1)$$
B
$$\Theta \,(\log n)$$
C
$$\Theta \,(n)$$
D
$$\Theta \,({n^2})$$
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?
A
I and II
B
I and III
C
II and III
D
I, II and III
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
A
log n
B
n/2
C
Log2 n - 1
D
n
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12