Binary-search-tree
October 12, 2023Algorithms
October 12, 2023Asymptotic-Complexity
|
Question 3
|
Consider the following recurrence:
Then, which of the following statements is/are TRUE?
Then, which of the following statements is/are TRUE?
|
f (2^ n -1) 2^ n -1
|
|
|
f (2 ^n ) 1
|
|
|
f (5 . 2 ^n ) 2^ n + 1 1
|
|
|
f (2^ n + 1) 2 ^n + 1
|
Question 3 Explanation:
We can solve this problem by eliminating options. Substitute n=1024
Based on the “n” value we can get Option-A, B and C are correct.
Based on the “n” value we can get Option-A, B and C are correct.
Correct Answer: C
Question 3 Explanation:
We can solve this problem by eliminating options. Substitute n=1024
Based on the “n” value we can get Option-A, B and C are correct.
Based on the “n” value we can get Option-A, B and C are correct.