The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
+3 votes

asked in Algorithms by Active (1.7k points) | 60 views
$S_{2}$ and $S_{3}$?

1 Answer

+1 vote

s2  and s3  are true  ,  s1 false  

answered by Veteran (14.7k points)
can u plz explain .....about S2

if f(n) $\leq$ g(n) then 2f(n) $\leq$ 2g(n)

 sumit goyal 1 explain S1 please 

@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

oh thanks  :D

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

33,713 questions
40,262 answers
38,894 users