693 views
2 votes
2 votes

Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case. 
Statement I: 2f(n) = O(2g(n))
Statement II: 2g(n) = O(2f(n)

Choose the correct option from the given.

Both correct.

Both incorrect

S1 correct, S2 false

S2 false,S1 correct

Please log in or register to answer this question.

Related questions

2 votes
2 votes
3 answers
1
shubhojit1412 asked May 25, 2019
2,206 views
If $T1(n) = \Theta(f(n))$&$T2(n) = \Theta(f(n))$Then, Is $T1(n) + T2(n) = O(f(n))$If yes, then how?
2 votes
2 votes
1 answer
3
hacker16 asked Jan 21, 2018
871 views
Given h(n) < f(n) < g(n).statement 1: h(n)=O(f(n)); g(n)=Ω(f(n))Statement 1 is True / False?
1 votes
1 votes
0 answers
4
NIKU asked Nov 14, 2017
687 views
int unknown(int n) {inti, j, k = 0;for (i = n/2; i<= n; i++)for (j = 2; j <= n; j = j * 2)k = k + n/2;return k;}What is the returned value of the above function? (GATE CS...