- Courses
- Tutorials
- Practice
- Contests
Data Structure
Java
Python
HTML
Interview Preparation
Algorithms | Analysis of Algorithms (Recurrences) | Question 4
Last Updated :
Discuss
Comments
Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1
Which one of the following is false. ( GATE CS 2005)
a) T(n) = O(n^2)
b) T(n) = [Tex]\\theta[/Tex](nLogn)
c) T(n) = [Tex]\\Omega[/Tex](n^2)
d) T(n) = O(nLogn)
a) T(n) = O(n^2)
b) T(n) = [Tex]\\theta[/Tex](nLogn)
c) T(n) = [Tex]\\Omega[/Tex](n^2)
d) T(n) = O(nLogn)
A
B
C
D
This question is part of this quiz :
Top MCQs on Complexity Analysis using Recurrence Relations with Answers,Top 50 Algorithms MCQs with AnswersTags:
Share your thoughts in the comments
GeeksforGeeks
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy