Explore topic-wise MCQs in Numerical Analysis.

This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Numerical Analysis knowledge and support exam preparation. Choose a topic below to get started.

1.

A quadratic equation x4-x-8=0 is defined with an initial guess of 1 and 2. Find the approximated value of x2 using Secant Method.

A. 7.538
B. 7.853
C. 7.358
D. 1.571
Answer» E.
2.

A quadratic equation x2-4x+4=0 is defined with an initial guess of 10 and 20. Find the approximated value of x2 using Secant Method.

A. 7.538
B. 7.853
C. 7.358
D. 7.835
Answer» B. 7.853
3.

A quadratic equation x2-4x+4=0 is defined with an initial guess of 2 and 2.5. Find the approximated value of root using Secant Method.

A. 1
B. 2
C. 3
D. 4
Answer» C. 3
4.

A quadratic equation x2-4x+4=0 is defined with an initial guess of 3 and 2.5. Find the approximated value of root using Secant Method.

A. 1.33
B. 2.33
C. 3.33
D. 4.33
Answer» C. 3.33
5.

The number of iterations in Secant Method are less as compared to Newton Raphson.

A. True
B. False
Answer» B. False
6.

Secant Method is slower than Newton Raphson Method.

A. True
B. False
Answer» C.
7.

The iterative formula for a secant method is given as _________

A. x(n+1)= ( frac{x(n-1)f[x(n)]-x(n)f[x(n-1)]}{[f[x(n)]-f[x(n-1)]]} )
B. x(n+1)= ( frac{x(n)f[x(n)]-x(n)f[x(n-1)]}{[f[x(n)]-f[x(n-1)]]} )
C. x(n+1)= ( frac{x(n-1)f[x(n)]-x(n-1)f[x(n-1)]}{[f[x(n)]-f[x(n-1)]]} )
D. x(n+1)= ( frac{x(n)f[x(n)]-x(n-1)f[x(n-1)]}{[f[x(n)]-f[x(n-1)]]} )
Answer» B. x(n+1)= ( frac{x(n)f[x(n)]-x(n)f[x(n-1)]}{[f[x(n)]-f[x(n-1)]]} )
8.

Secant method converges faster than Bisection method.

A. True
B. False
Answer» B. False
9.

Secant Method is also called as?

A. 2-point method
B. 3-point method
C. 4-point method
D. 5-point method
Answer» B. 3-point method
10.

What is the region of convergence of Secant Method?

A. 1.5
B. 1.26
C. 1.62
D. 1.66
Answer» D. 1.66