• edited by
940 views
7 7 votes

Let $T(n)$ be
$$
T(n)=64 T(n / 4)+8^{\log _{2} n}
$$
What will be asymptotic bound on $T(n)?$ 

  1. $\Theta\left(n^ 3(\log n)^ 3\right)$
  2. $\Theta\left(n^ 3\right)$
  3. $\Theta\left(n^ 3 \log n\right)$
  4. $\Theta\left(n^ 4\right)$

3 Answers

3 3 votes
First, notice that $8^{\lg n}=n^{\lg 8}$ (this can be seen by taking $\lg$ of both sides). Since $\log _{4} 64=\lg 8=3$, we use case (ii) of the Master Theorem: $T_{2}(n)=\Theta\left(n^{3} \log n\right).$
1 1 vote

Ans => C

Using master method we solve this problem

A=64 and B=4 and 64 also write as 4^3 

So n^(logb a) become n^3 and

f(n) = 8^(log2 n) we interchange value 8 and n then it become n^(log2 8) => 3 mean n^3 

by master theorem second rule we add logn in f(n) then it become n^3logn

 

Corrrect me if i am wrong😅

0 0 votes

Step 1: Simplify $f(n)$

Using the logarithmic identity $x^{\log_y z} = z^{\log_y x}$:

 

$$f(n) = 8^{\log_2 n} = n^{\log_2 8} = n^3$$

Step 2: Identify Parameters

  • $a = 64$

  • $b = 4$

  • $f(n) = n^3$

Step 3: Compare $f(n)$ to $n^{\log_b a}$

$$n^{\log_b a} = n^{\log_4 64} = n^3$$

Step 4: Apply Case 2 of the Master Theorem

Since $f(n) = \Theta(n^{\log_b a})$, we fall into Case 2:

 

$$T(n) = \Theta(n^{\log_b a} \log n)$$

$$T(n) = \Theta(n^3 \log n)$$

Correct Answer: C. $\Theta(n^3 \log n)$

Answer:
Position:
Show:

Related questions

14 14 votes
4 4 answers
1.8k
1.8k views
GO Classes asked Jun 19, 2022
1,773 views
Let $S(n)$ be$$S(n)=S(n / 2)+\log (n) .$$What will be asymptotic bound on $S(n)$?$\Theta(n \log n)$$\Theta(\log n)$$\Theta(\log \log n)$$\Theta\left((\log n)^ 2\right)$
25 25 votes
3 3 answers
2.7k
2.7k views
GO Classes asked Jun 19, 2022
2,739 views
Let $T(n)=T(a n)+T(b n)+n,$ where $a+b<1$.What will be asymptotic bound on $T(n)?$$\Theta(n)$$\Theta\left(n^ 2\right)$$\Theta(n \log n)$$\Theta((a+b) \log n)$
7 7 votes
2 2 answers
1.0k
1.0k views
GO Classes asked Jun 19, 2022
1,027 views
Let $T(n)$ be$$T(n)=16 T(n / 4)+n^{2}(\log n)^{3}$$What will be asymptotic bound on $T(n)?$$\Theta\left(n^ 2(\log n)^ 3\right)$$\Theta\left(n^ 2(\log n)^ 4\right)$$\Theta...
72 72 votes
3 answers 3 answers
3.7k
3.7k views
GO Classes asked Jun 19, 2022
3,687 views
Let $T(n)=2 T(n / 2)+O(n),$ where "$O$" is big-oh. What will be asymptotic bound on $T(n)?$$\Theta(n)$$\Theta(n \log n)$$\Theta\left(n^ 2\right)$$O\left(n^ 3\right)$