Dark Mode

Recent questions tagged logarithmic-function

0 votes

2 answers

1

Unacademy-Test-series
Can anyone explain this?

raja11sep asked in Algorithms Feb 13, 2022

431 views

0 votes

2 answers

2

Slowness and Fastness of any algorithm
How the slowness and the fastness of any algorithm depends ? Is (n/logn) is slower than log(logn) ?

dragonball asked in Algorithms Aug 2, 2018

270 views

2 votes

1 answer

3

Self doubt algorithms
In coremen it is given that $\log^kn$=$(\log n)^k$ $\log\log n$ is not equal to $\log^2n$ i understood it with example please correct me if I am wrong .

Prince Sindhiya asked in Algorithms Jul 31, 2018

by Prince Sindhiya

201 views

1 vote

3 answers

4

Algorithm substitution method
How to find log n base2+ log n base 3+ log n base4+........log n base n?

Tushar Garg asked in Algorithms Jul 4, 2018

1.3k views

0 votes

1 answer

5

TEST SERIES
Let f(n) = 18 n4 +20 n log n and g(n) = 9758 n3 log n + 9565 n2. Which of the following is true?( Marks: -0.33 ) f(n) is not O(g(n)) and g(n) is not O(f(n)) f(n) is O(g(n)), but g(n) is not O(f(n)) g(n) is O(f(n)), but f(n) is not O(g(n)) f(n) is O(g(n)) and g(n) is O(f(n)).

ankit_thawal asked in Algorithms Jan 10, 2018

by ankit_thawal

448 views

1 vote

1 answer

6

madeeasy test series
Consider the following functions: $f1=n^{\log n}$ $f2=2^n$ $f3=2^{\sqrt{n}}$ Which of the following is true with regard to asymptotic growth? A. $f1\leq f3\leq f2$ B. $f3\leq f1\leq f2$

garg div asked in Algorithms Jan 8, 2018

218 views

1 vote

1 answer

7

test series
Arrange the following functions in asymptotically increasing order f1(n) = n0.999999 log n f2(n) = 10000000n Please explain your solution. Thanks

Tridhara Chakrabarti asked in Algorithms Dec 24, 2017

by Tridhara Chakrabarti

341 views

3 votes

1 answer

8

Which of the following options provides the increasing order of asymptotic complexity of functions
Which of the following options provides the increasing order of asymptotic complexity of functions(Note: Consider log base 2) a) f1(n)=n logn log logn b) f2(n)=(n!)^1/n c) f3(n)=(n^n^(0.5)) d) ... ^n At first glance I thought f2 grow faster but i was wrong. Ans : f2,f4,f1,f3 Please can somebody help.

sunil sarode asked in Algorithms Dec 19, 2017

by sunil sarode

2.2k views

2 votes

1 answer

9

groowth rate
N log (N2) N1.5 which will grow faster

A_i_$_h asked in Algorithms Nov 14, 2017

133 views

1 vote

2 answers

10

Algo doubt
iterated logarithmic function is defined as $\log^*n = \begin{cases} 0 &\text{if }\quad n\leq 0 \\1 +\log^*(\log n) &\text{if } \quad n >1\end{cases}$ Which of the following is true? $\log^*n = O(\log(\log n ))$ $(\log^*n)!= O(\log n)$ $\log^* n = \Theta(\log n)$ $(\log^*n)^n= O((\log n)!)$

Surya Dhanraj asked in Algorithms Oct 15, 2017

by Surya Dhanraj

478 views

1 vote

1 answer

11

Time Complexity
log(log*n) and log*(logn) Which function is in order of other??

NIHAR MUKHIYA asked in Algorithms Jul 4, 2017

by NIHAR MUKHIYA

196 views

1 vote

2 answers

12

Algorithm
Is n^2 2^(3log base 2 n) = theta (n^5).

Sidd_ asked in Algorithms Jun 4, 2017

by Sidd_

288 views

0 votes

1 answer

13

coremen
what is difference between log*log n and log(log*n)?

shebya nautiyal asked in Algorithms Apr 5, 2017

by shebya nautiyal

200 views

4 votes

2 answers

14

Arnabi asked in Algorithms Jan 8, 2017

by Arnabi

312 views

0 votes

1 answer

15

Asymptotic functions
When can i used logarithms to compare two functions asymptotically? What is the procedure and rules? If we have n^2 ans n^3..if we compare using logarithms..thwn they tuen out to be asymptotically equal.should i then compare them by "not" ignoring the constant terms?.

suchismith roy asked in Algorithms Nov 13, 2016

by suchismith roy

304 views

4 votes

1 answer

16

Testbook test series #Big-Oh

Prajwal Bhat asked in Algorithms Aug 26, 2016

by Prajwal Bhat

365 views

1 vote

1 answer

17

#made easy
Big oh estimate for f(x)=(x+1)log($x^2 +1$)+3$x^2$ is given as 1.O(xlogx) 2.O($x^2$) 3.O($x^3$) 4O($x^2$logx)

Hira Thakur asked in Algorithms Aug 15, 2016

822 views

0 votes

1 answer

18

Is logloglogx same as log^3(x) same as (logx)^3?
It is given in CLRS book chapter 3, page no. 56 that lg^k(n) = (lg n)^k. Can somebody please give me an example or check if my example is correct? Shoudn't lg^k(n) be { lg lg lg..... k times (n) }?

deepti asked in Algorithms Jul 31, 2016

by deepti

343 views

0 votes

1 answer

19

Difference between two below functions
What is the difference between $\log^m n$ and $(\log n)^m.$ Can anyone explain?

piyushkr asked in Algorithms Jan 11, 2016

137 views

1 vote

1 answer

20

Order of growth
Arrange the following functions in ascending order according to their order of growths. $\begin{align} f_1 &= 100000 \cdot n\\[1em] f_2 &= \frac1{30} \cdot n^2\\[1em] f_3 &= (\log n)^{200}\\[1em] f_4 &= 2^n\\[1em] f_5 &= n \cdot \log n \end{align}$

prathams asked in Algorithms Jan 10, 2016

1.5k views

1 vote

1 answer

21

Solve for x :
I have an equation $X\log(X)=\log N$. Can anybody solve for $X$ from this equation?

Riya Roy(Arayana) asked in Algorithms Nov 9, 2015

by Riya Roy(Arayana)

232 views

2 votes

3 answers

22

which of the functions is greater ?
F1 =(logn)! F2=(log(n!)) F3 = (logn)^logn Just one query n! would be a constant rght , so in F1 we are taking factorial of a constant while in second one we are taking log of a constant so definitely F2 should be less than F1 .Am I correct or wrong at this point ?

radha gogia asked in Algorithms Oct 5, 2015

1.5k views

4 votes

1 answer

23

$(\log n)!$ and $(\log \log n)!$ are polynomially bounded ? anybody can prove?

naveenagrahari asked in Algorithms Jul 10, 2015

by naveenagrahari

4.2k views

1 vote

3 answers

24

which of the following is correct
which of the following is correct?

Anu asked in Algorithms May 18, 2015

by Anu

705 views

To see more, click for the full list of questions or popular tags.

Recent questions tagged logarithmic-function