How To Exam?

a knowledge trading engine...


Veer Narmad South Gujarat University 2010-1st Sem M.C.A Methematical Foundation in Computer Science : (A.T.K.T), , - - Question Paper

Monday, 29 April 2013 07:35Web



M. C. A. (Sem. - I) (A.T.K.T.) Examination

April/May - 2010

105 - Mathematical Foundation in Computer Science

RF-4797

[Total Marks : 70

Time : 3 Hours]


Instructions

(1)

""'N Seat No.:


6silq<3i Puunkiufl [qaim SuwiA u* qsq d-onql. Fillup strictly the details of signs on your answer book.

Name of the Examination :

M. C. A. - 2

Name of the Subject:

105 - MATHEMATICAL FOUNDATION IN COMPUTER SCIENCE

-Section No. (1,2,.....): NIL

Student's Signature


-Subject Code No.


(2)    Attempt all five questions.

(3)    Questions numbered 1, 2, 3 carry 16 marks each.

(4)    Questions numbered 4 and 5 carry 12 and 10 marks respectively.

1. Answer any four of the following:

(i)    State multiplicative theorem of probability.

A problem in Statistics is given to three students A, B and C, whose probability of solving it are 1/3, 1/4 and 1/5 respectively. What is the

probability that the problem will be solved.

(ii)    The probability of a cricket match to be played between India and Sri Lanka at one of the three selected venues X, Y and Z are 0.25, 0.35 and 0.40 respectively. The probability that the match being disturbed at these three venues are 0.05, 0.04 and 0.02 respectively. A match is played and is disturbed, what is the probability that the match was played at X?

(iii) Define rank correlation.

The scores of 8 students in an examination in Mathematics and Statistics are given below:

Roll Nos.:

1

2

3

4

5

6

7

8

Marks in Mathematics :

: 70

48

58

55

54

50

60

52

Marks in Statistics

: 62

47

53

60

55

68

51

48

Find rank correlation coefficient between them.

(iv) The age and blood pressures of 10 women are:

Age    : 56 42 36 47 49 42 60 72 63 55

Blood Pressure: 147 125 118 128 145 140 155 164 149 150 Determine regression equation of blood pressure on age. Also estimate the blood pressure of a women whose age is 45 years.

(v)    Probability that a pen manufactured by a company will be defective is 1/10. If 12 such pens are manufactured, find the probability that

(a)    Exactly two pens will be defective,

(b)    At least two pens will be defective.

(vi)    Calculate mean and standard deviation for the following data:

Variable Frequency Variable Frequency

0-10

4

40-50

40

10-20

10

50-60

30

20 -30

22

60-70

15

30-40

32

70-80

8

2. Answer any four of the following:

4

-5

1

-8

7

2

-5

3

-3

B =

-7

9

5

1

-3

-1

3

5

13

Compute (a) AB, (b) atb (c) abt (d) BA

l a

a2

(ii)(a) Prove that

a2 1

a

=

(a3-l)2

a a2

1

b2+c2

ab

ac

(b) Prove that

ab

c2+a2

be

ac

be

a2+b2

= 4a b c .

(iii) Obtain the value of the followin

g determinant


4 10 14    4

2 10 4    8

2 14 -18    6

12 6 9    3

(iv) For the matrix A given below show that A2 - 4A - 51 = 0. Hence obtain A .

1 2 2

A =


2 1 2

2 2 1

(v)    For two square matrices A = (a and B = (tg, state the following results

are true or false with appropriate reasons. Also verify with the following matrices:

(a)    Ax(A + B) = A2 + AB

(b)    (A + B)x(A-B) = A2-B2.

(vi)    Solve the following system of equations using cramers rule, if the solution exists.

2x + 4y + z =3 3x + 2y -2z = -2 x - y + z = 6.

3. Answer any four of the following:

(i)    Define isomorphic graph. Prove that any two simple connected graphs with n vertices, all of degree two are isomorphic.

(ii)    Define with appropriate example:

(a) k-regular graph, (b) Walk in a graph, (c) bipartite graph, (d) sub-graph.

(iii)    Define with appropriate example:

(a) Simple graph, (b) finite and infinite graph, (c) complete graph,

(d) isolated graph.

(iv)    Describe Konigsberg bridge problem and its connection with Eulers graph.

(v)    Define (a) Tree, and (b) level of a vertex in a binary tree.

Show that a graph is a tree if and only if it is minimally connected.

(vi)    Show that the necessary and sufficient condition for a graph G to be a tree is that there is one and only one path between every pair of vertices in G.

4. Answer any three of the following:

(i)    Describe utilities problem and discuss its relevance in graph theory.

(ii)    Define degree of a vertex of a graph. Prove that the number of odd vertices in a graph is always even.

(iii)    A computer while calculating the correlation coefficient between two variables X and Y, obtained the following constants:

n=30, X = 120, Y = 90, x3 =600, y2 =250, XY = 356,

It was discovered later at the time of checking that it had copied down two pairs of observations as:

X) Y while the correct values were X | Y 8|14    8|12

8 | 6 6 ( 8 Compute the correct values of the correlation coefficient between X and Y.

(iv)    If the distribution of incomes of a group of persons be assumed to be normal with mean 500 and the standard deviation Rs. 50. Estimate the proportion of individuals with income (a) below Rs. 550, and (b) between Rs. 550 and Rs. 650.

(v) If A =

5

0

4

' 1

3

3

2

3

2

B =

1

4

3

I

2

1

1

3

4

then compute (AB)'

5. Answer any two of the following:

(i)    Let the probability density function of a random variable X be

f(x) = 0 < x <2. Compute: (a) p(x < -), (b) P(x> -),

2    2    4

(c) ?(T < x < t )> (d) E(x).

4 4

(ii)    A salesman lives in a city A He is supposed to visit the cities A2, A3,

and A4. The distance between these cities are as follows : (in Kms.)

AxA2 = 120, AjA3 = 140, AjA4 = 280,

A2A3 ~ 80, A2A4 = 180, A3A4 = 180,

Find the shortest round trip from Aj through the other 3 cities.

(iii) A =

' 1

0

-2

ro

5

-41

1

5

2

3

-1

0

B =

-2

1

3

C =

-1

-1

0

-2

1

1

-1

0

2

0

1

1

Then verify the following:

(a) A(B-C) = AB -AC, (b) (A+B)x(A-B) = A2 - B2.

RF-4797]    4    [ 200 ]

1







Attachment:

( 0 Votes )

Add comment


Security code
Refresh

Earning:   Approval pending.
You are here: PAPER Veer Narmad South Gujarat University 2010-1st Sem M.C.A Methematical Foundation in Computer Science : (A.T.K.T), , - - Question Paper