discrete mathematics question 6 Big and big ahera m us work
discrete mathematics
question 6
Solution
Q6)
a) log2 to the base 73 n will be greater than n, hence the minimum order will be O(n)
Hence the statement is FALSE
b) log2(n^(73) = O(log2 n)
The statement is TRUE
Since log2(n^73) = 73log2(n), hence if we keep the value of c as 74 in the expression, f(n)<= c.g(n), hence the statement will be true
(c) log2n^n = nlog2n, which is not bounded by O(log2n)
Hence the statement is FALSE
(d) (n^(0.5) + 1)^4 = O(n^2)
TRUE,since the maximum power in the expression will be (n^0.5)^4 = n^2
Hence it will be bounded by O(n^2)
