Select the correct answer for the question below: Dynamic programming is an algorithm pattern ... 1.Is not applicable to algorithms which use recursion.   2.That is applicable to almost every set of circumstances and can be widely implemented.   3.That is applicable to only a narrow range of circumstances.   4.Offers poor efficiency gains, when applicable

The mathematical functions introduced in Chapter 4 can be used to compute and simulate engineering and scientific issues. In these cases, we formulate the mathematical issue and then use the computer to perform computations and simulations. Can a computer programme solve a math problem and develop mathematical formulas, i.e., can it perform the functions of a mathematician?

Compare and contrast the problem-solving strategies of iterative and recursive methods. It's important to know when to utilize recursion and when to use iteration. Provide supporting evidence that differs from the examples included in the presentation slides to back up your claim.

mission control applications were discussed as a case in which iteration might be preferable to recursion. Discuss other applications in which iteration might be preferable and why.

In the process of finding solutions to challenges, it is helpful to make use of algorithms since, despite the fact that we may not fully understand them, they are successful because they are what?

Name and explain the three elements of recursion. Provide an example of recursion in nature, real life. Provide an example of a programming application which would be an appropriate place to implement recursion.

Has an agreed set of criteria for Algorithm Analysis been developed?