Question Papers of IGNOU MCA-NEW MCS013


MCS013: Discrete Mathematics
Year: 2005 TEE: December Time 2 Full Marks 50
Note: Question 1 is compulsory. Answer any three from the rest.

Q.1(e): Determine all the integer solutions to
x1 + x2 + x3 + x4 = 9, where xi = > 1, i = 1, 2, 3, 4

Q.2(a): A sequence of ten bits (0's and 1's) is randomly generated. What is the probability that at least one of the bits is 0 ?: [5]

Q.2(b): Find the number of permutation of the word ATTENDANT: [3]

Q.2(c): Write the contrapositive of the statement: 'If x is a positive real number, there is a number y such that y2 = x.': [2]


home || << Previous || Next >>