Numerical & Statistical Methods B.C.A Question Paper : ideunom.ac.in

University : University of Madras
Degree : B.C.A
Department : Computer Application
Subject :Numerical & Statistical Methods,
Document type : Question Paper
Website : http://ideunom.ac.in/

IDEUNOM Numerical & Statistical Methods Question Paper

Time : Three hours
Maximum : 100 marks

Related / Similar Question Paper :
IDEUNOM BCA Operating Systems & Microprocessors Question Paper

OCTOBER 2012

PART A — (10 ´ 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
1. Write down the formula for secant and False – position methods.
2. Mention the formula for Simpson’s rule. Simpson’s
3. Give the formula for predictor – corrector method.
4. Find the AM for the following items :
x: 1 2 3 4 5
f: 4 6 8 9 3

5. Mention the formula for finding the Mean deviation from Median.
6. Define : Standard error and t-test.
7. Define : Normal and exponential distributions.
8. Mention the formula for two regression lines.
9. What is Stack and queue.
10. What is Asymptotic notation?
11. Define: Binary Tree.
12. What is Directed Group?

PART B — (5 ´ 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. Obtain a root of the equation correct to four  decimal places 4 9 0 x3 – x – = by False position method.
14. Dividing the range into 10 equal parts, find the approximation value of ∫p 0 sin xdx by Trapezoidal rule
15. Find a root of the equation 2 5 0 3 3 x – x – = 0to3 significant digits using Secant method.

16. In two factories A and B engaged in the same industry in an area, the average weekly wage in rupees and standard deviation are as follows:
Factory Average weekly wage S.D. No. Of Workers
A 36 5 250
B 38 4.5 150
Find the average and s.d. of the workers in the two factories taken together.

17. Calculate the Arithmetic Mean and Median of the frequency distribution given below :
Class Limits : 130-134 135-139 140-144 145-149
Frequency 5 15 28 24
Class Limits :  150-154 155-159 160-164
Frequency 17 10 1
18. Explain the various operations on queue.
19. Write about Binary search and complexity.

PART C — (4 ´ 10 = 40 marks)
Answer any FOUR questions.
All questions carry equal marks
20. Find the inverse of the matrix. by Gauss elimination method.
21. Solve the following system by Gauss-Jordan method.
22. Find the coefficient of correlation for the following:
x: 21 22 23 24 25 26 27 28 29 30
y: 40 39 39 35 34 34 34 31 28 25

23. Form the regression equations:
x: 60 40 70 50 60 80 50 90 40 60
y: 3.0 2.5 6.0 4.5 5.0 4.5 2.0 5.5

24. Describe on linked list and circular queue. linked list
25. Explain Dijkstra’s algorithm in detail.

OCTOBER 2013

Time : Three hours
Maximum : 100 marks
PART A — (10 × 3 = 30 marks)
Answer any TEN questions.
All questions carry equal marks.
1. Write down the formula for false position and  Newton-Raphson methods.
2. Mention the formula for R.K. IInd order and Trapezoidal rule.
3. Define : Median and Mode.
4. What is coefficient of variation?

5. A bag contains 7 red, 12 white and 4 green balls. What is the probability of 3 balls drawn are all white?
6. Find the probability that exactly one head appears in a single throw of two fair coins.
7. The first four central moment of a distributions are 0, 2.5, 0.7 and 18.75. Test the skewness and kurtosis of the distribution.

8. What are three types of Regression?
9. What is algorithm? Give its criteria. Algorithm
10. Give the add procedure for stack.
11. Define : Tree.
12. Write down the general procedure for PREORDER.

PART B — (5 × 6 = 30 marks)
Answer any FIVE questions.
All questions carry equal marks.
13. Find a root of the equation 2 5 0 x3 – x – = to 3 significant digits using Secant method.
14. Dividing the range into 10 equal parts, find the approximate value of ∫ p 0 sin x dx by  Simpson’s 1/3 Rule
15. Calculate the standard deviation of the following distribution.
Age : 20–25 25–30 30–35 35–40 40–45 45–50
No. of persons : 170 110 80 45 40 35

16. Calculate quartile deviation and its relative measure.
Variable Frequency
40–49 306
50–59 182
60–69 144
70–79 95
80–89 42
90–99 34

17. Find the rank correlation coefficient for the following data :
X : 1 5 4 8 9 6 10 7 3 2
Y : 4 8 7 6 5 9 10 3 2 1
18. Explain the various operations on ‘STACK’.
19. Explain about hashing tables and shortest path.

PART C — (4 × 10 = 40 marks)
Answer any FOUR questions.
20. Given (dy/dx = 1+x2)/2 evaluate Y (0.4) by Milne’s predictor-corrector method.
21. Solve, by Gauss Elimination.
22. From the following data, calculate the first four moments about mean.
Class : 0–10 10–20 20–30 30–40
Frequency : 1 3 4 2

23. Calculate the coefficient of correlation from the following data :
X : 50 50 55 60 65 65 65 60 60 50
Y : 11 13 14 16 16 15 15 14 13 13

24. Explain with an example of doubly linked list and circular queue.
25. Describe on tree traversals and Dijkstra’s algorithms.

Download Previous/ Old Question Paper :
OCT 2013 :
https://www.pdfquestion.in/uploads/ideunom.ac.in/6805-._DEC2013_uid46435UCCE.pdf
OCT 2012 :
https://www.pdfquestion.in/uploads/ideunom.ac.i/6805-._DEC12_uid46435%20UCCE.pdf
May 2013 :
https://www.pdfquestion.in/uploads/ideunom.ac.in/6805-._MAY2013_uid46435%20UCCE.pdf
OCT 2011 :
https://www.pdfquestion.in/uploads/ideunom.ac.in/6805-d11._QBNEW_uid46435%20UCCE.pdf
May 2011 :
https://www.pdfquestion.in/uploads/ideunom.ac.in/6805-._MAY2011_uid46435%20UCCE.pdf