## Solution of Assignment Synopsis & Project Dissertation Report

Online-Typing-and-Filling

 Title Name Amity Solved Assignment BSC for Computer Oriented Numerical Analysis University AMITY Service Type Assignment Course B.Sc-(IT) Semester Semester-II Course: B.Sc-(IT) Short Name or Subject Code Computer Oriented Numerical Analysis Commerce line item Type Semester-II Course: B.Sc-(IT) Product Assignment of B.Sc-(IT) Semester-II (AMITY) Price PRICE INR Click to View Price

## Questions:-

SUBJECT:  COMPUTER ORIENTED NUMERICAL ANALYSIS

ASSIGN MENT-A

(Any three)

1.Solve the following set of equation by Gauss elimination method.

2x +3y+4z=12

3x + y +z=4

x+4y+z=5

1. Find the rate of convergence of Newton Raphson method. Solve by www.solvezone.in
1. Define error, relative error and absolute error, give example of each.

ASSIGNMENT-B

1. a) Round off and truncate the following numbers to the four decimal places.
1. b) Find the route of equation 2x² -5x-1=0 by using bisection method. Perform 5 steps.

1. Solve the following equation by Jacobi method. Perform three steps.

xâ‚�-2xâ‚‚-xâ‚ƒ-xâ‚„=3

-2xâ‚� + xâ‚‚-xâ‚ƒ -xâ‚„=15

xâ‚� – xâ‚‚ + xâ‚ƒ -2xâ‚„ =27

-xâ‚� -xâ‚‚-2xâ‚ƒ+xâ‚„ =-9

1. For a given data
 X F(x) 1 33 2 50 3 69 4 90 5 129

Find the value of f(x) at 1.4

1. Choose 4 card at random from standard 52 card deck. What is the probability that two kings and two ace will be chosen.

ASSIGNMENT C

Question No: 1

Round off the number 0.859378 to four significant digits.

1. 8594
2. 8593
3. 8593
4. 593

Question No: 2

Truncate the number 0.859378 to four significant digits.

1. 8594
2. 8593
3. 8593
4. None

Question No: 3

The formula for Regula Falsi method is

Question No: 4

1. 234
2. 666
3. 9823
4. None of the above

Question No: 5

1. x0=1, x1=2
2. x0=0, x1=1
3. x0=0, x1=-1
4. x0=-1, x1=-2

Question No: 6

1. 3568
2. 995
3. 09
4. 135

Question No: 7

1. .479
2. .3854
3. .4053
4. .793

Question No: 8

Which method has the fastest convergence?

1. Bisection method
2. Newton Raphson Method
3. Regula Falsi Method
4. Iterative Method

Question No: 9

In Bisection method the initial approximation x0 and x1 are chosen such that

1. f(x0).f(x1)<0
2. f(x0).f(x1)>0
3. f(x0).f(x1)=0
4. f(x0)-f(x1) is negative.

Question No: 10

1. d) None

Question No: 11

1. Transcendental equation
2. Algebraic Equation
3. Polynomial Equation
4. None of the above

Question No: 12

1. d) None of these

Question No: 13

Which one is true?

Question No: 14

If ei+1/eip = 1 then rate of convergence is said to be

1. Linear
3. p
4. None

Question No: 15

Rate of convergence of Newton Raphson method is

1. 1
2. 2
3. 3
4. Can’t be determined

Question No: 16

Inverse of inverse of a matrix A is

1. A-1
2. 1/A
3. A
4. None of these

Question No: 17

For Matrix A and B of same order, AB=BA

1. True
2. FALSE
3. Can’t be determined
4. None of these

Question No: 18

Which one is an integration method?

1. Trapezoidal Method
2. Newton Raphson Method
3. Jacobi Method
4. None

Question No: 19

Which one is not an interpolation method?

1. Lagrange’s Method
2. Newton Forward Method
3. Newton Divided Difference Formula
4. Bisection Method

Question No: 20

Round off the number 0.259378 to four significant digits.

1. 2594
2. 2593
3. 2594
4. None

Question No: 21

Truncate the number 0.159378 to four significant digits.

1. 1594
2. 1593
3. 1593
4. 594

Question No: 22

Which one is true?

1. y1=y0-h
2. y1=y0/h
3. y1=y0+h
4. None

Question No: 23

The formula for Bisection method is

1. x2=(x0+x1)/2
2. x2=(x0-x1)/2
3. x2= x2=(x0*x1)/2
4. None

Question No: 24

Cramer’s rule fails for

1. Δ = 2
2. Δ = 1
3. Δ =0
4. None

Question No: 25

To solve a set of linear algebraic equations, the method is:

1. Gauss Jordan
2. Jacobi
3. Gauss Elimination
4. None

Question No: 26

1. (1,6)
2. (2,3)
3. (2,2)
4. None

Question No: 27

Equation of line is:

1. y=c
2. y=ax2+c
3. y=ax+c
4. None

Question No: 28

Δ² yâ‚’ is

1. y2-2y1+y0
2. y2+2y1+y0
3. y2+y1+y0
4. None

Question No: 29

Runga Kutta method is used for

1. Differentiation
2. Integration
3. Differential Equation
4. None of these

Question No: 30

Trapezoida formula is

1. h/2[yâ‚’+yn+2(y1+y2+….+yn)]
2. [yâ‚’+yn+2(y1+y2+….+yn)]
3. 3h/8[yâ‚’+yn+2(y1+y2+….+yn)]
4. None of these

Question No: 31

For Simpson’s 3/8 rule, the value of n is

1. 1
2. 2
3. 3
4. 4

Question No: 32

Accuracy of Simpson’s method is better than Trapezoidal method.

1. True
2. False
3. Can’t say
4. ,

Question No: 33

Divided Difference formula can also be used for equi-distant points:

1. True
2. False
3. Can’t say
4. ,

Question No: 34

(1+Δ)(1+?)=

1. 1
2. 0
3. Δ
4. None

Question No: 35

1. 3
2. 3
3. 9
4. None of these

Question No: 36

In Question 34, what is the value of F’(x) at x=0

1. 1
2. 2
3. 3
4. None of these

Question No: 37

For getting the solution of non-linear equation, which method uses the tangent

1. Bisection
2. Iterative
3. Newton Raphson
4. Regula Falsi

Question No: 38

Jordan method is a refinement over Gausee’s method

1. True
2. False
3. Can’t say
4. ,

Question No: 39

Numerical Solutions always give accurate solution

1. True
2. False
3. ,
4. ,

Question No: 40

What will be the relative error if 2/3 is approximated to 0.667?

1. 0005
2. 0006None
3. 005
4. None

## 4.8 / 5

#### Rating breakdown

5
80% Complete (danger)
1
4
80% Complete (danger)
1
3
80% Complete (danger)
0
2
80% Complete (danger)
0
1
80% Complete (danger)
0 January 29, 2015
This was nice in buy
Assignment from solve zone is probably one of the first preference of students. January 29, 2015
This was nice in buy
Assignment from solve zone is probably one of the first preference of students. 17-Nov, 2018
This was nice in buy
Assignment from solve zone is probably one of the first preference of students.