Given below are two statements:
Statement I: If f and g are two functions and f = O(g) g ≠ o(f) but , we say that the growth rate of g is smaller than that of f
Statement II: The class of all decision problems decided by a TM in exponential time, that is O(2k) k , being a constant. In the light of the above statements, choose the most appropriate answer from the options given below.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. Both Statement I and Statement II are incorrect
Explanation
If f = O(g) and g ≠ o(f), then f and g grow at the same rate; g is not smaller than f, so Statement I is false. EXPTIME is decided in O(2^(nᵏ)) time — exponential in a power of n — not O(2ᵏ) for a constant k, so Statement II is false.
More Data Structures and Algorithms questions
- Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: It is possible to create…
- Given six weights 4, 15, 25, 5, 8, 16, construct a 2-tree (binary tree). What is the minimum weighted path length?
- Consider: A. The number of labelled binary trees possible with n nodes is (2n)!/(n + 1)!. B. The number of binary search trees possible wit…
- Which of the following are correct about Hamiltonian problems? A. The Hamiltonian cycle problem is NP-complete. B. If G is an undirected bi…
- For matrix multiplication with a simple divide-and-conquer algorithm: A. the running time is T(n) = Θ(n³) B. the running time is T(n) = Θ(n…
- Match List I with List II