Home
SELF STUDY
BrowsePracticeTestsPlaylistDoubts & solutionsFree live classesOther courses

Algorithms

Quick practice

Question 1 of 5

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

A-1, B-3, C-4

B

A-1, B-2, C-4

C

A-1, B-2, C-3

D

A-1, B-4, C-3

Get unlimited practice with GATE - CSIT, DSAI & Interview Preparation subscription

pick

Boost your performance with adaptive practice tests

pick

Practice every concept in the syllabus

pick

Compare your speed and accuracy with your peers

pick

Download the app and practice on the go