Register

ravula

246 views
0 votes
0 votes

Let f(n) = 1000 n6 +299 n log n and g(n) = 5 n5 log n + 1024 n2. Which of the following is true?( Marks: -0.33 )

  1.   f(n) is O(g(n)), but g(n) is not θ(f(n))
  2.   f(n) is not O(g(n)) and g(n) is not θ(f(n))
  3.   f(n) is not O(g(n)) but g(n) is O(f(n))
    Explanation:
    f(n) is O(n6) while g(n) is O(n5)
  4.   f(n) is O(g(n)) and g(n) is θ(f(n)).

How to infer and solve such question?

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
0 answers
1
ankit_thawal asked Jan 28, 2018
1,128 views
ravula test
T(n) = T(n/2) + 2T(n/5) + T(n/10) + 4n Which of the following is true? T(n) = O(n log2 n) T(n) = O(n2) T(n) = O(n log5 n) T(n) = O(n) How to solve such examples? Should we consider "4n"?Or should it be ignored considering constant in each level?
T(n) = T(n/2) + 2T(n/5) + T(n/10) + 4nWhich of the following is true? T(n) = O(n log2 n) T(n) = O(n2) T(n) = O(n log5 n) T(n) = O(n) How to solve such examples?Shoul...
User Avatar
0 votes
0 votes
1 answer
3
Deepak Singh 7 asked Jul 5, 2018
192 views
Video lecture rv ravula
If there are 'n' processor and 'm' processes then maximum process in block state can be? I think its m-n but answer is 'm' how?
If there are 'n' processor and 'm' processes then maximum process in block state can be? I think its m-n but answer is 'm' how?
User Avatar
0 votes
0 votes
0 answers
4
ankit_thawal asked Feb 1, 2018
437 views
ravula
Let x is a binary number and a function f(x)= 1’s Complement(2’s Complement ( x )) If x= 0110 then f6(x)= ____. Note: fk(x)= f(fk-1(x)) ,k>1.
Let x is a binary number and a functionf(x)= 1’s Complement(2’s Complement ( x ))If x= 0110 then f6(x)= ____.Note: fk(x)= f(fk-1(x)) ,k>1.
User Avatar
Link Copied!