Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 W... Start Learning for Free
Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?
- a)T(n) = 0(n2)
- b)
- c)T(n) - Ω(n2)
- d)T(n) = O(nlogn)
Correct answer is option 'C'. Can you explain this answer?
Verified Answer
Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following...
T(0)= T(1) = 1
T(n) = 2T(n/2) + n
T(n) be computed as follows:
T(n) = 2T(n/2) + n
T(n) be computed as follows:
[T(n) can also proved by Master Theorem]
if
then it is also 0(n logn) and O(n2) but it is not Ω(n2).
if
then it is also 0(n logn) and O(n2) but it is not Ω(n2).Most Upvoted Answer
Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following...
T(0)= T(1) = 1
T(n) = 2T(n/2) + n
T(n) be computed as follows:
T(n) = 2T(n/2) + n
T(n) be computed as follows:
[T(n) can also proved by Master Theorem]
if then it is also 0(n logn) and O(n2) but it is not Ω(n2).
if
then it is also 0(n logn) and O(n2) but it is not Ω(n2).Free Test
FREE
| Start Free Test |
Community Answer
Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following...
T(0)= T(1) = 1
T(n) = 2T(n/2) + n
T(n) be computed as follows:
T(n) = 2T(n/2) + n
T(n) be computed as follows:
[T(n) can also proved by Master Theorem]
if then it is also 0(n logn) and O(n2) but it is not Ω(n2).
if
then it is also 0(n logn) and O(n2) but it is not Ω(n2). | Explore Courses for Computer Science Engineering (CSE) exam |  |
Top Courses for Computer Science Engineering (CSE)View all
Top Courses for Computer Science Engineering (CSE)
Question Description
Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2026 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2026 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer?.
Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer? for Computer Science Engineering (CSE) 2026 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2026 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer?.
Solutions for Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer?, a detailed solution for Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer? has been provided alongside types of Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Suppose T(n) = 2T(n/2) + n, T(0) = T(1) = 1 Which one of the following is FALSE?a)T(n) = 0(n2)b)c)T(n) - Ω(n2)d)T(n) = O(nlogn)Correct answer is option 'C'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
| Explore Courses for Computer Science Engineering (CSE) exam | |
Top Courses for Computer Science Engineering (CSE)
Explore Courses
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
