B.SC (Prog) Computer Science VI Sem - Assignment
B.SC (Prog) Computer Science VI Sem - Assignment
Assignment- 2020
Maximum Marks – 10
Q1. Perform three iterations of Secant method to obtain a root of the equation
Q2. Perform three iterations of bisection method to obtain a root of the equation
Q3. If true value is 0.000310698 and approximated value is 0.0049065, then find the absolute and
Q4. Perform two iterations of Newton’s method to solve the non-linear system of the
Q5. Perform three iterations of Regula-Falsi method to find the root of the equation
Q6. Perform three iterations of Newton-Rapson method to obtain the cube root of 17
Q7. Find the inverse of the following matrix using the Gauss-Jorden method.
1 2 1
𝐴=[2 3 −1 ]
2 −1 3
Q8. Solve the tridiagonal system 𝐴𝑋 = 𝑏 by using Gauss-Thomas algorithim
1 2 0 𝑥 10
[1 3 3 ] [ 𝑦] = [ 17]
0 3 10 𝑧 22
Q9. For the following. System of equations
10 40 −2 𝑥 12
[ 1 𝑦
−10 −1 ] [ ] = [ −10 ]
5 2 −10 𝑧 −3
(i) Show that Jacobi iteration scheme converges.
Q10. For the following data obtain the Gregory-Newton back word differences polynomial
1 1
Q11. Prove that 1 + ∆ = 1 + 2 𝛿 2 + 𝛿√1 + 4 𝛿 2 .
Q12. The function 𝑓(𝑥) = 𝑆𝑖𝑛(𝑥) is defined on [1,2] and [2,3]. Hence find tha approximate value of
1
ℎ = 1 𝑎𝑛𝑑 ℎ = only.
2
Q16. Define the order of convergence of an iterative method.Derive the order of convergence of the
.
2𝑥 − 2𝑦 + 𝑧 = 1
4𝑥 + 2𝑦 + 3𝑧 = 2
𝑥+𝑦+𝑧 = 3