Mathematics · Recurrence Relations
Given a recursive function with the recurrence relation T(n) = T(n/3) + 1 for n > 1, and T(1) = 1. What is the total number of function calls (nodes in the recursion tree) made when the function is initially called with n = 27?
- 140
- 227
- 34✓
- 43
Correct answer
4
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Recurrence Relations?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Recurrence Relations