GATE CS Numerical Methods (Historical) questions

The secant method is used to find the root of an equation $f(x)=0$. It is started from two distinct estimates $x_a$ and $x_b$ for the root. It is an iterative procedure involving linear interpolation to a root. The iteration stops if $f(x_b)$ is very small and then $x_b$ is the solution. The procedure is given below. Observe that there is an …

The velocity $v$ (in kilometer/minute) of a motorbike which starts form rest, is given at fixed intervals of time $t$ (in minutes) as follows: t2468101214161820 v10182529322011520 The approximate distance (in kilometers) rounded to two places of decimals covered in 20 minutes using Simpson's $1/3^{rd}$ rule is ________.

In the Newton-Raphson method, an initial guess of $x_0= 2$ is made and the sequence $x_0,x_1,x_2\:\dots$ is obtained for the function $$0.75x^3-2x^2-2x+4=0$$ Consider the statements $x_3\:=\:0$ The method converges to a solution in a finite number of iterations. Which of the following is TRUE?

With respect to the numerical evaluation of the definite integral, $K = \int \limits_a^b \:x^2 \:dx$, where $a$ and $b$ are given, which of the following statements is/are TRUE? The value of $K$ obtained using the trapezoidal rule is always greater than or equal to the exact value of the definite integral. The value of $K$ obtained using the …

Function $f$ is known at the following points: $x$ 0 0.3 0.6 0.9 1.2 1.5 1.8 2.1 2.4 2.7 3.0 $f(x)$ 0 0.09 0.36 0.81 1.44 2.25 3.24 4.41 5.76 7.29 9.00 The value of $\int_{0}^{3} f(x) \text{d}x$ computed using the trapezoidal rule is

The bisection method is applied to compute a zero of the function $f(x) =x ^{4} – x ^{3} – x ^{2} – 4$ in the interval [1,9]. The method converges to a solution after ––––– iterations.

The Newton-Raphson iteration $x_{n+1} = \frac{1}{2}\left(x_n+\frac{R}{x_n}\right)$ can be used to compute the

The minimum number of equal length subintervals needed to approximate $\int_1^2 xe^x\,dx$ to an accuracy of at least $\frac{1}{3}\times10^{-6}$ using the trapezoidal rule is

Consider the polynomial $p(x) = a_0 + a_1x + a_2x^2 + a_3x^3$ , where $a_i \neq 0$, $\forall i$. The minimum number of multiplications needed to evaluate $p$ on an input $x$ is:

The trapezoidal rule for integration gives exact result when the integrand is a polynomial of degree

X, Y and Z are closed intervals of unit length on the real line. The overlap of X and Y is half a unit. The overlap of Y and Z is also half a unit. Let the overlap of X and Z be k units. Which of the following is true?

The Newton-Raphson method is to be used to find the root of the equation $f(x)=0$ where $x_o$ is the initial approximation and $f’$ is the derivative of $f$. The method converges

Which of the following statements applies to the bisection method used for finding roots of functions:

Simpson's rule for integration gives exact result when $f(x)$ is a polynomial of degree

The simplex method is so named because