true or false big o big theta True or False? Mark the corresponding box. f(n) =
ID: 3577286 • Letter: T
Question
true or false big o big theta
True or False? Mark the corresponding box. f(n) = 3 + 0.5n^6 + log(n) = 0(6^n) ln(n) = Phi (log_2(n)) f(n) = n + n*log(n) = O(n) A Phi(g(n^3) algorithm is 0(g(n)). but not the other way around. A O(1) algorithm is phi(1) A Phi(n^3) algorithm is O(3n) Resource preemption is necessary for getting into a deadlock. TCP/IP is very reliable because it is Real Time. When exchanging information, synchronization can be achieved by encoding the clock in the data. Named pipes cannot be used by tasks that share parent-child relationship. You need to use simple pipes instead.Explanation / Answer
f(n) = 3 + 0.5n^6 + log(n) = O(6^n)
= True
f(n) = 3 + 0.5n^6 + log(n) = O(n^6) < O(6^n)
ln(n) = O(log2(n)) => True
f(n) = n + n*log(n) = O(n) => False
(n) = n + n*log(n) = O(nlogn)
O(1) is Theta(1) => True
Theta(n^3) is O(3n) => False
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.