Scribd
Upload
6 views2 pages

GHITM Puri Numerical Methods Int1

The document outlines an internal assessment for Numerical Methods covering multiple-choice questions, derivations, and problem-solving related to various numerical techniques. It includes topics such as the Newton-Raphson method, interpolation methods, and the Gauss-Seidel method. The assessment is divided into three sections: MCQs, 2-mark questions, and 3-mark questions.

Uploaded by

Aswini Kumar Palo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views2 pages

GHITM Puri Numerical Methods Int1

The document outlines an internal assessment for Numerical Methods covering multiple-choice questions, derivations, and problem-solving related to various numerical techniques. It includes topics such as the Newton-Raphson method, interpolation methods, and the Gauss-Seidel method. The assessment is divided into three sections: MCQs, 2-mark questions, and 3-mark questions.

Uploaded by

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

Numerical Methods – First Internal

Assessment (Modules 1 & 2)


Section A – MCQ (1 mark each)
1. Which method uses the concept of bracketing the root?
a) Newton-Raphson b) Gauss-Seidel c) Bisection d) Euler’s

2. The order of convergence of Newton-Raphson method is:


a) Linear b) Quadratic c) Cubic d) Logarithmic

3. Which method is suitable for solving large sparse systems?


a) Gauss Elimination b) Jacobi Method c) Gauss-Seidel d) Cramer’s Rule

4. In Lagrange interpolation, the number of terms equals:


a) n b) n + 1 c) n – 1 d) 2n

5. If a function is linear, which interpolation method gives exact result?


a) Newton’s Forward b) Lagrange c) Backward d) Simpson

6. Which of the following is a direct method for solving linear equations?


a) Gauss-Seidel b) Jacobi c) Gauss Elimination d) Successive Over Relaxation

7. The error in bisection method decreases:


a) Linearly b) Logarithmically c) Exponentially d) None

8. Newton-Raphson method fails if:


a) Derivative is zero b) Function is linear c) Function is continuous d) Function is non-
periodic

9. Which of the following methods is iterative?


a) LU Decomposition b) Bisection c) Gauss-Seidel d) Gaussian Elimination

10. What is the key requirement for interpolation?


a) Equal spacing b) Function must be periodic c) Known discrete data points d) Derivative
must exist

Section B – 2 Marks Questions


11. Derive the Newton-Raphson formula for finding roots.

12. Write the formula of Newton’s forward interpolation.

13. What is the condition for the convergence of Gauss-Seidel method?


14. Explain the difference between direct and iterative methods.

Section C – 3 Marks Questions


15. Solve the system using Gauss elimination:
x + y + z = 6,
2x + 3y + 4z = 20,
3x + 5y + 2z = 20

16. Use Newton-Raphson method to find one iteration for the root of f(x) = x2 - 3, x₀ = 2

17. Estimate the value of f(2.5) using Lagrange interpolation for:


(1,1), (2,8), (3,27)

18. Compute two iterations of Bisection Method for f(x) = x3 - 4x - 9 in [2, 3]

You might also like