Aspire's Library
A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Study Stuff for MCA Examinations - NIMCET
Previous Year Question (PYQs)
Match List I with List II
Choose the correct answer from the options given below:
| List I | List II |
| A. The running time of straight forward recursive method to compute nth Fibonacci number Fn | I. O(n²) |
| B. The running time to compute Fn using memoization | II. O(lg n) |
| C. The running time to compute Fibonacci number Fn using only integer addition and multiplication | III. O(n) |
| D. The running time to determine an optimal bitonic tour | IV. θ(φⁿ) |
Solution
A. Straight forward recursive Fibonacci method takes exponential time.
So, A matches with IV.
B. Fibonacci using memoization takes linear time.
So, B matches with III.
C. Fibonacci number using integer addition and multiplication can be computed in logarithmic time.
So, C matches with II.
D. Optimal bitonic tour takes O(n²) time.
So, D matches with I.
Final Answer: (b) A – IV, B – III, C – II, D – I
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Online Test Series, Information About Examination,
Syllabus, Notification
and More.
View More
Ask Your Question or Put Your Review.
