3 votes 3 votes Algorithms time-complexity algorithms asymptotic-notation test-series + – pranab ray asked Jan 15, 2018 retagged Jul 13, 2022 by makhdoom ghaya pranab ray 595 views answer comment Share Follow See 1 comment See all 1 1 comment reply vishal chugh commented Jan 15, 2018 reply Follow Share $S_{2}$ and $S_{3}$? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes s2 and s3 are true , s1 false sumit goyal 1 answered Jan 15, 2018 sumit goyal 1 comment Share Follow See all 6 Comments See all 6 6 Comments reply pranab ray commented Jan 15, 2018 reply Follow Share can u plz explain .....about S2 0 votes 0 votes Mk Utkarsh commented Jan 15, 2018 reply Follow Share if f(n) $\leq$ g(n) then 2f(n) $\leq$ 2g(n) 0 votes 0 votes Mk Utkarsh commented Jan 15, 2018 reply Follow Share sumit goyal 1 explain S1 please 0 votes 0 votes sumit goyal 1 commented Jan 16, 2018 reply Follow Share @Mk Utkarsh only way to do is to solve more no. of examples as possible i follow this method only and with help of past experience i solve it , let f(n) = $\frac{1}{n}$ , $(f(n))^{2} = \frac{1}{n^2}$ $\frac{1}{n} \neq O( \frac{1}{n^2})$ take very large values of n its failing , since we find atleast one function which dont satisy option a false 2 votes 2 votes Mk Utkarsh commented Jan 16, 2018 reply Follow Share oh thanks :D 1 votes 1 votes Mohit Kumar 6 commented Apr 17, 2020 reply Follow Share i think statement 2 is false.if i take f(n)=2n,g(n)=n then f(n) and g(n) satisfied f(n)=O(g(n)) but not satisfied in power of 2. 0 votes 0 votes Please log in or register to add a comment.