BC0043-Computer_Oriented_Numerical_Methods-MQP

BC0043-Computer_Oriented_Numerical_Methods-MQP - Model...

This preview shows pages 1–6. Sign up to view the full content.

Model Question Paper Subject Code: BC0043 Subject Name: Computer Oriented Numerical Methods Credits: 4 Marks: 140 Part A (One mark questions) 1. ……………. . is an approach for solving complex mathematical problems using only simple basic arithmetic operations A) Numerical computing B) Binary computing C) Arithmetical computing D) Factorial computing 2. Consider the two points P(a, f(a)) and Q(b, f(b)) are two points on the curve, slope of the line joining the points P and Q is ……………. A) b a f ) ( ) ( B) ) ( ) ( C) ) ( ) ( D) ) ( ) ( 3. The remainder term R n (x) of a taylor series is given by

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
A) ) ( ! ) ( ) ( 4 f n a x R , where a < < x B) ) ( ! ) ( ) ( 3 , where a < < x C) ) ( ! ) ( ) ( , where a < < x D) ) ( ! ) ( ) ( 2 , where a < < x 4. The expansion ....... ) 0 ( ! .... ) 0 ( ! 2 ) 0 ( ) 0 ( ) ( 2 is known as A) Taylor’s series B) Bernard’s series C) Newton’s series D) Maclaurin’s series 5. Every algebraic equation of nth degree, where n is a positive integer, has only…………… A) n – 1 roots B) n + 1 roots C) 2n roots D) n roots 6. If a + ib is a root of f(x) = 0 then the other root is ……………. A) a – ib B) a C) b D) ib 7. If x = a is a root of f(x) = 0, then the factor of f(x) is …………………. A) x + a B) a C) x – a
D) x 8. The equation 0 5 4 3 2 3 x has ……………. . A) 3 negative roots B) 1 positive root C) 3 positive roots D) 2 positive roots 9. The order of the matrix 2 4 2 is …………. . A) 3 1 B) 1 3 C) 2 3 D) 3 3 10. The matrix 3 0 0 0 3 0 0 0 3 is called as a …………………. A) row matrix B) scalar matrix C) column matrix D) null matrix 11. If 3 2 1 2 A and 2 2 1 1 B then A + B = A) 1 0 0 1 B) 1 0 0 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
C) 1 0 0 1 D) 1 0 0 1 12. The matrix c f g b h a A is a ……………… A) symmetric matrix B) non-symmetric matrix C) reducible matrix D) irreducible matrix 13) Gauss-Jacobi’s method is a …………………. . method A) Non-iteration B) Iteration C) infinite D) algebraic 14. A sufficient condition for the iterative solution to have exact solution is ………………. . A) n i j ij ..... , , 2 , 1 , 1 B) ..... , , 2 , 1 , 1 C) ..... , , 2 , 1 , 1 D) ..... , , 2 , 1 , 1
15. Jacobi’s method is also called as ………………. .

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/01/2012 for the course I.T ICc 231 taught by Professor Ramon during the Fall '10 term at Institute of Management Technology.

Page1 / 20

BC0043-Computer_Oriented_Numerical_Methods-MQP - Model...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online