Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Questions  >  Which one of the following statement is True ... Start Learning for Free
Which one of the following statement is True and all positive functions f (n) ?
  • a)
    f (n2) = Ω(f(n)2)
  • b)
    f(n2) = O(f(n)2)
  • c)
    f(n2) = θ (f(n)2), when f(n) is a polynomial
  • d)
    f (n2) = O(f(n)2) , when f(n) is an exponential function. 
Correct answer is option 'C'. Can you explain this answer?
Most Upvoted Answer
Which one of the following statement is True and all positive function...
A: It need not be true for a function which is decreasing.
B: An exponential function may be increasing or decreasing, so this condition may not always be true.
C: It always holds because if we square the input variable, then the highest order in the polynomial will also get squared.
D: It is not true in cases when f (n) is a polynomial function.
Free Test
Community Answer
Which one of the following statement is True and all positive function...
The given statement is incomplete. Please provide the complete statement or options for a correct answer.
Explore Courses for Computer Science Engineering (CSE) exam

Top Courses for Computer Science Engineering (CSE)

Which one of the following statement is True and all positive functions f (n) ?a)f (n2) = Ω(f(n)2)b)f(n2) = O(f(n)2)c)f(n2) = θ (f(n)2), when f(n) is a polynomiald)f (n2) = O(f(n)2) , when f(n) is an exponential function.Correct answer is option 'C'. Can you explain this answer?
Question Description
Which one of the following statement is True and all positive functions f (n) ?a)f (n2) = Ω(f(n)2)b)f(n2) = O(f(n)2)c)f(n2) = θ (f(n)2), when f(n) is a polynomiald)f (n2) = O(f(n)2) , when f(n) is an exponential function.Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Which one of the following statement is True and all positive functions f (n) ?a)f (n2) = Ω(f(n)2)b)f(n2) = O(f(n)2)c)f(n2) = θ (f(n)2), when f(n) is a polynomiald)f (n2) = O(f(n)2) , when f(n) is an exponential function.Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Which one of the following statement is True and all positive functions f (n) ?a)f (n2) = Ω(f(n)2)b)f(n2) = O(f(n)2)c)f(n2) = θ (f(n)2), when f(n) is a polynomiald)f (n2) = O(f(n)2) , when f(n) is an exponential function.Correct answer is option 'C'. Can you explain this answer?.
Solutions for Which one of the following statement is True and all positive functions f (n) ?a)f (n2) = Ω(f(n)2)b)f(n2) = O(f(n)2)c)f(n2) = θ (f(n)2), when f(n) is a polynomiald)f (n2) = O(f(n)2) , when f(n) is an exponential function.Correct answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Which one of the following statement is True and all positive functions f (n) ?a)f (n2) = Ω(f(n)2)b)f(n2) = O(f(n)2)c)f(n2) = θ (f(n)2), when f(n) is a polynomiald)f (n2) = O(f(n)2) , when f(n) is an exponential function.Correct answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Which one of the following statement is True and all positive functions f (n) ?a)f (n2) = Ω(f(n)2)b)f(n2) = O(f(n)2)c)f(n2) = θ (f(n)2), when f(n) is a polynomiald)f (n2) = O(f(n)2) , when f(n) is an exponential function.Correct answer is option 'C'. Can you explain this answer?, a detailed solution for Which one of the following statement is True and all positive functions f (n) ?a)f (n2) = Ω(f(n)2)b)f(n2) = O(f(n)2)c)f(n2) = θ (f(n)2), when f(n) is a polynomiald)f (n2) = O(f(n)2) , when f(n) is an exponential function.Correct answer is option 'C'. Can you explain this answer? has been provided alongside types of Which one of the following statement is True and all positive functions f (n) ?a)f (n2) = Ω(f(n)2)b)f(n2) = O(f(n)2)c)f(n2) = θ (f(n)2), when f(n) is a polynomiald)f (n2) = O(f(n)2) , when f(n) is an exponential function.Correct answer is option 'C'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Which one of the following statement is True and all positive functions f (n) ?a)f (n2) = Ω(f(n)2)b)f(n2) = O(f(n)2)c)f(n2) = θ (f(n)2), when f(n) is a polynomiald)f (n2) = O(f(n)2) , when f(n) is an exponential function.Correct answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
Explore Courses for Computer Science Engineering (CSE) exam

Top Courses for Computer Science Engineering (CSE)

Explore Courses
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev