📊 Design and Analysis of Algorithms
Q. 7 T (n/2) + 1/n
  • (A) t(n) = o(n)
  • (B) t(n) = o(log n)
  • (C) t(n) = o(n2log n)
  • (D) cannot be solved using master’s theorem
💬 Discuss
✅ Correct Answer: (D) cannot be solved using master’s theorem

Explanation: the given recurrence cannot be solved by using the master’s theorem. it is because in this recurrence relation a < 1 so master’s theorem cannot be applied.

Explanation by: Mr. Dubey
the given recurrence cannot be solved by using the master’s theorem. it is because in this recurrence relation a < 1 so master’s theorem cannot be applied.

💬 Discussion

Related MCQs

Q. In a stack, if a user tries to remove an element from empty stack it is called

Q. The type of relationship in star schema is __________________.

Q. If the vertices of a walk W are distinct then W is called __________.

Q. The _______ step eliminates the extensions of (k-1)-itemsets which are not found to be frequent,from being considered for counting support

Q. Which one of the following is a set of one or more attributes taken collectively to uniquely identify a record?

Q. Which of the following describe(s) a global marketplace?

Q. Stack can be represented by means of ____________.

Q. The CPU hardware has a wire called __________ that the CPU senses after executing every instruction.

Q. Optimization, Defect Prevention, and Quality Control. Its come under the

Q. (1,2) print(total)

📊 Question Analytics

👁️
771
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
89%
Success Rate