Question

Which of the following is not an algorithmic strategy?

• A. Dynamic programming
• B. Greedy method
• C. Secant method
• D. Branch and bound

Hint:

The secant method is used for finding the roots of equations and is not typically referred to as an algorithmic strategy.

Answer 1

The Correct Option is C

The secant method is a root-finding algorithm used in numerical analysis, but it is not classified as an algorithmic strategy like dynamic programming, greedy methods, or branch and bound. These latter methods are common algorithmic strategies used to solve optimization problems.
Thus, the correct answer is \( \text{Secant method} \).