Scribd
Upload
79 views3 pages

Quiz 1-NMST2021

The document contains a 10 question quiz on numerical methods and statistical techniques. The questions cover topics like root finding algorithms, error analysis, Newton's method, divided differences of polynomials, convergence of iterative methods, the bisection method, and using Regula-Falsi and Newton-Raphson methods to find approximations of roots.

Uploaded by

Anubhav Shrivastava
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
79 views3 pages

Quiz 1-NMST2021

The document contains a 10 question quiz on numerical methods and statistical techniques. The questions cover topics like root finding algorithms, error analysis, Newton's method, divided differences of polynomials, convergence of iterative methods, the bisection method, and using Regula-Falsi and Newton-Raphson methods to find approximations of roots.

Uploaded by

Anubhav Shrivastava
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Quiz-I

Numerical Methods and Statistical Techniques


Note: Attempt all the questions: Max. Time: 30 min

Q.1: Which of the following is true for the method to find the root of equation f (x) = 0?

(a) Bisection Method order of convergence is 2.


(b) Newton-Raphson Method converges linearly.
(c) Muller Method order of convergence is 1.84.
(d) Regula-Falsi Method order of convergence is 2.

Q.2: Which of the following is incorrect?

(a) Newton-Raphson Method can be used to find both the real and complex roots.
(b) Muller Method can be used to find the real roots.
(c) Newton-Raphson Method fails when two roots are closed to each other.
(d) Bisection Method can be used to find the complex roots.

Q.3: If a number x = 0.51 is rounded to 2 decimal places, then the maximum error and
percentage accuracy is-

(a) 0.005, 0.994%


(b) 0.005, 0.98%
(c) 0.001, 0.998%
(d) None of these

Q.4: The iterative method based on the Newton-Raphson Method for finding 1/N, where N is
a positive real number is-

(a) xn+1 = xn (2 + N xn ), n = 0, 1, 2, 3...


(b) xn+1 = xn (2 − N xn ), n = 0, 1, 2, 3...
(c) xn+1 = xn (N xn + 4), n = 0, 1, 2, 3...
(d) xn+1 = xn (N xn − 4), n = 0, 1, 2, 3...

1
Q.5: Which of the following is correct?

(a) The n-th finite difference of a polynomial of degree n is constant.


(b) The n-th divided difference of a polynomial of degree n is zero.
′
f (x) f (x)
(c) Newton-Raphson Method converges if ′′ < 1.
[ f (x)]2
(d) None of these

Q.6: The number of iterations required in bisection method for the root of f(x) = 0 in [x0 , x1 ]
with prescribed tolerance ϵ is-
log ϵ − log(x1 − x0 )
(a) n <
log 2
log ϵ − log(x1 − x0 )
(b) n ≥
log 2
log(x1 − x0 ) − log ϵ
(c) n ≥
log 2
log(x1 − x0 ) − log ϵ
(d) n ≤
log 2
Q.7: The equation x2 + ax + b = 0 has two real roots α and β. Then which of the following is
true?
−(axk + b)
(a) The iteration method xk+1 = is convergent near x = α if |α| < |β|
xk
−(axk + b)
(b) The iteration method xk+1 = is convergent near x = α if |α| > |β|
xk
−(axk + b)
(c) The iteration method xk+1 = is convergent near x = α if |α| = |β|
xk
(d) None of these

Q.8: The 1st approximation to a real root of the equation x3 − 3x2 − 2 = 0 by Regula-Falsi
method between 3 and 4 is-

(a) 3.250
(b) 3.375
(c) 3.5
(d) 3.125

2
Q.9: The 2nd approximation to a real root of the equation 4e−x sin x − 1 = 0 by Regula-Falsi
method between 0 and 0.5 is-

(a) 0.39636
(b) 0.39736
(c) 0.39536
(d) 0.39836

Q.10: To obtain a real root correct to three decimal places of the equation 2x − 3 = cos x, lying
in the interval [3/2, π/2] by using iteration method, the correct form of function is-
cos x + 3
(a) x =
2
(b) x = cos (2x − 3)
−1

(c) x = cos−1 (2x + 3)


cos x − 3
(d) x =
2

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy