Time complexity for binary search is equal to

a$)(nlogn)$

b$)(logn)$

c$)(n)$

d$)(n^2)$

For the relation $10**n=O(2**),$ which of the following is correct values for

constants and $n_0?$

a$)c=1,$ and $n_0=1.$

b$)c=1,$ and $n_0=2.$

c$)c=2,$ and $n_0=2.$

d$)c=2,$ and $n_0=3.$

Which operator strictly describes relationship between the following functions?

$f(n)=2^n$;$g(n)=10n^2.$

a$)$ Big$-$Theta

b$)$ Little$-$Omega

c$)$ Big$-O$

d$)$ Little $-$ o

Let $f(n)=|log{2}^n|$ and $g(n)=n^2,$ circle the correct answer that reflect the best

relation between the two given functions?

a$)f(n)=O(g(n))$

$f(x)g(x)$

b$)f(n)=(g(n))$

c$)f(n)=(g(n))$

d$)g(n)=(f(n))$

If $f(n)=(g(n)),$ then $g(n)=O(h(n)).$ Which of the following is correct

a$)f(n)=(h(n))$

b$)f(n)=(h(n))$

c$)f(n)=0(h(n))$

d$)h(n)=O(f(n))$