Match the following groups.
Group-I (Method)
A- Divide and conquer.
B- Greedy.
C- Dynamic programming.
Group-II
1- Independent subproblems can be solved in any order to solve the given problem.
2- Always chooses the right subproblem to solve the given problem.
3- An optimal solution to a problem contain optimal solutions to subproblems.
4- Every optimal solution to a subproblem will contribute to the main problem solution.
A-1, B-3, C-4
A-1, B-2, C-4
A-1, B-2, C-3
A-1, B-4, C-3
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go