Computer Science · Asymptotic Notations
सभी धनात्मक फलनों f(n) के लिए निम्नलिखित में से कौन सा कथन सत्य (TRUE) है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1f(n2) = θ(f(n)2), जब f(n) एक बहुपद (polynomial) है✓
- 2f(n2) = o(f(n)2)
- 3f(n2) = O(f(n)2), जब f(n) एक घातांकीय फलन (exponential function) है
- 4f(n2) = Ω(f(n)2)
सही उत्तर देखें
f(n2) = θ(f(n)2), जब f(n) एक बहुपद (polynomial) है
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 Asymptotic Notations MCQs →Want more practice questions on Asymptotic Notations?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Asymptotic Notations