City Guilds Model Questions Vol1 2022 Information Technology Question 40
Practice objective / multiple choice question 40 from the 2022 City Guilds Model Questions Vol1 Information Technology examination.
Define a recursive function \(T(n)\) such that \(T(1)=2\), \(T(2)=3\) and for \(n\ge 3\), \(T(n)=T(n-1)+2\,T(n-2)\).\n(a) Compute \(T(6)\).\n(b) Assuming the function is implemented directly as a recursive routine without memoisation, give the order of growth (Big‑O) of its running time in terms of \(n\).
Answer Options
About This Question
This is City Guilds Model Questions Vol1 2022 Information Technology Question 40. It is one of the objective questions from the 2022 City Guilds Model Questions Vol1 Information Technology examination.
Difficulty level: Hard .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.