Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Algorithm Design Techniques Greedy Algorithms
Match the pairs :
(P) 0/1 knapsack 1. O(\({n^{2}}{2^n}\))
(Q) All pairs shortest path 2. O(\({2^n}\))
(R) Optimal cost binary search tree 3. O(\({n^3}\))
(S) Traveling sales person 4. O(\({n^{2}}\))
1
P – 1, Q – 2, R – 3, S – 4
2
P – 2, Q – 3, R – 4, S – 1
3
P – 2, Q – 3, R – 3, S – 1
4
P – 2, Q – 3, R – 1, S – 4