MCS 013

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

[2] MCS-013

(b) Prove that : 4


No. of Printed Pages : 4 MCS-013
1 1 1 n
  .......  
12 23 n (n  1) n  1

using mathematical induction.


M. C. A. (REVISED)/B. C. A. (REVISED)
(c) What is a proper subset ? Explain with the
(MCA/BCA)
help of a suitable example. 2
Term-End Examination (d) Find number of integers between 100 and

December, 2021 999 consisting of distinct even digits. 2

MCS-013 : DISCRETE MATHEMATICS (e) If f ( x )  x 3 and g ( x )  ( x 2  1)  x  R ,


where R is the set of real numbers.
Time : 2 Hours Maximum Marks : 50
Find : 3

Note : Question No. 1 is compulsory. Attempt any (i) (f o g)

three questions from the rest. (ii) (g o f)

(iii) (g o g)

1. (a) Explain if the following sentences are (f) Find the number of distinguishable words

proposition or not and why : 4 that can be framed from the letters of the
word “UNIVERSITY”. 2
(i) Sun rises in the east.
(g) Find dual of (A  B)  C and (A  B)  C .
(ii) Prepare for your exam.
3
(iii) Raju is 10-year old.

(iv) How far is Mumbai from here ? 2. (a) Show that 17 is irrational. 4

P. T. O.
[3] MCS-013 [4] MCS-013

(b) Find the Boolean expression for the 4. (a) Make truth table for the following : 2
following logic circuit : 4 p  (~ q  ~ r )  ( p  ~ r )

(b) Give geometric representation for the


following : 2

R × {4};
(c) Show that : 2
where R is a natural number.
~ ( p  q)  ~ p  ~ q
(c) What is Relation ? Explain equivalence
3. (a) Write the set expressions for the following
relation with the help of an example. 4
Venn diagrams : 3
(d) State and explain Pigeonhole principle. 2

5. (a) Draw logic circuit for the following Boolean


expression : 4

(X' + Y + Z) + (X + Y + Z' ) + (X'.Y)


(b) Prove that : 3
(b) In how many ways 10 students can be
n 1 C  nCr 1  nCr
r
grouped into 3 groups ? 3
(c) A die is rolled once. Find the probability of
(c) What is power set ? Find power set of set
each of the following events : 4
A = {1, 2, 4, 6}. 3
(i) getting an odd number

(ii) getting at most 3

(iii) getting at least 3

(iv) getting at least 7 MCS–013

P. T. O.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy