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

asked in Algorithms by Junior (895 points) | 124 views
0
$S_{2}$ and $S_{3}$?

1 Answer

+1 vote

s2  and s3  are true  ,  s1 false  

answered by Boss (12.2k points)
0
can u plz explain .....about S2
0

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

0

 sumit goyal 1 explain S1 please 

+2

@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

+1
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

40,731 questions
47,461 answers
145,501 comments
62,219 users