Roll No. [T | Total No. of Pages : 02
Total No. of Questions : 07
--- Content provided by FirstRanker.com ---
B.Sc.(Computer Science) (2013 & Onwards) (Sem.-5)
NUMERICAL ANALYSIS
Subject Code : BCS-501
M.Code : 72574
Time : 3 Hrs. Max. Marks : 60
--- Content provided by FirstRanker.com ---
INSTRUCTIONS TO CANDIDATES :
- SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
- SECTION-B contains SIX questions carrying TEN marks each and students have to attempt ANY FOUR questions.
SECTION-A
- Write briefly :
- Define Error generation
- State Bisection method.
- Define Forward difference.
- Define Shift operator.
- State Triangular method.
- Define interpolation.
- State method of least square for curve fitting.
- State Trapezoidal Rule.
- State Weddle Rule.
- State Runge-kutta method.
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
--- Content provided by FirstRanker.com ---
SECTION-B
- Find the real root of the equation cos x — 3x + 1 =0 by using iteration method.
- Explain the method of False position in detail.
- Using divided difference, find the value of f(8), given that f(6)=1.556,f(7)=1.690, f(9) = 1.908, f(12) = 2.158.
- Use Stirling’s formula to find y35, given y20 = 49225, y25 = 48316, y30 = 47236, y40 = 45926, y45 = 44306.
- Use Romberg’s method to compute ?12 1/(1+x) dx correct upto 4 decimal places.
- Tabulate by Milne’s method the numerical solution of dy/dx = x+ y with the initial conditions x0 = 0, y0 =1 from x = 0.20 to x = 0.30.
--- Content provided by FirstRanker.com ---
NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.
--- Content provided by FirstRanker.com ---
This download link is referred from the post: PTU B-Sc CS-IT 2020 March Previous Question Papers
--- Content provided by FirstRanker.com ---