Dark Mode

Recent questions tagged asymptotic-notation

0 votes

1 answer

391

Using Recurrence tree method solve the following Recurrence
T(n)=T(n-1) + n4

LavTheRawkstar asked in Algorithms Feb 1, 2017

by LavTheRawkstar

575 views

2 votes

2 answers

392

Using Recurrence Tree method solve for the following Recurrence Relation
T(n)= 3$T(\frac{n}{4})$ + θ(n2)

LavTheRawkstar asked in Algorithms Jan 31, 2017

by LavTheRawkstar

1.2k views

3 votes

11 answers

393

UGC NET CSE | January 2017 | Part 3 | Question: 31
The asymptotic upper bound solution of the recurrence relation given by $T(n) = 2T \left( \frac{n}{2} \right) +\frac{n}{\lg \: n}$ is $O(n^2)$ $O(n \:\lg \: n )$ $O(n \:\lg \:\lg \: n)$ $O(\lg \:\lg \: n)$

go_editor asked in Algorithms Jan 31, 2017

5.2k views

1 vote

1 answer

394

Solve the following Recurrence using Substitution(.ie Guess Method only)
Solve using Substitution method for finding the upper bound T(n)=T(n-1)+1

LavTheRawkstar asked in Programming in C Jan 30, 2017

by LavTheRawkstar

668 views

1 vote

1 answer

395

Solve using Substitution method (.i.e Guess method only) for finding the Upper Bound
Solve 1) T(n) = 8T(n/2) + n2 a)T(n)= O(n3) True or False ? b)T(n)=O(2n) True or False ?

LavTheRawkstar asked in Algorithms Jan 30, 2017

by LavTheRawkstar

823 views

1 vote

1 answer

396

Time Complexity
main() { int (b=1;b<=n;b*=2) { for(i=0;i<b;i++) { for(j=0;j<n;j+=2) { sum+=j; } for(j=0;j<n;j*=2) { sum*=j; } } } what is the complexity? }

Aboveallplayer asked in Algorithms Jan 29, 2017

by Aboveallplayer

1.5k views

1 vote

1 answer

397

Time complexity
What will be the time complexity of: T(n)=n½ * T(n½) + n ? I tried by substitution by taking m=n^½ but I'm not getting the answer that way.

Purple asked in Algorithms Jan 29, 2017

by Purple

305 views

4 votes

2 answers

398

Time Complexity
Suppose that each row of an n x n array A consists of 1's and 0's such that in any row of A, all the 1's come before any 0's in that row. Assuming A is already in memory, what is the complexity of the most efficient algorithm for finding the row of A that contains the most 1's? A. $O(n2)$ B. $O(logn)$ C. $O(n)$ D. $O(nlogn)$

Samujjal Das asked in Algorithms Jan 23, 2017

by Samujjal Das

1.8k views

1 vote

0 answers

399

which has higher growth rate?
Which grows faster when n increases? $I. n^{\frac{1}{3}}<\frac{n}{logn} II. n^{\frac{1}{3}}>\frac{n}{logn}$

firki lama asked in Algorithms Jan 18, 2017

437 views

0 votes

1 answer

400

Test by Bikram | Mock GATE | Test 1 | Question: 32
Let $f\left ( n \right )$m $g\left ( n \right )$ and $h\left ( n \right )$ ... the above is/are incorrect? $(d)$ $only$ $(c)$ $only$ $(b)$ $and$ $(d)$ $only$ $(b)$ $and$ $(c)$ $only$

Bikram asked in Algorithms Jan 16, 2017

by Bikram

675 views

2 votes

3 answers

401

Test by Bikram | Mock GATE | Test 1 | Question: 24
The internet host is roughly doubling in size every $18$ $months$. Although no one really knows for sure, one estimate put the number of hosts on it at $7$ million in January $1996$. Using these data the expected number of internet hosts in January $2008$ is _____ billion.

Bikram asked in Probability Jan 16, 2017

by Bikram

855 views

3 votes

2 answers

402

Time complexity

reena_kandari asked in Algorithms Jan 10, 2017

by reena_kandari

454 views

2 votes

1 answer

403

Compare
Which of the following two is correct? If f(n) = Ο(g(n)) then h(f(n)) = Ο(h(g(n))) If f(n) ≠ Ο(g(n)) then g(n) = Ο(f(n))

thor asked in Algorithms Jan 10, 2017

by thor

318 views

0 votes

1 answer

404

Algorithms: Finding time complexity
T(n)=2T(log n)+c c is a constant. Base condition is if(n<2) return 1 What will be the tightest bound on time complexity?

Naveen Pandey asked in Algorithms Jan 8, 2017

by Naveen Pandey

499 views

1 vote

0 answers

405

which one is correct

vaishali jhalani asked in Algorithms Jan 7, 2017

by vaishali jhalani

242 views

0 votes

1 answer

406

Madeeasy test series
f(n)=Ω(n) g(n)=Ω($n^{2}$) then f(n)+g(n) is? 1)Ω(n) 2)ϴ(n) 3)Ω($n^{2}$) 4)Ο(n)

Swagarika Giri asked in Algorithms Jan 6, 2017

by Swagarika Giri

281 views

1 vote

1 answer

407

Algorithm-asymptotic analysis
=====>f(n)=3n^2+4n+2. What will be the exact value for f(n) a) theta(n^2) b)o(n^2) c)O(n^2) d)omega(n^2) Please provide the reason too. ======>f(n)=o(g(n)) if and only if a)g(n)=omega(f(n)) b)g(n)=small omega(f(n)) c) g(n)=omega(f(n)) and g(n)=small omega(f(n)) d) None of these. Please provide reason.

Agam asked in Algorithms Jan 4, 2017

by Agam

2.2k views

1 vote

1 answer

408

Algorithm Doubt
Assume we are given that f(n) = Οg(n), then which of the following can be stated true 2f(n) = Ο(2g(n)) log f(n) = Ο(log (g(n)) g(n) ≠ Ω f(n) None of these

Çșȇ ʛấẗẻ asked in Algorithms Jan 3, 2017

by Çșȇ ʛấẗẻ

206 views

0 votes

1 answer

409

Virtual Gate Test Series: Algorithms - Order Of The Algorithm
An algorithm is made up of $2$ modules $M_{1}$ and $M_{2}.$ If order of $M_{1}$ is $f(n)$ and $M_{2}$ is $g(n)$ then the order of the algorithm is$:$ $\text{max (f (n) ,g (n))}$ $\text{min (f (n) ,g (n))}$ $\text{f (n) + g (n)}$ $\text{f (n) $\times$ g (n )}$

firki lama asked in Algorithms Dec 29, 2016

5.4k views

0 votes

1 answer

410

Gate Practice Question
for n>=0 , if f(n)<g(n) and h(n)<g(n) . How many of the following are false. ? 1. f(n) is O(h(n)). 2.f(n) is not O(g(n)). 3.f(n)+h(n) is O(g(n)). 4.g(n) is not O(f(n)). 5.f(n)*h(n) is O(g(n)).

Ravi_1511 asked in Algorithms Dec 25, 2016

252 views

0 votes

1 answer

411

Testbook Question

Shivangi Verma asked in Algorithms Dec 23, 2016

by Shivangi Verma

259 views

3 votes

1 answer

412

MadeEasy Subject Test: Algorithms - Asymptotic Notations
run(n) { if(n<=2) return 1; else return run(log(n)+log(n)); } Which of the following represents the running time for run(n) function? a> O(log n) b> O(log log(n)) c> O(log * n) d> O(n) Can someone provide a detailed solution?

sourojit asked in Algorithms Dec 21, 2016

408 views

22 votes

3 answers

413

TIFR CSE 2017 | Part A | Question: 4
Which of the following functions asymptotically grows the fastest as $n$ goes to infinity? $(\log \: \log \: n)!$ $(\log \: \log \: n)^ {\log \: n}$ $(\log \: \log \: n)^{\log \: \log \: \log \: n}$ $(\log \: n)^{\log \: \log \: n}$ $2^{\sqrt{\log \: \log \: n}}$

go_editor asked in Algorithms Dec 21, 2016

4.0k views

2 votes

1 answer

414

MadeEasy Subject Test: Algorithms - Asymptotic Notations

debanjan sarkar asked in Algorithms Dec 20, 2016

by debanjan sarkar

517 views

3 votes

1 answer

415

Big o Time complexity
What will be upper bound for following function? T(n)=n^2 - n^4 a) O(n^2) b) O(n^3) c) O(n^4) d) None of these I want to understand how the function looks like if it has recurrance of this form?What is meaning of subtraction here if i talk in terms of programming

rahul sharma 5 asked in Algorithms Dec 18, 2016

by rahul sharma 5

720 views

0 votes

1 answer

416

order of expression

iita asked in Algorithms Dec 16, 2016

by iita

514 views

0 votes

1 answer

417

NOTATIONS(BIG O,BIG OMEGA,THETA)

santhoshdevulapally asked in Algorithms Dec 12, 2016

by santhoshdevulapally

712 views

0 votes

1 answer

418

Asymptotic complexity
If f(n) = O(g(n)), is log(f(n)) = O(log(g(n))) ? I just learnt today that this relation does not hold, because log changes the behavior of the functions. But is it true? An example will be good. Any help is appreciated.

roni95 asked in Algorithms Dec 11, 2016

by roni95

537 views

0 votes

2 answers

419

MadeEasy Test Series: Algorithms - Asymptotic Notations
what if i take f(x) = sinx, g(x)= cosx? these two cant be compared. sinx cant be written as O(cosx) and also cosx cant be written as O(sinx) then B becomes invalid. plz verify

Anusha Motamarri asked in Algorithms Dec 5, 2016

by Anusha Motamarri

1.6k views

0 votes

1 answer

420

Asymptotic Notations DAA
$f(x) = n^{log (n)}$ $g(x) = nlog (n)$ $h(x) = 2^{n}$ Arrange Them in Increasing Order of rate of growth

PEKKA asked in Algorithms Dec 5, 2016

by PEKKA

347 views

Page:

« prev
1
...
9
10
11
12
13
14
15
16
17
18
19
next »

Recent questions tagged asymptotic-notation