Vidyalelo
Data Structure · Q377

Miscellaneous on Data Structures

Programming · Data Structure · question 377

Q377

Which of the following approach should be used to find the solution of the activity selection problem?

A.
Greedy approach
Answer
B.
Divide and conquer
C.
Brute-force approach
D.
Dynamic programming

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board