wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

Match List-I (Dynamic algorithm) with List-II (Average case running time) and select the correct answer using the codes given below the lists:

List-I (Dynamic algorithm)

A. Matrix chain multiplication
B. Travelling salesman problem
C. 0/1 knapsack
D. Fibonacci series

List-II (Average case running time)

1. O(mn)
2. O(n3)
3. O(nn)
4. O(n)

Codes:

A B C D

(a) 1 3 2 4
(b) 1 3 3 2
(c) 2 3 3 2
(d) 2 3 1 4

A
a
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
c
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
b
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
d
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Open in App
Solution

The correct option is D d
A. Matrix chain multiplication: O(n3)
B. Travelling salesman problem: O(nn)
C. 0/1 knapsack: O(mn)
D. Fibonacci series: O(n)

flag
Suggest Corrections
thumbs-up
1
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Evaluation of Determinants
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon