Question

Which design strategy stops the execution when it find the solution otherwise starts the problem from top in daa

Answer 1

Backtracking is the correct answer to this question.

Explanation:

• Backtracking is a general algorithm for finding all solutions to some of the mathematical problems, in particular the problem of restriction fulfillment, which slowly builds up contenders for a solution and leaves the candidate as soon as it decides that the individual can not probably complete a viable solution.

• Backtracking is an algorithm for catching some or all approaches to the issues of computing, particularly the problems of restriction compliance.

• Backtracking is considered to be an effective technique to solve constraint satisfaction problems and puzzles.

• This is also known to be a powerful technique for decoding and is also the basis of many logic programming languages.

Learn more:-

brainly.in/question/2016105

Answer 2

Back tracking

Explanation:

The Backtracking is an algorithmic-method to solve a problem with an additional way. It uses a recursive approach to explain the problems. We can say that the backtracking is needed to find all possible combination to solve an optimization problem.

It is often the most convenient (if not the most efficient) technique for parsing, for the knapsack problem and other combinatorial optimization problems.

Backtracking is an algorithm that tries to find a solution given parameters. It builds candidates for the solution and abandons those which cannot fulfill the conditions.