MCQ IN COMPUTER SCIENCE & ENGINEERING

Detailed explanation-1: -And an optimal solution is feasible solution for which rule (A) is maximized. Of these Six feasible solutions, solution 4 yields the maximum profit. Therefore solution 4 is optimal for the given problem instance.

Detailed explanation-2: -Feasible Solution: For solving a particular problem there exists n inputs and we need to obtain a subset that satisfies some constraints. Then any subset that satisfies these constraints is called feasible solution.

Detailed explanation-3: -A greedy algorithm tends to be very efficient. A greedy algorithm will backtrack when it finds a suboptimal solution. A greedy algorithm constructs a solution by choosing the best option at the moment. A greedy algorithm is guaranteed to find the optimal solution.

Detailed explanation-4: -In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time.