Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent activity in Numerical Methods
1
votes
3
answers
1
GATE CSE 2008 | Question: 21
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 1000e 1000 100e 100
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...
Ice_Cold_V
3.1k
views
Ice_Cold_V
commented
Apr 4
Numerical Methods
gatecse-2008
normal
numerical-methods
trapezoidal-rule
non-gate
+
–
12
votes
3
answers
2
GATE CSE 2015 Set 3 | Question: 50
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: t 2 4 6 8 10 12 14 16 18 20 v 10 18 25 29 32 20 11 5 2 0 The approximate distance (in kilometers) rounded to two places of decimals covered in 20 minutes using Simpson's $1/3^{rd}$ rule is ________.
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:t2468101214161820v1018252932...
Hira Thakur
7.6k
views
Hira Thakur
edited
Feb 4
Numerical Methods
gatecse-2015-set3
numerical-methods
simpsons-rule
normal
numerical-answers
out-of-syllabus-now
non-gate
+
–
4
votes
2
answers
3
ISRO2009-48
The cubic polynomial $y(x)$ which takes the following values: $y(0)=1, y(1)=0, y(2)=1$ and $y(3)=10$ is $x^3 +2x^2 +1$ $x^3 +3x^2 -1$ $x^3 +1$ $x^3 -2x^2 +1$
The cubic polynomial $y(x)$ which takes the following values: $y(0)=1, y(1)=0, y(2)=1$ and $y(3)=10$ is$x^3 +2x^2 +1$$x^3 +3x^2 -1$$x^3 +1$$x^3 -2x^2 +1$
makhdoom ghaya
1.9k
views
makhdoom ghaya
edited
Jan 24
Numerical Methods
isro2009
polynomials
+
–
0
votes
0
answers
4
GATE CSE 1997 | Question: 4.3
Using the forward Euler method to solve $y’'(t) = f(t), y’(0)=0$ with a step size of $h$, we obtain the following values of $y$ in the first four iterations: $0, hf (0), h(f(0) + f(h)) \text{ and }h(f(0) - f(h) + f(2h))$ $0, 0, h^2f(0)\text{ and } 2h^2 f(0) + f(h)$ $0, 0, h^2f(0) \text{ and } 3h^2f(0)$ $0, 0, hf(0) + h^2f(0) \text{ and }hf (0) + h^2f(0) + hf(h)$
Using the forward Euler method to solve $y’'(t) = f(t), y’(0)=0$ with a step size of $h$, we obtain the following values of $y$ in the first four iterations:$0, hf (0...
Hira Thakur
676
views
Hira Thakur
edited
Dec 16, 2023
Numerical Methods
gate1997
numerical-methods
non-gate
out-of-gate-syllabus
+
–
3
votes
2
answers
5
GATE CSE 1997 | Question: 1.2
The Newton-Raphson method is used to find the root of the equation $X^2-2=0$. If the iterations are started from -1, the iterations will converge to -1 converge to $\sqrt{2}$ converge to $\sqrt{-2}$ not converge
The Newton-Raphson method is used to find the root of the equation $X^2-2=0$. If the iterations are started from -1, the iterations willconverge to -1converge to $\sqrt{2...
Hira Thakur
12.1k
views
Hira Thakur
edited
Dec 16, 2023
Numerical Methods
gate1997
numerical-methods
newton-raphson
normal
non-gate
out-of-gate-syllabus
+
–
5
votes
2
answers
6
GATE CSE 2000 | Question: 2.1
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? k must be 1 k must be 0 k can take any value between 0 and 1 None of the above
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 a...
Hira Thakur
2.0k
views
Hira Thakur
retagged
Dec 16, 2023
Numerical Methods
gatecse-2000
numerical-methods
normal
non-gate
out-of-gate-syllabus
+
–
0
votes
0
answers
7
GATE IT 2006 | Question: 27
Match the following iterative methods for solving algebraic equations and their orders of convergence. Method Order of Convergence 1. Bisection P. 2 or more 2. Newton-Raphson Q. 1.62 3. Secant R. 1 4. Regula falsi S. 1 bit per iteration I-R, II-S, III-P, IV-Q I-S, II-R, III-Q, IV-P I-S, II-Q, III-R, IV-P I-S, II-P, III-Q, IV-R
Match the following iterative methods for solving algebraic equations and their orders of convergence. Method Order of Convergence1.BisectionP.2 or more2.Newton-RaphsonQ....
Hira Thakur
1.5k
views
Hira Thakur
edited
Dec 12, 2023
Numerical Methods
gateit-2006
numerical-methods
normal
out-of-gate-syllabus
+
–
3
votes
1
answer
8
GATE IT 2004 | Question: 38
If f(l) = 2, f(2) = 4 and f(4) = 16, what is the value of f(3) using Lagrange's interpolation formula? 8 8(1/3) 8(2/3) 9
If f(l) = 2, f(2) = 4 and f(4) = 16, what is the value of f(3) using Lagrange's interpolation formula?88(1/3)8(2/3)9
Hira Thakur
3.8k
views
Hira Thakur
edited
Nov 23, 2023
Numerical Methods
gateit-2004
numerical-methods
lagranges-interpolation
normal
out-of-syllabus-now
non-gate
+
–
3
votes
1
answer
9
UGC NET CSE | December 2014 | Part 3 | Question: 69
Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table : Find out the minimum time required to complete all the jobs. $5$ $11$ $13$ $15$
Five men are available to do five different jobs. From past records, the time (in hours) that each man takes to do each job is known and is given in the following table :...
Nimmy sharma
7.6k
views
Nimmy sharma
commented
Jul 19, 2023
Numerical Methods
ugcnetcse-dec2014-paper3
assignment-problem
hungarian-method
+
–
0
votes
0
answers
10
NIELIT 2021 Dec Scientist B - Section B: 60
One root of $x^{3} – x – 4 = 0$ lies in $(1, 2).$ In bisection method, after first iteration the root lies in the interval ___________ . $(1, 1.5)$ $(1.5, 2)$ $(1.25, 1.75)$ $(1.75, 2)$
One root of $x^{3} – x – 4 = 0$ lies in $(1, 2).$ In bisection method, after first iteration the root lies in the interval ___________ .$(1, 1.5)$$(1.5, 2)$$(1.25, 1....
Hira Thakur
223
views
Hira Thakur
recategorized
Jul 15, 2023
Numerical Methods
nielit-2021-it-dec-scientistb
numerical-methods
+
–
0
votes
0
answers
11
Numerical Method Analysis : Help...
Use Bisection method to find the root of the following equation with tolerance 0.001. $x^4 - 2x^3 - 4x^2 + 4x + 4 = 0$ $x^3 – e^x + sin(x) = 0$
Use Bisection method to find the root of the following equation with tolerance 0.001.$x^4 - 2x^3 - 4x^2 + 4x + 4 = 0$$x^3 – e^x + sin(x) = 0$
Hira Thakur
269
views
Hira Thakur
recategorized
Jul 2, 2023
Numerical Methods
numerical-methods
out-of-gate-syllabus
+
–
0
votes
0
answers
12
Numerical Method Analysis : Help...
Use Bisection method to find all roots of $x^3 – 5x + 3 = 0$
Use Bisection method to find all roots of $x^3 – 5x + 3 = 0$
Hira Thakur
109
views
Hira Thakur
recategorized
Jul 2, 2023
Numerical Methods
numerical-methods
out-of-gate-syllabus
+
–
0
votes
0
answers
13
Numerical Method Analysis : Help....
Use NR method to find a root of the equation with tolerance x=0.00001. $x^3-2x-5=0$ $e^x-3x^2=0$
Use NR method to find a root of the equation with tolerance x=0.00001.$x^3-2x-5=0$$e^x-3x^2=0$
Hira Thakur
196
views
Hira Thakur
recategorized
Jul 2, 2023
Numerical Methods
numerical-methods
out-of-gate-syllabus
+
–
0
votes
0
answers
14
Numerical Method Analysis : Help...
Use Secant method to find roots of: $x^3-2x^2+3x-5=0$ $x+1 = 4sinx$ $e^x = x + 2$
Use Secant method to find roots of:$x^3-2x^2+3x-5=0$$x+1 = 4sinx$$e^x = x + 2$
Hira Thakur
266
views
Hira Thakur
recategorized
Jul 2, 2023
Numerical Methods
numerical-methods
out-of-gate-syllabus
+
–
1
votes
1
answer
15
GATE CSE 1987 | Question: 1-xxiv
The simplex method is so named because It is simple. It is based on the theory of algebraic complexes. The simple pendulum works on this method. No one thought of a better name.
The simplex method is so named because It is simple.It is based on the theory of algebraic complexes.The simple pendulum works on this method.No one thought of a better n...
Arjun
754
views
Arjun
answered
May 26, 2022
Numerical Methods
gate1987
numerical-methods
simplex-method
out-of-gate-syllabus
+
–
0
votes
1
answer
16
NIELIT 2016 MAR Scientist B - Section B: 7
In which of the following methods proper choice of initial value is very important? Bisection method False position Newton-Raphson Bairsto method
In which of the following methods proper choice of initial value is very important?Bisection methodFalse positionNewton-RaphsonBairsto method
33
1.9k
views
33
answered
Mar 15, 2022
Numerical Methods
nielit2016mar-scientistb
non-gate
numerical-methods
+
–
8
votes
2
answers
17
GATE CSE 2015 Set 2 | Question: 39
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 ... $x_b - (x_b-x_a) f_b / (f_b-f(x_a)) $ $x_a - (x_b-x_a) f_a / (f_b-f(x_a)) $
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 i...
LRU
4.8k
views
LRU
commented
Dec 15, 2021
Numerical Methods
gatecse-2015-set2
numerical-methods
secant-method
+
–
8
votes
3
answers
18
GATE IT 2006 | Question: 28
The following definite integral evaluates to $\int_{-\infty}^{0} e^ {-\left(\frac{x^2}{20} \right )}dx$ $\frac{1}{2}$ $\pi \sqrt{10}$ $\sqrt{10}$ $\pi$
The following definite integral evaluates to$$\int_{-\infty}^{0} e^ {-\left(\frac{x^2}{20} \right )}dx$$$\frac{1}{2}$$\pi \sqrt{10}$$\sqrt{10}$$\pi$
siddhartha983
5.1k
views
siddhartha983
commented
Sep 15, 2021
Numerical Methods
gateit-2006
numerical-methods
normal
non-gate
+
–
1
votes
1
answer
19
GATE CSE 1998 | Question: 1.3
Which of the following statements applies to the bisection method used for finding roots of functions: converges within a few iterations guaranteed to work for all continuous functions is faster than the Newton-Raphson method requires that there be no error in determining the sign of the function
Which of the following statements applies to the bisection method used for finding roots of functions:converges within a few iterationsguaranteed to work for all continuo...
Lakshman Bhaiya
22.4k
views
Lakshman Bhaiya
answer edited
May 31, 2021
Numerical Methods
gate1998
numerical-methods
bisection-method
easy
out-of-gate-syllabus
+
–
0
votes
3
answers
20
GATE CSE 1995 | Question: 2.15
The iteration formula to find the square root of a positive real number $b$ using the Newton Raphson method is $x_{k+1} = 3(x_k+b)/2x_k$ $x_{k+1} = (x_{k}^2+b)/2x_k$ $x_{k+1} = x_k-2x_k/\left(x^2_k+b\right)$ None of the above
The iteration formula to find the square root of a positive real number $b$ using the Newton Raphson method is$x_{k+1} = 3(x_k+b)/2x_k$$x_{k+1} = (x_{k}^2+b)/2x_k$$x_{k+1...
Lakshman Bhaiya
2.5k
views
Lakshman Bhaiya
recategorized
Apr 25, 2021
Numerical Methods
gate1995
numerical-methods
newton-raphson
normal
out-of-gate-syllabus
+
–
0
votes
3
answers
21
GATE CSE 1994 | Question: 3.4
Match the following items (i) Newton-Raphson (a) Integration (ii) Runge-Kutta (b) Root finding (iii) Gauss-Seidel (c) Ordinary Differential Equations (iv) Simpson's Rule (d) Solution of Systems of Linear Equations
Match the following items(i) Newton-Raphson(a) Integration(ii) Runge-Kutta(b) Root finding(iii) Gauss-Seidel(c) Ordinary Differential Equations(iv) Simpson's Rule(d) Solu...
Lakshman Bhaiya
11.9k
views
Lakshman Bhaiya
recategorized
Apr 25, 2021
Numerical Methods
gate1994
numerical-methods
easy
out-of-gate-syllabus
+
–
0
votes
0
answers
22
GATE CSE 1994 | Question: 1.3
Backward Euler method for solving the differential equation $\frac{dy}{dx}=f(x, y)$ is specified by, (choose one of the following). $y_{n+1}=y_n+hf(x_n, y_n)$ $y_{n+1}=y_n+hf(x_{n+1}, y_{n+1})$ $y_{n+1}=y_{n-1}+2hf(x_n, y_n)$ $y_{n+1}= (1+h)f(x_{n+1}, y_{n+1})$
Backward Euler method for solving the differential equation $\frac{dy}{dx}=f(x, y)$ is specified by, (choose one of the following).$y_{n+1}=y_n+hf(x_n, y_n)$$y_{n+1}=y_n+...
Lakshman Bhaiya
1.1k
views
Lakshman Bhaiya
recategorized
Apr 25, 2021
Numerical Methods
gate1994
numerical-methods
backward-euler-method
out-of-gate-syllabus
+
–
0
votes
0
answers
23
GATE CSE 1993 | Question: 02.4
Lakshman Bhaiya
382
views
Lakshman Bhaiya
recategorized
Apr 22, 2021
Numerical Methods
gate1993
numerical-methods
runga-kutta-method
out-of-gate-syllabus
fill-in-the-blanks
+
–
1
votes
1
answer
24
GATE CSE 1993 | Question: 01.3
Simpson's rule for integration gives exact result when $f(x)$ is a polynomial of degree $1$ $2$ $3$ $4$
Simpson's rule for integration gives exact result when $f(x)$ is a polynomial of degree$1$$2$$3$$4$
Lakshman Bhaiya
5.2k
views
Lakshman Bhaiya
recategorized
Apr 22, 2021
Numerical Methods
gate1993
numerical-methods
simpsons-rule
easy
out-of-gate-syllabus
multiple-selects
+
–
0
votes
0
answers
25
GATE CSE 1987 | Question: 11b
Use Simpson's rule with $h=0.25$ to evaluate $ V= \int_{0}^{1} \frac{1}{1+x} dx$ correct to three decimal places.
Use Simpson's rule with $h=0.25$ to evaluate $ V= \int_{0}^{1} \frac{1}{1+x} dx$ correct to three decimal places.
Lakshman Bhaiya
711
views
Lakshman Bhaiya
recategorized
Apr 22, 2021
Numerical Methods
gate1987
numerical-methods
simpsons-rule
out-of-gate-syllabus
+
–
0
votes
0
answers
26
GATE CSE 1987 | Question: 11a
Given $f(300)=2,4771; f(304) = 2.4829; f(305) = 2.4843$ and $f(307) = 2.4871$ find $f(301)$ using Lagrange's interpolation formula.
Given $f(300)=2,4771; f(304) = 2.4829; f(305) = 2.4843$ and $f(307) = 2.4871$ find $f(301)$ using Lagrange's interpolation formula.
Lakshman Bhaiya
524
views
Lakshman Bhaiya
recategorized
Apr 22, 2021
Numerical Methods
gate1987
numerical-methods
out-of-gate-syllabus
+
–
0
votes
0
answers
27
GATE CSE 1987 | Question: 1-xxv
Which of the following statements is true in respect of the convergence of the Newton-Rephson procedure? It converges always under all circumstances. It does not converge to a tool where the second differential coefficient changes sign. It does not converge to a root where the second differential coefficient vanishes. None of the above.
Which of the following statements is true in respect of the convergence of the Newton-Rephson procedure?It converges always under all circumstances.It does not converge t...
Lakshman Bhaiya
713
views
Lakshman Bhaiya
recategorized
Apr 22, 2021
Numerical Methods
gate1987
numerical-methods
newton-raphson
out-of-gate-syllabus
+
–
2
votes
1
answer
28
GATE CSE 1988 | Question: 1i
Loosely speaking, we can say that a numerical method is unstable if errors introduced into the computation grow at _________ rate as the computation proceeds.
Loosely speaking, we can say that a numerical method is unstable if errors introduced into the computation grow at _________ rate as the computation proceeds.
Lakshman Bhaiya
580
views
Lakshman Bhaiya
recategorized
Apr 16, 2021
Numerical Methods
gate1988
numerical-methods
out-of-gate-syllabus
+
–
2
votes
0
answers
29
GATE IT 2004 | Question: 39
Consider the following iterative root finding methods and convergence properties: Iterative root finding methods Convergence properties Q. False Position I. Order of convergence = 1.62 R. Newton Raphson II. Order of convergence = 2 S. Secant III. Order of convergence = 1 with guarantee of convergence T. ... R-II, S-I, T-IV Q-II, R-I, S-IV, T-III Q-I, R-IV, S-II, T-III
Consider the following iterative root finding methods and convergence properties: Iterative root finding methods Convergence propertiesQ.False PositionI.Order of converge...
harypotter0
1.7k
views
harypotter0
commented
Nov 5, 2020
Numerical Methods
gateit-2004
numerical-methods
normal
+
–
0
votes
1
answer
30
NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 7
The convergence of the bisection method is Cubic Quadratic Linear None
The convergence of the bisection method isCubicQuadraticLinearNone
Krithiga2101
1.2k
views
Krithiga2101
retagged
Oct 23, 2020
Numerical Methods
nielit2017oct-assistanta-cs
non-gate
numerical-methods
+
–
To see more, click for all the
questions in this category
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register