Loading...

Loading, please wait...

Back to Topics

Engineering Mathematics
Numerical Methods

Practice questions from Numerical Methods.

13
Total
0
Attempted
0%
0
Correct
0%
0
Incorrect
0%
Q#1 Numerical Methods GATE EC 2017 (Set 1) NAT +2 marks -0 marks

Starting with x = 1, the solution of the equation , after two iterations of Newton-Raphson’s method (up to two decimal places) is ____________

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#2 Numerical Methods GATE EC 2016 (Set 2) NAT +2 marks -0 marks

The ordinary differential equation, with  is to be solved using the forward Euler method. The largest time step that can be used to solve the equation without making the numerical solution unstable is ________.

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#3 Numerical Methods GATE EC 2016 (Set 1) NAT +1 mark -0 marks

Consider the first order initial value problem , y(0)=1,  with exact solution for x=0.1, the percentage difference between the exact solution and the solution obtained using a single iteration of the second-order Runge-kutta method with step-size h=0. 1is ______________.

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#4 Numerical Methods GATE EC 2015 (Set 3) NAT +2 marks -0 marks

The Newton-Raphson method is used to solve the equation. Taking the initial guess as x = 5, the solution obtained at the end of the first iteration is __________.

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#5 Numerical Methods GATE EC 2014 (Set 3) MCQ +1 mark -0.33 marks

Match the application to appropriate numerical method.

Application 

P1: Numerical integration

P2: Solution to a transcendental equation

P3: Solution to a system of linear equations

P4: Solution to a differential equation

Numerical Method

M1: Newton-Raphson Method

M2: Runge-Kutta Method

M3: Simpson’s 1/3-rule

M4: Gauss Elimination Method

P1—M3, P2—M2, P3—M4, P4—M1

P1—M3, P2—M1, P3—M4, P4—M2

P1—M4, P2—M1, P3—M3, P4—M2

P1—M2, P2—M1, P3—M3, P4—M4

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#6 Numerical Methods GATE EC 2013 (Set 1) MCQ +1 mark -0.33 marks

A polynomial  with all coefficients positive has

No real roots

No negative real root

Odd number of real roots

At least one positive and one negative real root

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#7 Numerical Methods GATE EC 2011 (Set 1) MCQ +2 marks -0.66 marks

A numerical solution of the equation  can be obtained using Newton-Raphson method. If the starting value is x = 2 for the iteration, the value of x that is to be used in the next step is

0.306        

0.739

1.694        

2.306

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#8 Numerical Methods GATE EC 2010 (Set 1) MCQ +2 marks -0.66 marks

Consider differential equation  with the initial condition . Using Euler’s first order method with a step size of 0.1, the value of y (0.3) is

0.01

0.031

0.0631

0.1

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#9 Numerical Methods GATE EC 2008 (Set 1) MCQ +2 marks -0.66 marks

The recursion relation to solve  using Newton-Raphson method is

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#10 Numerical Methods GATE EC 2007 (Set 1) MCQ +2 marks -0.66 marks

The equation is to be solved using the Newton-Raphson method. If x = 2 is taken as the initial approximation of the solution, then the next approximation using this method will be

1

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#11 Numerical Methods GATE EC 2005 (Set 1) MCQ +2 marks -0.66 marks

Match the following and choose the correct combination:

E – 6 F – 1 G – 5 H – 3

E – 1 F – 6 G – 4 H – 3

E – 1 F – 3 G – 4 H – 2

E – 5 F – 3 G – 4 H – 1

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#12 Numerical Methods GATE EC 1993 (Set 1) MCQ +1 mark -0.33 marks

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

1

2

3

4

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock
Q#13 Numerical Methods GATE EC 1993 (Set 1) NAT +1 mark -0 marks

Given the differential equation,  with the initial condition . The value of  calculated numerically up to the third place of decimal by the second order Runge Kutta method with step size  is _________

Sign in to see the solution

Log in to view the explanation, track your attempts, and keep your progress.

Sign in to Unlock