Register

What is the simplification of the below mentioned expression -

323 views

1 Answer

3 votes
3 votes

Ans: 2

Just apply formula  alog ab  = b

we have ,2log2log2n   = log2n

Hence questions reduces to    n1/log2n  = nlogn2 = 2

hence simplified value is '2'

User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
piyushkr asked Dec 31, 2015
1,715 views
Below question asked in GATE 1993. In this 1<=k<=n mentioned however k not using anywhere in notation.
$\sum(range - 1<=k<=n) O(n)$, where O(n) stands for order n is -a) O(n) b) O(n2)c) O(m3) d) O(3n2)
User Avatar
0 votes
0 votes
4 answers
2
piyushkr asked Jan 21, 2016
1,599 views
What is the meaning of wake up() operation in the up() binary operation, Definition is mentioned below.
Up(Semaphore S) { if (Suspended list() is empty) S.value=1; else { Select a process from the suspended list and WakeUp() } }
User Avatar
0 votes
0 votes
0 answers
3
usdid asked Apr 16, 2022
282 views
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation using the Master's theorem. c) What is the same repeated equation in asymptotic notation using the recursion tree method.
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation usin...
User Avatar
Link Copied!