Let f(n) and g(n) be asymptotically positive functions. Statement I: f(n) ≥ 1 and f(n) = O(g(n)) ⇒ g(n) = Ω(f(n)). Statement II: f(n) = O(g(n)) ⇒ lg(f(n)) = O(lg(g(n))), where lg(g(n)) ≥ 1 and f(n) ≥ 1 for all sufficiently large n. Choose the most appropriate answer.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. Both Statement I and Statement II are correct
Explanation
I is the transpose symmetry of O and Ω. For II, f ≤ c·g gives lg f ≤ lg c + lg g ≤ (lg c + 1)·lg g once lg g ≥ 1, so lg f = O(lg g). Both hold (CLRS Problem 3-4).
More Data Structures and Algorithms questions
- A. If some NP-complete problem P is in 𝒫, then 𝒫 = 𝒩𝒫. B. TSP is in 𝒩𝒫. C. SAT is in 𝒩𝒫. D. The Hamiltonian circuit problem is not NP-compl…
- Suppose a circular queue of capacity n-1 elements is implemented with an array of n elements. Assume that the insertion and deletion operat…
- Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: The AVL trees are more b…
- Consider a hash table of size seven with starting (6x + 3) mod 4 index zero and a hash function . Assuming the hash table is initially empt…
- Match List I with List II
- 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 s…