Dark Mode

Recent questions tagged asymptotic-notation

0 votes

0 answers

181

Doubt : Made Easy OTS
Why not option B as F(n)= O( F(n) ) is trivial ?

HeadShot asked in Algorithms Nov 30, 2018

231 views

0 votes

1 answer

182

Time Complexity

Avir Singh asked in Algorithms Nov 28, 2018

600 views

0 votes

2 answers

183

selfas
f(n) + O(f(n)) = Θ(f(n)) True or not? Explain please

Vegeta asked in Algorithms Nov 17, 2018

by Vegeta

574 views

0 votes

0 answers

184

Time Complexity
How to solve the following recurrence relation? T(n) = T(n-6) + n2 , n>7 T(n) = 1 , n<= 7

garvit_vijai asked in Algorithms Nov 17, 2018

by garvit_vijai

471 views

4 votes

0 answers

185

GATEBOOK_DS_1_12_Asymptotic_Notations
Which of the following is the correct order if they are ordered by asymptotic growth rates? $F_1:n^{lg\,lgn}$ $F_2:(3/2)^n$ $F_3:(lg\,n)^{lg\, n}$ $F_4:n!$ $F_3$ can be re-written as $n^{lg\,lgn}$ using property $a^{log_bc}=c^{log_ba}$ So, $F_4 \gt F_2 \gt F_1=F_3$ Is my order correct?

Ayush Upadhyaya asked in Algorithms Nov 14, 2018

by Ayush Upadhyaya

682 views

0 votes

1 answer

186

test series - Testbook
Which of the following functions given by their recurrences grows the fastest asymptotically? $T(n) = 8T(n/4) + 100n^2$ $T(n) = 81T(n/9) + 10n^2$ $T(n) = 16T(n/4)+ 100(n \log n)^{1.99}$ $T(n) = 100T(n/100)+ n \log^2 n$

Shubham Aggarwal asked in Algorithms Nov 13, 2018

by Shubham Aggarwal

1.2k views

1 vote

0 answers

187

Time Complexity for an infinite loop
What is the time complexity for infinite loops Question 1 what is T(n) for this case While(1) { a=a+b; } Question 2 for this case if(1) { for i to n a=a+b } else { for i to n for j to n a=a+b } Edit 2: Compiled the code ... ); return 0; } output I get is 8 6 which means the else case is never executed hence in worst case do we have to consider the else part.

sripo asked in Algorithms Nov 6, 2018

by sripo

2.0k views

1 vote

1 answer

188

Asymptotic Notations with condition
Identify the FALSE statement: $A)$ $f(n)=\theta(f(\frac{n}{2})$ $implies$ $f(n^{2})=\theta(f(\frac{n^{2}}{2}))$ $B)$ $f(n)=O(g(n))$ $implies$ $log(f(n))=O(log(g(n)))$ where $n\geq2$ $C)$ $f(n)=O(g(n))$ $implies$ $2^{f(n)}=O(2^{g(n)})$ $D)$ $f(n)+g(n)=\theta(Max(f(n),g(n)))$

Lakshman Bhaiya asked in Algorithms Nov 1, 2018

by Lakshman Bhaiya

662 views

1 vote

2 answers

189

Asymptotic Notations
Consider the following statements: $(1)$ Any two functions $f,g$ are always comparable under big Oh,that is $f=O(g)$ or $g=O(f)$ $(2)$ If $f=O(g)$ and $f=O(h)$ then $g(n)=\theta(h)$ $A)$ $(1)$ is true $(2)$ is false $B)$ $(1)$ is false $(2)$ is true $C)$ Both are false $D)$ Both are true

Lakshman Bhaiya asked in Algorithms Nov 1, 2018

by Lakshman Bhaiya

1.1k views

0 votes

1 answer

190

asymptotic notations
√logx = O(loglogx) is it true or false? and explain why?

suneetha asked in Algorithms Oct 29, 2018

328 views

1 vote

1 answer

191

Time Complexity
how to compute time complexity of this kind of recurrence relation- T(n)=T(n/2)+T(n/4)+T(n/8)+n

aditi19 asked in Algorithms Oct 27, 2018

873 views

0 votes

1 answer

192

TANCET 2011 ALGORITHMS
Suppose f, g, h, k : N → N. If f = O(h) and g = O(k), then 1) f + g = O(h + k) 2) fg = O(hk) 3) Both 1 and 2 4) None of the above

Balaji Jegan asked in Algorithms Oct 23, 2018

by Balaji Jegan

521 views

0 votes

1 answer

193

Algorithms doubt
If f (n), g(n) and h(n) are non-decreasing complexity functions. if f(n) ∈ O(h(n)), what is the relation between f(n) and (g ◦ h(n) + c), for any constant c ≥ 0, where a ◦ b is the composite function of a and b. A f(n) ∈ O(g ◦ h(n) + c), B f(n) ∈ $\Theta$(g ◦ h(n) + c), C f(n) ∈$\Omega$(g ◦ h(n) + c), D none ?

hitendra singh asked in Algorithms Oct 16, 2018

by hitendra singh

802 views

0 votes

1 answer

194

Asymptotic notations
Consider the following statements: S1: f(n) = O(f(n)²) S2: If f(n) = O(g(n)) then ${2^{f(n)}}$ = O(${2^{g(n)}}$) S3: If f(n) = O(g(n)) and h(n) = Ɵ(g(n)) then f(n)•h(n) = O(g(n)•h(n)) Which of the statements are correct?? (A) only S2 (B) only S3 (C) both S1 and S2 (D) both S2 and S3.

Verma Ashish asked in Algorithms Oct 3, 2018

by Verma Ashish

924 views

1 vote

1 answer

195

MadeEasy Test Series: Algorithms - Asymptotic Notations

mitesh kumar asked in Algorithms Oct 2, 2018

by mitesh kumar

465 views

0 votes

1 answer

196

time complexity
If both of the algorithms A and B need O(nlogn) time then they both are equally efficient and finish in same amount of time. TRUE OR FALSE

sushmita asked in Algorithms Sep 28, 2018

627 views

1 vote

6 answers

197

Can we solve the recurrence T(n) = T(n/2) + 2^n by masters theorem, if possible?
I was wondering whether the recurrence T(n) = T(n/2) + 2n could be solved by using master theorem, and what would be the way. I tried solving the recurrence but can't. There is no mention to it in CLRS book. Please help. Thanks in advance.

mohitrai0_0 asked in Algorithms Sep 28, 2018

19.0k views

0 votes

1 answer

198

MIT assigment
Arrange the following functions in their increasing order of complexities. $f(n) = n ^{0.999999} * \log n$ ($\log n$ is not in power) $g(n) = 10000 n$ $h(n) = n^{2}$ $k(n) = (1.000001)^{n}$ $p(n) =\large \frac{2 ^{√n}}{ n^{2}}$ $q(n) = \Large \frac{n^{1.000001}}{\log n}$

sushmita asked in Algorithms Sep 28, 2018

1.8k views

0 votes

0 answers

199

mit assignment
State true/false f(n) != O(g(n)) and g(n) != O(f(n))

sushmita asked in Algorithms Sep 28, 2018

357 views

0 votes

0 answers

200

Cormen Appendix A
Why does (1/3+1/c) <=1?

Noddy asked in Algorithms Sep 22, 2018

by Noddy

242 views

0 votes

0 answers

201

himgta asked in Algorithms Sep 22, 2018

by himgta

198 views

0 votes

1 answer

202

Asymptotic-notations
f(n)=2(log2 n)2 , g(n)=log2n+1 How to give relation between them?.

Vishnathan asked in Algorithms Sep 22, 2018

436 views

0 votes

1 answer

203

time-complexcity
for(i=0;i<n;i++) for(j=0;j<i;j++) for(k=0;k<j;k++) what is the time complexity of above psudo code? explain.

balaganesh asked in Algorithms Sep 21, 2018

477 views

0 votes

1 answer

204

Algorithms Complexity

Vaishnavi01 asked in Algorithms Sep 20, 2018

734 views

0 votes

0 answers

205

Time Complexity
Please help with the following in Time Complexity. 1)Show that the following order-of-magnitude results hold: a)3n=O(n!) b)(n3 -2n)/(n+1)=theta(n2) c)n3 /log(n+1)=O(n3) but not O(n2) 2)What is wrong with the following argument? x=O(n4),y=O(n2),therefore x/y=O(n2). 3) What is ... the following argument? f(n)=O(n2)+O(n), so that f(n)-g(n)=O(n2 )+O(n)-O(n2). Therefore, f(n)-g(n)=O(n)

Devshree Dubey asked in Algorithms Sep 10, 2018

by Devshree Dubey

498 views

1 vote

0 answers

206

Order of growth
1.What is exact difference between order of growth of the function and asymptomatic growth of the functions? Please suggest on above point.

Mayankprakash asked in Algorithms Sep 7, 2018

by Mayankprakash

354 views

0 votes

0 answers

207

Algorithm
How is Σ (1/k * log k) = O( n log n) for k=1 to n?

Nidhi Budhraja asked in Algorithms Sep 7, 2018

by Nidhi Budhraja

341 views

2 votes

1 answer

208

Algorithms timeComplexity
It answer is given as A but according to me answer should be C. Please help

I_am_winner asked in Algorithms Sep 6, 2018

534 views

0 votes

1 answer

209

Algorithms Questions
f(n)>=c1.n h(n)=c2.n then why answer cant be O(n),It is given as C

I_am_winner asked in Algorithms Sep 6, 2018

373 views

0 votes

1 answer

210

I_am_winner asked in Algorithms Sep 6, 2018

233 views

Page:

« prev
1
2
3
4
5
6
7
8
9
10
11
12
...
19
next »

Recent questions tagged asymptotic-notation