1
GATE CSE 2003
+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})$$
2
GATE CSE 2003
+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
3
GATE CSE 2002
+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
4
GATE CSE 2001
+1
-0.3
Let f(n) = n2 log n and g(n) = n(log n)10 be two positive functions of n. Which of the following statements is correct?
A
f(n) = O(g(n)) and g(n) ≠ O(f(n))
B
g(n) = O(f(n)) and f(n) ≠ O(g(n))
C
f(n) ≠ O(g(n)) and g(n) ≠ O(f(n))
D
f(n) = O(g(n)) and g(n) = O(f(n))
GATE CSE Subjects
EXAM MAP
Medical
NEET