1. What is the primary objective of the bisection method in numerical analysis?

A) Maximizing computational efficiency

B) Finding all roots of a polynomial
C) Locating a root within a given interval
D) Minimizing the number of function evaluations
Answer: C) Locating a root within a given interval
2. In the bisection method, how is the next interval determined after evaluating the function at the
midpoint?

A) By comparing the midpoint with the endpoints

B) By halving the interval
C) By evaluating the function at both endpoints
D) By adjusting based on the derivative
Answer: A) By comparing the midpoint with the endpoints
3. What is the convergence rate of the bisection method?

A) Linear convergence
B) Quadratic convergence
C) Exponential convergence
D) Convergence rate varies with the function
Answer: A) Linear convergence
4. Which of the following conditions is necessary for applying the bisection method?

A) The function must be continuous

B) The function must be differentiable
C) The function must be polynomial
D) The function must be monotonic
Answer: A) The function must be continuous
5. In the bisection method, how does the width of the interval change with each iteration?

A) It decreases by a constant factor

B) It increases by a constant factor
C) It decreases by a constant amount
D) It varies depending on the function
Answer: C) It decreases by a constant amount
6. What is the advantage of the bisection method over other root-finding methods?

A) It guarantees convergence to the root

B) It requires fewer iterations
C) It can handle complex functions
D) It always finds all roots within an interval
Answer: A) It guarantees convergence to the root
7. What is the primary goal of the fixed-point iteration method in numerical analysis?

A) Maximizing computational efficiency

B) Finding the derivative of a function
C) Converging to a fixed point of a function
D) Minimizing the number of function evaluations
Answer: C) Converging to a fixed point of a function
8. How is the fixed-point iteration method initialized?

A) By setting an initial guess for the root

B) By finding the derivative of the function
C) By setting an upper bound for the interval
D) By choosing an arbitrary function
Answer: A) By setting an initial guess for the root
9. What condition ensures convergence of the fixed-point iteration method?

A) The function must be differentiable

B) The function must be continuous
C) The function must be polynomial
D) The function must have a root
Answer: B) The function must be continuous
10. In fixed-point iteration, what does the iteration formula look like?

A) x = f(x)
B) x = f'(x)
C) x = x - f(x)
D) x = x + f(x)
Answer: A) x = f(x)
11. How is the stopping criterion typically determined in fixed-point iteration?

A) When the iteration count exceeds a predefined limit

B) When the function value approaches zero
C) When the difference between consecutive iterates is small
D) When the derivative of the function becomes zero
Answer: C) When the difference between consecutive iterates is small
12. What is a limitation of the fixed-point iteration method?

A) It always converges to the exact root

B) It may diverge for certain functions
C) It requires knowledge of the derivative
D) It is not suitable for nonlinear equations
Answer: B) It may diverge for certain fun

13. What is the primary objective of the secant method in numerical analysis?

A) Maximizing computational efficiency

B) Locating a root within a given interval
C) Minimizing the number of function evaluations
D) Ensuring convergence to the global minimum
Answer: B) Locating a root within a given interval
14. How does the secant method differ from the bisection method?

A) The secant method requires knowledge of the derivative

 B) The secant method uses linear interpolation between two points
C) The secant method always converges quadratically
D) The secant method requires the function to be monotonic
Answer: B) The secant method uses linear interpolation between two points
15. What is the primary advantage of the secant method over the Newton-Raphson method?

A) It requires fewer function evaluations

B) It converges faster for linear functions
C) It guarantees convergence to the root
D) It is more robust for highly nonlinear functions
Answer: A) It requires fewer function evaluations
16. How are the initial two points chosen in the secant method?

A) Arbitrarily within the interval

B) Based on the function's derivative
C) By dividing the interval equally
D) Based on the function's values at the endpoints
Answer: A) Arbitrarily within the interval
17. In the secant method, how is the next approximation of the root calculated?

A) By linearly interpolating between the two previous points

B) By halving the interval like in the bisection method
C) By using the function's derivative at the current point
D) By selecting the point with the smallest function value
Answer: A) By linearly interpolating between the two previous points
18. Under what condition can the secant method fail to converge?

A) When the function has multiple roots

B) When the function is not continuous
C) When the initial points are too close together
D) When the function is linear
Answer: C) When the initial points are too close together
19. What is the primary purpose of the trapezoidal rule in numerical analysis?

A) Maximizing computational efficiency

B) Estimating the derivative of a function
C) Approximating definite integrals
D) Solving linear systems of equations
Answer: C) Approximating definite integrals
20. How does the trapezoidal rule approximate the area under a curve?

A) By dividing the area into rectangles

B) By fitting a parabola to the curve
C) By interpolating linearly between two points
D) By approximating the curve with straight line segments
Answer: C) By interpolating linearly between two points
21. What is the advantage of the trapezoidal rule over the midpoint rule?
 A) It requires fewer function evaluations
B) It provides more accurate results
C) It is easier to implement
D) It converges faster for highly oscillatory functions
Answer: A) It requires fewer function evaluations
22. How are the trapezoids formed in the trapezoidal rule?

A) By connecting consecutive points with straight lines

B) By fitting a curve to the data points
C) By dividing the interval into equal segments
D) By averaging the function values at consecutive points
Answer: A) By connecting consecutive points with straight lines
23. What is the order of accuracy of the trapezoidal rule?

A) Linear
B) Quadratic
C) Cubic
D) Exponential
Answer: A) Linear
24. Under what condition does the trapezoidal rule yield exact results?

A) When the function is linear

B) When the function is polynomial
C) When the function is periodic
D) When the function is continuous
Answer: B) When the function is polynomial
25. What is the primary purpose of the trapezoidal rule in numerical analysis?

A) Maximizing computational efficiency

B) Estimating the derivative of a function
C) Approximating definite integrals
D) Solving linear systems of equations
Answer: C) Approximating definite integrals
26. How does the trapezoidal rule approximate the area under a curve?

A) By dividing the area into rectangles

B) By fitting a parabola to the curve
C) By interpolating linearly between two points
D) By approximating the curve with straight line segments
Answer: C) By interpolating linearly between two points
27. What is the advantage of the trapezoidal rule over the midpoint rule?

A) It requires fewer function evaluations

B) It provides more accurate results
C) It is easier to implement
D) It converges faster for highly oscillatory functions
 Answer: A) It requires fewer function evaluations
28. How are the trapezoids formed in the trapezoidal rule?

A) By connecting consecutive points with straight lines

B) By fitting a curve to the data points
C) By dividing the interval into equal segments
D) By averaging the function values at consecutive points
Answer: A) By connecting consecutive points with straight lines
29. What is the order of accuracy of the trapezoidal rule?

A) Linear
B) Quadratic
C) Cubic
D) Exponential
Answer: A) Linear
30. Under what condition does the trapezoidal rule yield exact results?

A) When the function is linear

B) When the function is polynomial
C) When the function is periodic
D) When the function is continuous
Answer: B) When the function is polynomial
7. What is a root correct to three decimal places of the equation x 3 – 3x – 5 = 0 by Using Newton-
Raphson method?
A. 2.222
B. 2.279
C. 2.275
D. None of these

Answer - Click Here:

B
1. What is the region of convergence of Secant Method?
a) 1.5
b) 1.26
c) 1.62
d) 1.66
View Answer
Answer: c
Explanation: The region of convergence of Secant Method is 1.62. It converges faster than
Bisection method.
3. Secant method converges faster than Bisection method.
a) True
b) False
View Answer
Answer: a
Explanation: Secant method converges faster than Bisection method. Secant method has a
convergence rate of 1.62 where as Bisection method almost converges linearly.
2. Find the root of xe-x -0.3 = 0 using Bisection Method in the interval [1,5].
a) 1.68
b) 1.86
c) 1.88
d) 1.66
View Answer
Answer: b
Explanation: Iteration table is given as follows:

No. a b c f(a)*f(c

1 1.0 5.0 3.0 (-)

2 1.0 3.0 2.0 (-)

3 1.0 2.0 1.5 (+)

4 1.5 2.0 1.75 (+)

5 1.75 2.0 1.875 (-)

6 1.75 1.875 1.8125 (-)

7 1.75 1.8125 1.78125 (+)

8 1.78125 1.8125 1.796875 (-)

9 1.78125 1.796875 1.7890625 (-)

4. The iterative formula for a secant method is given as _________

a) x(n+1)=x(n−1)f[x(n)]−x(n)f[x(n−1)][f[x(n)]−f[x(n−1)]]
b) x(n+1)=x(n)f[x(n)]−x(n)f[x(n−1)][f[x(n)]−f[x(n−1)]]
c) x(n+1)=x(n−1)f[x(n)]−x(n−1)f[x(n−1)][f[x(n)]−f[x(n−1)]]
d) x(n+1)=x(n)f[x(n)]−x(n−1)f[x(n−1)][f[x(n)]−f[x(n−1)]]
View Answer
Answer: a
Explanation: The Iterative formula for a Secant Method is given by
x(n+1)=x(n−1)f[x(n)]−x(n)f[x(n−1)][f[x(n)]−f[x(n−1)]]
Since there are 2 points considered in the Secant Method, it is also called 2-point method.
5. Secant Method is slower than Newton Raphson Method.
a) True
b) False
View Answer
Answer: b
Explanation: Secant Method is faster as compares to Newton Raphson Method. Secant
Method requires only 1 evaluation per iteration whereas Newton Raphson Method requires
2.