Scribd
Upload
2K views2 pages

QP02C 1

This document contains a 25 question multiple choice exam on numerical methods and computer programming. The exam covers topics like determining the number and types of roots of polynomial equations using methods like Descartes' rule of signs, Sturm's theorem, and the intermediate value theorem. It also includes questions about approximating values and determining significant digits. Students are instructed to darken the appropriate circle on an OMR sheet to select their answer for questions 1-20 which are each worth 1 mark, and questions 21-25 which are each worth 2 marks.

Uploaded by

पंकज काळे
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2K views2 pages

QP02C 1

This document contains a 25 question multiple choice exam on numerical methods and computer programming. The exam covers topics like determining the number and types of roots of polynomial equations using methods like Descartes' rule of signs, Sturm's theorem, and the intermediate value theorem. It also includes questions about approximating values and determining significant digits. Students are instructed to darken the appropriate circle on an OMR sheet to select their answer for questions 1-20 which are each worth 1 mark, and questions 21-25 which are each worth 2 marks.

Uploaded by

पंकज काळे
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Numerical Methods and Computer Programming

Name:. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Roll No:. . . . . . . . . . . . Shift:. . . . . .


Total Marks: 30 Duration: 30min Set-C

Instructions to students:
This exam contains 2 pages and 25 problems.
MCQ from 1-20 are for 1 marks and 21-25 for 2 marks
Dark appropriate circle in OMR sheet.

[1] In a polynomial f (x) = a0 xn + a1 xn−1 + · · · · · · + an−1 x + an = 0 with all real coefficients, the upper limit of root is
. . . . . ..
(A) greater than or equal to lowest value of the coefficients (B) less than or equal to highest value of the coefficients
Pn
(C) equal to ai (D) cannot be determined
i=0

[2] In a polynomial f (x) = a0 xn + a1 xn−1 + · · · · · · + an−1 x + an = 0 with all real coefficients, the lower limit of root is
. . . . . ..
(A) greater than or equal to lowest value of the coefficients (B) less than or equal to highest value of the coefficients
Pn
(C) equal to ai (D) cannot be determined
i=0

[3] In a polynomial f (x) = a0 xn + a1 xn−1 + · · · · · · + an−1 x + an = 0 with all real coefficients, if α + jβ is a complex root
of the equation, then second root is . . . . . ..
(A) α − jβ (B) −α + jβ (C) −α − jβ (D) αβ

[4] If a polynomial equation is to be solved with Birge-Vieta method with initial value p, then bn represents . . . . . . and
cn−1 represents . . . . . . respectively.
(A) f 0 (p), f (p) (B) f 0 , (p), f 0 (p) (C) f 0 (p), f 00 (p) (D) f (p), f 0 (p)

[5] According to Descarte’s rule of sign number of positive real root in equation f (x) = 12x7 − x5 + 4x3 − 15 = 0 are
(A) ≤ 0 (B) ≤ 1 (C) ≤ 2 (D) ≤ 3

[6] If true value is x = 100 and approximate value is x = 104, the relative error is
(A) -4 (B) 4 (C) 40 (D) 400
p p p
[7] If S = (2) + (5) + (1) is approximated upto four digits, the absolute error in S is
(A) 0.0005 (B) 0.00015 (C) 0.005 (D) 0.15

[8] According to Descarte’s rule of sign,in equation f (x) = x2n−1 − a (where n is any integer and a is any real positive
value) number of negative roots are
(A) not more than one (B) 0 (C) 2n (D) n2

[9] The equation e−x = 1 etc. is called . . . . . . equation


(A) polynomial (B) transcendental (C) algebraic (D) none of these

[10] For a fifth order polynomial equation f (x) = 0, Strum’s theorem is applied in the interval [−∞,∞] and it is found
that number of sign changes in Strum’s sequences at x = −∞ are 3 and at x = ∞ is 0. The number of complex roots
of the equation are . . . . . ..
(A) 1 (B) 2 (C) 3 (D) 5

[11] In Birge-Vieta method, if the value of bn is low at any value, then this value is . . . . . .
(A) away from root (B) near to root (C) at zero (D) at infinity

[12] In Birge-Vieta method, if the ratio bn /cn−1 is high at any value, then this value is . . . . . .
(A) away from root (B) near to root (C) at zero (D) at infinity
Set-C Offline MCQ Exam - Page 2 of 2 Jan 21/22, 2016

[13] In Birge-Vieta method, if the ratio bn /cn−1 is zero at any value, then this value is . . . . . .
(A) away from root (B) near to root (C) root (D) at infinity

[14] Strum’s theorem is used to determine number of . . . . . .


(A) real negative roots (B) real positive roots (C) complex roots (D) All of the above

[15] Which statement is incorrect?


(A) Numerical methods are powerful problem solving tools. (B) All numerical methods gives exact solution of the
problem. (C) Numerical methods can be implemented on computers. (D) Numerical methods can be used in
those problem where exact solution is not possible.

[16] Number of digits that are present in the number is called as . . . . . .


(A) Machine epsilon. (B) Significant digits after decimal point. (C) Total significant digits. (D) None of
these.

[17] Number of degits that are present in the number after decimal point is called as . . . . . .
(A) Machine epsilon. (B) Significant digits after decimal point. (C) Significant digits. (D) None of these.

[18] If value of π is approximated as 3.1416 the total number of significant digits are
(A) 1 (B) 3 (C) 5 (D) 4
10
[19] If value of 6 is approximated as 0.166667E1 the total number of significant digits are
(A) 4 (B) 5 (C) 6 (D) 1

[20] If a number is given as 0.0002456, total number of significant digits are


(A) 7 (B) 3 (C) 4 (D) 2

[21] For a third order polynomial equation f (x) = 0, Strum’s theorem is applied in the interval [−∞,0] and it is found that
number of sign changes in Strum’s sequences at x = −∞ are 3 and at x = 0 are 3. The number of real . . . . . . roots of
the equation are . . . . . ..
(A) negative, 0 (B) negative, 3 (C) positive, 0 (D) positive, 3

[22] According to intermediate value theorem, the root of 3x − log10 x = 6 lies between . . . . . ..
(A) [0, 1] (B) [1, 2] (C) [2, 3] (D) [3, 4]

[23] According to intermediate value theorem, the root of cos(x) = 3x − 1 lies between . . . . . ..
(A) [0, π/8] (B) [π/8, π/4] (C) [π/4, π/2] (D) [−π/8, −π/4]

[24] In a polynomial f (x) = a0 xn + a1 xn−1 + · · · · · · + an−1 x + an = 0, the nth order derivative with respect of x at x = p
is given by
a0 an
(A) n (B) n!an (C) n!a0 (D) n

[25] The formula used in Birge-Vieta method to find root of a polynomial equation with nth order is . . . . . ..
bn bn−1 bk bk−1
(A) pk+1 = pk − cn−1 (B) pk+1 = pk − cn (C) pn+1 = pn − ck−1 (D) pn+1 = pn − ck

> > > BEST OF LUCK > > >

You might also like