Menu

Asymptotic Notation Questions

MCQ
21.
O(n^2) means computing time is __________________
forum Discussion
MCQ
22.
O(n^3) means computing time is __________________
forum Discussion
MCQ
23.
O(2^n) means computing time is __________________
forum Discussion
MCQ
24.
Time complexity of given algorithm 

 Algorithm Display (A)
 { 
 For I:=0 to n-1 
   { 
    For J:=0 to n-1 { Write A; }
    }
  }
forum Discussion
MCQ
25.
Given two non-negative functions f(n)= 5n2+6n+1 and g(n)=n2 . Calculate upper bound value ,C
forum Discussion
MCQ
26.
Given two non-negative functions f(n)= 6n2+5n+1 and g(n)=n2 . Calculate lower bound value ,C
forum Discussion
MCQ
27.
The functions f & g are non-negative functions. The function f(n)=O(g(n)) if and only if there exist positive constants c & n0 such that __________ for all n, n≥ n0
forum Discussion
MCQ
28.
The functions f & g are non-negative functions. The function f(n)=Ω(g(n)) if and only if there exist positive constants c & n0 such that ___________ for all n, n≥ n0
forum Discussion
MCQ
29.
The functions f & g are non-negative functions. The function f(n)=θ(g(n)) if and only if there exist positive constants c1,c2 & n0 such that ________for all n, n≥ n0
forum Discussion
MCQ
30.
Tight bound is denoted as _______
forum Discussion