1
GATE CSE 2002
+2
-0.6
The running time of the following algorithm Procedure A(n)
If n<=2 return (1) else return (A([$$\sqrt n$$])); is best described by
A
O(n)
B
O(log n)
C
O(log log n)
D
O(1)
2
GATE CSE 2000
+2
-0.6
Consider the following functions
$$f(n) = 3{n^{\sqrt n }}$$
$$g(n) = {2^{\sqrt n {{\log }_2}n}}$$
$$h(n) = n!$$
Which of the following is true?
A
h(n) is O (f(n))
B
h(n) is O (g(n))
C
g(n) is not O (f(n))
D
f(n) is O (g(n))
3
GATE CSE 1994
+2
-0.6
Conside the following two functions:
$${g_1}(n) = \left\{ {\matrix{ {{n^3}\,for\,0 \le n < 10,000} \cr {{n^2}\,for\,n \ge 10,000} \cr } } \right.$$
$${g_2}(n) = \left\{ {\matrix{ {n\,for\,0 \le n \le 100} \cr {{n^3}\,for\,n > 100} \cr } } \right.$$ Which of the following is true:
A
$${g_1}(n)\,is\,0\,({g_2}(n))$$
B
$${g_1}(n)\,is\,0\,({n^3})$$
C
$${g_2}(n)\,is\,0\,({g_1}(n))$$
D
$${g_2}(n)\,is\,0\,(n)$$
4
GATE CSE 1993
+2
-0.6
$$\sum\limits_{1 \le k \le n} {O(n)}$$ where O(n) stands for order n is:
A
O(n)
B
O(n2)
C
O (m3)
D
O(3n2)
GATE CSE Subjects
EXAM MAP
Medical
NEET