engineering recuitment NIC NIELIT Scientist B 2023 Mock Test Algorithms Asymptotic Worst Case Time and Time Complexity Asymptotic Notations
Consider the following statements:
(I). If \(f(n)= \Omega(g(n))\) and \(g(n)=O(f(n))\) then \(f(n)=\theta(g(n))\).
(II). If a graph \(G\) has \(n\) vertices and \(\theta(n)\) edges then Prim's algorithms to find MST takes \(n^2logn\) time.
Which of the above statement/s is/are TRUE?
1
(I) only
2
(II) only
3
Both
4
Neither