Numerical Methods Important Questions BCA 5th Sem CCSU
Here are the detailed answers to each question tailored for CCSU exams, categorized by their respective marks.
1. Gauss’s Elimination Method (7 Marks)
Gauss’s elimination method is a systematic way of solving a system of linear equations. The method involves three steps:
- Forward Elimination: Convert the system of equations into an upper triangular matrix form using elementary row operations.
- Backward Substitution: Solve for the variables starting from the last equation.
- Solution: Use back substitution to compute all variables.
Example: Solve:
- Convert the equations to an augmented matrix:
- Perform row operations to form an upper triangular matrix.
- Back substitution gives .
2. Bisection Method (Four Iterations) (7 Marks)
The bisection method divides the interval into two halves to find a root of .
Problem: Solve using the bisection method for four iterations.
- , (root lies in [2, 3]).
- Iterations:
- Iteration 1: , , root in [2.5, 3].
- Iteration 2: , , root in [2.5, 2.75].
- Iteration 3: , , root in [2.625, 2.75].
- Iteration 4: , .
Approximate root: .
3. Trapezoidal Rule and Euler’s Method (7 Marks)
Trapezoidal Rule:
Numerical integration method for approximating the value of a definite integral:
where .
Euler’s Method:
A numerical method to solve first-order ODEs. It uses:
Example:
Solve , , :
4. Picard’s Method (7 Marks)
Picard’s method generates successive approximations for solving ODEs.
Solve:
- First approximation: .
- Second approximation:
- Continue iterating for better approximations.
5. Newton-Raphson Method for (7 Marks)
The formula for the Newton-Raphson method is:
For :
6. Gauss Elimination Method (Example) (7 Marks)
Solve:
Follow steps as explained in Question 1. Final solution:
7. Regula-Falsi Method (7 Marks)
The formula is:
Derive this from the equation of a straight line between and . Use iterations like in the bisection method.
8. Numerical Integration (Examples) (7 Marks)
Gauss Forward Formula:
Interpolate a polynomial using equally spaced points.
Simpson’s 1/3 Rule:
Lagrange’s Interpolation:
9. Gauss-Seidel Method (7 Marks)
Iterative method to solve a system of linear equations:
- Rewrite equations with diagonally dominant coefficients.
- Solve iteratively:
10. False Position Method (7 Marks)
Solve using:
Similar steps as bisection.
11. Runge-Kutta Method (15 Marks)
Given:
Steps:
- Compute:
- Continue to and find :
12. Solve Using Runge-Kutta Method (4th Order)
Problem:
Solve the initial value problem (IVP):
Solution:
The Runge-Kutta 4th-order formula is:
where:
Steps:
Initial Values: .
-
Compute :
-
Compute :
-
Compute :
-
Compute :
-
Compute :
Final Answer:
At .
13. Lagrange’s Interpolation
Problem:
Given points , , and , find when .
Solution:
The Lagrange interpolation formula is:
Steps:
-
Compute :
-
Substitute Values:
For ,
Simplify each term:
Final Answer:
At .
14. Simpson’s 1/3 Rule
Problem:
Evaluate:
using Simpson’s 1/3 rule with .
Solution:
Simpson’s 1/3 rule is:
where .
-
Compute :
-
Compute :
At :
-
Apply the Formula:
Simplify:
Final Answer:
\int_0^6 \frac