Computer Science · Design and Analysis of Algorithms
Given below are two statements where f(n) and g(n) are 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)) ⇒ log(f(n)) = O(log(g(n))) where log(g(n)) ≥ 1 for all sufficiently large n. In the light of the above statements, choose the most appropriate answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Both Statement I and Statement II are correct✓
- 2Both Statement I and Statement II are incorrect
- 3Statement I is correct but Statement II is incorrect
- 4Statement I is incorrect but Statement II is correct
Correct answer
Both Statement I and Statement II are correct
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Design and Analysis of Algorithms MCQs →Want more practice questions on Design and Analysis of Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Design and Analysis of Algorithms