Numerical Method 2067

Tribhuwan University
Institute of Science and Technology
2067
Bachelor Level / Third Semester / Science
Computer Science and Information Technology ( CSC-204 )
( Numerical Method )
Full Marks: 60
Pass Marks: 24
Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable.
The figures in the margin indicate full marks.

Attempt all questions:

1. Discuss methods of Half Interval and Newton’s for solving the nonlinear equation f(x) = 0. Illustrate the methods by figure and compare them stating their advantages and disadvantages. (8)

8 marks view

2. Derive the equation for Lagrange’s interpolating polynomial and find the value of f(x) at x = 1 for the following: (4+4)


8 marks view

3. Write Newton-cotes integration formulas in basic form for x = 1, 2, 3 and give their composite rules. Evaluate using the Gaussian integration three point formula. (4+4)

8 marks view

4. Solve the following algebraic system of linear equations by Gauss-Jordan algorithm. (8)


8 marks view

5. Write an algorithm and program to solve system of linear equations using Gauss-Seidel iterative method. (4+8)

12 marks view

6. Explain the Picard’s proves of successive approximation. Obtain a solution upto the fifth approximation of the equation such that y = 1 when x = 0 using Picard’s process of successive approximations . (2+6)

8 marks view

7. Define a difference equation to represent a Laplace’s equation. Solve the following Laplace equation  

For the rectangular plate given as:(3 + 5)

OR

Derive a difference equation to represent a Poison’s equation. Solve the Poison’s equation ∇2 f = 2x2yOver the domain 0 ≤ x ≤ 3, 0 ≤ y ≤ 3 with f = 0 on the boundary and h = 1. (3+5)


8 marks view