Asymptotic-Notations

Question 1
 
A
g1(n) is O(g2(n))
B
g1 (n) is O(3)
C
g2 (n) is O(g1 (n))
D
g2 (n) is O(n)
E
Both A and B
       Algorithms       Asymptotic-Notations       Gate-1994
Question 1 Explanation: 
In asymptotic complexity, we assume sufficiently large n. So, g1(n) = n2 and g2(n) = n3.
Growth rate of g1 is less than that of g2 i.e., g1(n) = O(g2(n)) = O(n).
There is 1 question to complete.
PHP Code Snippets Powered By : XYZScripts.com