aliensbrain
  • Home
  • Study
  • Quizzes
  • 🎤AI Practicefree
  • Notebooks
  • Community
  • Sign in
  • Test 5 - Algorithms | Computer Science(CS)
  • Suppose T(n) = 2T(n/2) + n,T(0) = T(1) = 1 Which one of t...
Multiple choice

Suppose T(n) = 2T(n/2) + n,T(0) = T(1) = 1 Which one of the following is FALSE?

  1. T(n) = $\Theta(n2)$
  2. T(n) = $\theta(n\log n)$
  3. T(n) = $\Omega(n2)$
  4. T(n) = $\Theta(n\log n)$
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

Keep practicing — related questions

  • Suppose T(n) = 2T (n/2) + n, T(0) = T(1) = 1 Which of the following is false?
  • The order of the following recurrence: $T(n) = 2T([\sqrt{n}]) + 1$ is
  • The order of the following recurrence: $T(n) = 2T([\sqrt{n}]) + 1$ is
  • Consider the following functions: f(n) = 2n g(n) = n! h(n) = nlogn Which of the following statements about ...
  • Consider the following functions: f(n) = 2n g(n) = n! h(n) = nlogn Which of the following statements about ...
  • Directions: Find the time complexities of the following question. T(n)=2T(n/2)+n/logn
  • Directions: Find the time complexities of the following question. T(n)=2T(√n)+nlogn+n
  • The recurrence equation T(1) = 1 T(n) = 2T(n − 1) + n, n $\le$ 2 evaluates to
Play the full quiz 🎤 Practise this topic out loud
Advertisement
© Aliensbrain | all rights reserved
  • About
  • Contact
  • Terms and Condition
  • Privacy Policy