Algorithms | Recurrences | Set 1
- Question 1: Which of the following is the value of T3(n) where T3(n) is defined as T3(n) = 5*T3(n-1) – 4*T3(n-2)
- C1*5n + C2*4n
- C1 + C2*4n
- C1*2n + C2*4n
- C1*5n + C2*(-4)n
- Question 2: Determine the value of initial condition F(1) in a way that we can have F(n) = (n+2)! as the solution to the following given recursive function:
F(n) = (n+1) * F(n-1) + (n+1)!
- 3
- 4
- 6
- 2
- Question 3: What is the time Complexity of T(n) = 4* T(n/2) + n * log(n!).
- θ(n * log n)
- θ(n2)
- θ(n2 * log n)
- θ(n2 * log2 n)
- Question 4: Which one gives the best estimation of T(n) complexity?
T (n) = * T(n/2)+ n2 √n+1.
- θ( n2 * √n * log n )
- O( n2 * √n+1 * log n )
- θ( )
- θ( )
- O( n2 * √n ).
- Question 5: Which asymptotic boundary is not correct for T (n) = T (n/4) + T (3n/4) + n ?
- O( nlog4/3 2 )
- Ω( n )
- O( n * log(n) )
- None of above
Contact Us