Computer Science · Algorithms
Match LIST I with LIST II: LIST I A. The running time of straightforward recursive method to compute nth Fibonacci number Fn B. The running time to compute Fn using memoization C. The running time to compute Fibonacci number Fn using only integer addition and multiplication matrix exponentiation D. The running time to determine an optimal bitonic tour LIST II I. O(n2) II. O(lg n) III. O(n) IV. Θ(φn) Choose the correct answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A - IV, B - II, C - III, D - I
- 2A - I, B - II, C - IV, D - III
- 3A - IV, B - III, C - II, D - I✓
- 4A - I, B - III, C - IV, D - II
Correct answer
A - IV, B - III, C - II, D - I
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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms