0% found this document useful (0 votes)
147 views71 pages

MCS 013

This document appears to be a collection of past examination papers for the course "Discrete Mathematics" from June 2010 to June 2022. It contains 26 entries, with each entry corresponding to an examination from June or December of a given year, and includes the question paper and solutions for that examination. The examinations assess topics in discrete mathematics, such as logic, proofs, sets, functions, relations, and probability.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
147 views71 pages

MCS 013

This document appears to be a collection of past examination papers for the course "Discrete Mathematics" from June 2010 to June 2022. It contains 26 entries, with each entry corresponding to an examination from June or December of a given year, and includes the question paper and solutions for that examination. The examinations assess topics in discrete mathematics, such as logic, proofs, sets, functions, relations, and probability.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 71

01._June_2010 MCS-013.

pdf
02._Dec_2010 MCS-013.pdf
03._June_2011 MCS-013.pdf
05._June_2012 MCS-013.pdf
06._Dec_2012 MCS-013.pdf
07._June_2013 MCS-013.pdf
08._Dec_2013 MCS-013.pdf
09._June_2014 MCS-013.pdf
10._Dec_2014 MCS-013.pdf
11._June_2015 MCS-013.pdf
12._Dec_2015 MCS-013.pdf
16._Dec_2017 MCS-013.pdf
17._June_2018 MCS-013.pdf
18._Dec_2018 MCS-013.pdf
19._June_2019 MCS-013.pdf
20._Dec_2019 MCS-013.pdf
21._June_2020 MCS-013.pdf
22._Dec_2020 MCS-13.pdf
23._June_2021 MCS-13.pdf
24._Dec_2021 MCS-013.pdf
25._June_2022 MCS-13.pdf
26._Dec_2022 MCS-013.pdf
No. of Printed Pages : 4 MCS-013 I

MCA (Revised)
.1.
in Term-End Examination
cA
0 June, 2010
0
MCS-013 : DISCRETE MATHEMATICS
Time : 2 hours Maximum Marks : 50

Note : Question No. 1 is compulsory. Attempt any three


questions from the rest.

1. (a) Show that 2

-(A(113) =-AU-B

In how many ways can three examinations 3


be scheduled within a five - day period so
that no two examinations are scheduled on
the same day.
Using principle of Mathematical Induction or 3
otherwise, prove that
- n(2n - 1) (2n + 1)
12 + 32 + 52 +----+ (2n - 1) 2
3

(d) Construct the truth table for following : 6

(13-) 4-*(P v q)

MCS-013 1 P.T.O.
Consider a set X = [2, 3, 4) and the Relation 3
defined on X by.
R = {(2, 2) (2, 3) (3, 3) (3, 4) (2, 4) (4, 4)}.
Find whether R is :
Reflexive
Symmetric
Transitive
Justify your answer
Construct the logic circuit for expression 3
(y i v y 2) A (Y3 A y4)1.

(a) (i) Calculate S32 + S42. 4


where 'S' Denotes Stirling Number of
the second kind.

(ii) Verify that [(p A q) A is 4


contradiction.
(b) If A = {1, 2, 3, 4, 5} B = {3, 5, 6, 7} Then 2
Find A A B .

(a) A survey among the students of college. 6


65 Study Hindi, 45 study Spanish, and 42
study Japanese, Further 20 study Hindi and
Spanish, 25 study Hindi and Japanese, 15
study Spanish and Japanese and 8 study all
the languages.
How many students are studying at
least, one language ?
How many students are studying only
Hindi.

MCS-013 2
1 2 3 41 r1 2 3 41
If f = [ 1 3 4 2 ] g 1 2 3 4 1.1 4
(b)

[1 2 3 4]
h=
4213

be permutation on A = {1, 2, 3, 4, 5}. Then find


(f o g) o h.

4. (a) Show that n3 + 2n is divisible by 3 for all 4


n> 1 by induction.
If A =R — {3) and B = R — {1} and function 3
x —2
f : A —>B is defined by f (x ) x 3 •

Show that 'f' is Invertible and find its Inverse.


Look at following figure. Is it a function ? 3
Why/why not ?

MCS-013 3 P.T.O.
1
5. 1 —
(a) In the Binomial Expansion 3x 8 5
3x
Find the Term Independent of 'x'.
Suppose we have seven rooms and want to 3
assign four of them to four programmers as
offices and use the remaining three rooms
for computer terminals. In how many ways
this can be done.
Define relation mathematically. 2

MCS-013 4
No. of Printed Pages : 3 MCS-0131

MCA (Revised)
Term-End Examination
0
•cr June, 2011
0
MCS-013 : DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50


Note : Question number 1 is compulsory. Attempt any three
questions from the rest.

1. (a) It is required to sit 5 men and 4 women in a 3


row so that the women occupy the even
places. How many such arrangements are
possible ?
(b) A question paper of discrete mathematics 4
has two sections of five questions each. In
how many ways can an examinee answer
six questions taking at least two questions
from each group ?
(c) If A and B are sets, prove that. 3
A UB = (A-B) UB

x
(d) Find f-1 (x) where f (x) = 3
x - 43
(e) Show that; - (PV (- P n Q)) PA Q 3
using logical equivalent formulas.

MCS-013 1 P.T.O.
(f) What is pigeon hole principle ? Using this 4
principle show that in any group of 36
people, we can always find 6 people who
were born on the same day of week.

2. (a) Express the Boolean expression in three 4


variables (x + y + z) (xy + x' z)' in DNF
(b) Use mathematical induction method, prove 3
that :

n(n + 1)
1+2+3+ +n —
2
(c) Prove that a relation R in the set Z of integers 3
defined by 'aRb <#. a — b is even' is an
equivalence relation.

3. (a) Prove that (P q) Vr (PVr) (qv r) 3


(b) If f: R -* R is a function such that 4
f (x) = 3x + 5
prove that f is one - one onto. Also find the
inverse of f
(c) Determine the number of integer solutions 3
to the equation x1 + x2 + x3 + x4 = 7 where
xi > 0 Vi =1,2,3,4

4. (a) Two dice, one red and one white are rolled. 4
What is the probability that the white die
turns up a smaller number than the red die ?

MCS-013 2
(b) What is duality principle ? Find dual of 3
(A U B) AC

(c) Verify that p A q A -p is a contradiction 3


and p —>q <=> - p v q is a tautology.

5. (a) Show that Vj is irrational 4

(b) Construct the logic circuit and obtain the


logic table for the expression x1 v (x'2 A x'3)
(c) How many numbers are there between 100 3
and 1000 such that 7 is in the unit's place ?

MCS-013 3
No. of Printed Pages : 3 MCS-013

MCA (Revised)
Term-End Examination
N-
June, 2012

MCS-013 : DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50


Note : Q. No. 1 is compulsory.
Attempt any three from the rest.

1. (a) Show that pV— (pAq) is a tautology.


3
(b) Prove the following equivalence 3
—V x P(x) 7-- 3x--P(x)
(c) Use principle of mathematical induction to 3
prove that n3 —n is divisible by 3.
(d) Write the output of following circuit. 3
xl
X2

(e) Let R be a relation on the set A = (1, 2, 3, 4} 3


such that aRb if and only if a + b>5. Check
if R is reflexive, symmetric, transitive.

MCS-013 1 P.T.O.
(f) How many permutations are there for the 2
word ASSOCIATION ?
(g) Three coins are tossed and number of heads 3
are observed. Find the probability that
(i) at least one head appears
(ii) all heads or all tails appear.

2. (a) Prove De Morgan's laws using truth table. 3


(b) Present a Direct proof of the statement. 3
"Square of an odd integer is odd".
(c) Explain : 4
(i) Proof by contrapositive
(ii) Proof by contradiction
with the help of suitable examples.

3. (a) Write boolean equation for the following 4


circuit.

(b) Reduce the following boolean equation to 3


simplest form.
(anb'nc)v(anb'nc')v(a'nbnc')v(a'nb'nc')
(c) Write a short note on "Principal of Duality". 3

MCS-013 2
4. (a) Let A, B and C be three sets such that 2
AuB = AuC. Does it imply B =C ? Support
your answer by suitable example.
(b) Prove AX(BuC) = (AXB)u(AXC) 3
(c) Let f (x) = x2 and g(x) = x + 7 2
Find fog (x) and gof (x).
(d) Let A be the set of natural nos. 1, 2, 3, 4...., 3
Let R be a relation on A such that aRb if
and only if a mod 5= b mod 5. Prove that R
is equivalence relation.

5. (a) In how many ways can a party of 9 people 3


arrange themselves around a circular
table ?
(b) What is the sum of coefficients of all the 3
terms in the expansion of (a + b + c)5 ?
(c) In how many ways r distinct objects can be
distributed into 5 different boxes with at
least one box empty ?

MCS-013 3
No. of Printed Pages : 4 MCS-013

MCA(Revised)
kn
(N1 Term-End Examination
O
December, 2012

MCS-013 : DISCRETE MATHEMATICS


Time : 2 hours Maximum Marks : 50
Note : Q. No. 1 is compulsory.
Attempt any three from the rest.
1. (a) Prove the following equivalence 3
— (3x — P(x))=exP(x)
(b) Use proof by contradiction to prove that 3
Vf is irrational.
(c) Simplify the following boolean expression 3
(a'Ab'n c') v (a'n bin c) v (a Ab'A ci)v(a'Ab A c')
(d) Use Venn diagram to show the following 3
set operation.
(i) p, (ii) A u(B(lc)

(iii) A n (B U C )
(e) Why is y2 = x not a function ? 2
An urn contains 15 balls, 8 of which are red 2
and 7 are black. In how many ways 5 balls
can be drawn such that
(i) all 5 are red.
(ii) 3 are red and 2 are black.

MCS-013 1 P.T.O.
(g) In a survey of 260 college students following 4
data was obtained.
64 had taken mathematics cource
94 had taken computer science.
58 had taken business studies.
28 had taken both mathematics and
business studies
26 had taken both mathematics and
computer science
22 had taken both computer science and
business studies
14 had taken all three types of courses .
What is the probability that a student chosen
at random had not taken any course ?

2. (a) Construct truth table to check whether the 3


following is a tautology, contigency or
absurdity.
(i) pi\ ^ p (ii) q (q p)
(b) If p --> q is false, what is the truth value of 2

(p n q)) --> q ? Explain.


(c) Write the contrapositive & converse of the 2
statement :
If it rains then I will get wet.
(d) Prove by mathematical induction 3

3 n2 (n + 1)2
13 +2 3 +33 + — — +n
4

MCS-013 2
3. (a) For the following circuit write the boolean 3
expression

(b) Make the circuit for the following boolean 3


expression using logic gates

((Xi. A X2 ) V (X3 V X4)) A (Xi A X3)'A (X2 A Xf4)

(c) For the following truth table write DNF and 4


CNF.

Xi x2 X3f(X1/X2/X3)
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 1
1 1 1 1

4. (a) Explain the following types of relations with 4


the help of suitable examples.
(i) Reflexive (ii) Antisymmetric
(iii) Transitive (iv) Equivalence

MCS-013 3 P.T.O.
(b) Let : 2
( 1 2 3 4 \I '1 2 3 4
(2 4 1 3 )and g–
f 3 2 1 4 I
Find fog and gof.
(c) In how many ways 6 men and 6 women 2
can sit alternately in a row.
(d) "If a function is not one to one then it is not 2
invertible." Explain.

5. (a) Prove that n +1 Cr = n Cr + n C r _ i • 3


(b) A and B are two mutually exclusive events 2
such that P(A) =0.3 and P(B)=0.6. What is
the probability that
(i) B does not occur?
(ii) A or B occurs.
(c) If there be a set A partitioned into n number 3
of subsets. Show that the largest subset
A1
contains at least — number of elements.
n
(d) How many 7 digits numbers are composed 2
of only odd digits ?

MCS-013 4
No. of Printed Pages : 3 MCS-013

MCA(Revised)
Term-End Examination
June, 2013
00
O
MCS-013 : DISCRETE MATHEMATICS
Time : 2 hours Maximum Marks : 50
Note : Question number 1 is compulsory. Attempt any three
question from the rest.

1. (a) A carpenter has twelve patterns of chairs 3


and five patterns of tables. In how many
ways can he make a pair of chair and
table ?
(b) If 30 books in a school contain a total of 3
61,327 pages, then show that one of the
books must have at least 2045 pages.

(c) Prove that A— B= A An B=Q 3


(d) Find the domain for which the functions 4
f (x) = 2x2 —1 and g(x) = 1 — 3x are equal.
Also find a domain for which the functions
are not equal.
(e) Construct the truth table of (7pvq) n (7rvp). 4
(f) Show that a.b+a'.b' = (a' + b).(a +br) 3

2. (a) Use mathematical induction method to 4


prove that 1+3+5 +...+ (2n — 1) = n2.

MCS-013 1 P.T.O.
(b) Prove that n ! (n + 2)=n !+ (n +1) ! 3
(c) Consider the set of ordered pair of natural 3
numbers N x N defined by :

(a, b) R (c, d) a a + d ---b + c. Prove that R


is an equivalence relation.

3. (a) Show that (pAq) = (pvq) is a tautology. 3


(b) Prove that the inverse of one-one onto 4
mapping is unique.

(c) How many solutions does the equation 3


x1 + x2 + x3 =11 have, where x1, x2 and x3
are non negative integers ?

4. (a) Express the Boolean expression 4


xyz'+y'z+xz' in a sum of product form.

(b) Find the output of the given circuit. 3

(c) Show that : 3


(p-*q) --> q a pvq

MCS-013 2
5. (a) In how many ways a person can invite eight 4
of his friends to a party by inviting at least
one of them be a female. Considering that
the person is having 15 male and 8 female
friends.
(b) Let A be the set { 1, 2, 3, 4 }. Which ordered 3
pairs are in the relation
R = {(a, b) I a divides b} ?
(c) Explain duality principle with the help of 3
example.

MCS-013 3
No. of Printed Pages : 2 MCS-013
MCA(Revised)
-714
Term-End Examination
00
m7t. December, 2013
Q
MCS-013 : DISCRETE MATHEMATICS
Time : 2 hours Maximum Marks : 50
Note : Question number 1 is compulsory. Attempt any three
questions from the rest.

1. (a) In how many ways 100 voters can vote for 3


three candidates standing for the election
of the post of president of their
association ?
(b) How many five different letter words can be 3
formed out of the word "LOGARITHMS" ?
(c) Prove that (AL)B)' = A'nB'. 4
(d) Let A = {1, 2, 3, 4, 5) and define Ron A by 3
xRy if x +1 = y. Find :
(i) R (ii) R2 (iii) R3
(e) Construct a truth table for the given 3
proposition (7p <=> 7q) a (q <=> r)
(f) Find the dual of (x . _L) + (x . y) + (y . z) 4
+ (z . 0)

2. (a) Show that ((p —> q) —> q) —> (p v q) is a 3


tautology.
(b) Use mathematical induction method to 4
prove that n3 + 2n is divisible by 3 for n 1.
(c) If f : A —> B such that f(x) = x —1 and 3
g : B —> C such that g(y) = y2 find fog (y).

MCS-013 1 P.T.O.
3. (a) Let R be a relation in the set of all lines in a 4
plane defined by aRb if line 'a is parallel to
line b'. Then prove that R is an equivalence
relation.
(b) Find n if p(n, 4) =42 p(n, 2). 3
(c) Express the Boolean expression in three 3
variables (x + y+ z) (xy + x'z)' in DNF.

4. (a) Construct a logic circuit by minimizing the 5


Boolean function
f(x, y, z)= xyz + xyz + + xi/ •
(b) If there are 12 persons in a party and if each 5
two of them shake hands with each other,
how many hand shakes happen in the
party ?

5. (a) What is the minimum number of students 4


required in a particular class to be sure that
atleast six students will receive the same
division if there are five possible divisions.
(b) Find the dual of (An13)' n C. 3
(c) Show that p —> q= 7q —> 7p. 3

MCS-013 2
No. of Printed Pages : 2 MCS-013
MCA(Revised)
Term-End Examination
-14
June, 2014
LC•

MCS-013 : DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50


Note : Question number 1 is compulsory. Attempt any three
questions from the rest.
1
1. (a) Let f (x) = — and g(x) = x3+ 2 where 3
x
x€11. Find (f+ g) (x) and (fg) (x) ?
(b) Draw Venn diagram to represent AA13 3
where A and B are two sets.
(c) If A and B are two mutually exclusive events 2
such that P(A) = 0.3 and P(B) = 0.4 What
is the probability that either
A or B does not occur ?
(d) Prove that 3
1 1 1
+ +
1.2 2.3 n(n + 1) n + 1 using
Mathematical Induction.
(e) Show that pv(cinr) and (pvq)A(pvr) are 3
logically equivalent.
(f) Prove that product of two odd integers is 3
an odd integer ?
(g) How many different strings can be made 3
from the letters of the word "SUCCESS"
using all the letters ?

MCS-013 1 P.T.O.
2. (a) Let A =R - {3} and B=R - {1}. f : A B 5

defined by f (x) x 23 findf-1 ?


(b) Let R is the relation on the set of strings of 5
Hindi letters such that aRb iff 1(a) = /(b)
where 1(x) is length of string x. Show that
R is an equivalence relation.
3. (a) Write contrapositive, converse and the 3
inverse of the implication "The home team
does not win whenever it is raining."
(b) Draw the logic circuit for the expression 4
Y=ABC+A' C' + B' C'
(c) Determine the number of integer solutions 3
to the equation x1 + x2 + x3 + x4 =7, where
xi ob i =1, 2, 3, 4.

4. (a) Five balls are to be placed in three boxes. 5


Each box can hold all the five balls. In how
many ways can we place the balls so that
no box is empty if balls and boxes are
different ?
(b) Show that r can be derived from 5
p -> r v p and q.

w that a map f : R --->R defined by 4


f(x) = 2x +1 for x€R is a objective map from
R to R.
(1 2 3) (1 2 3
(b) If f= 2 3 1) and g = ( 3 2 . Find fog 4

and gof ?
(c) List all the permutations of {a, b, c}. 2

MCS-013 2
No. of Printed Pages : 3 MCS-013

MCA (Revised) / BCA (Revised)


Term-End Examination
December, 2014
1 204

MCS-013 : DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50


Note : Question number 1 is compulsory. Attempt any
three questions from the rest.

1. (a) Let A = fa, b, c, d}, B = 11, 2, 3} and


R = ((a, 2), (b, 1), (c, 2), (d, 1)1. Is R a
function ? Why ? 3
(b) Under what conditions on sets A and B,
AxB=B x A? Explain. 3
(c) How many bit strings of length 8 contain
at least four 1s ? 3
(d) Show that the proposition p -+ q and - p v q
are logically equivalent ? 2
(e) Use mathematical induction to show that
n! > 211-1 for n > 1. 3
(0 A coin is tossed n times. What is the
probability of getting exactly r heads ? 3
(g) Prove that if x and y are rational numbers,
then x + y is rational. 3
MCS-013 1 P.T.O.
2. (a) Find f -1, where f is defined by fix) = x3 - 3
where x E R.
(b) Let the set A = {1, 2, 3, 4, 5, 61 and R
is defined as R = {(i, j) I I i - ji = 2}. Is IV
transitive ? Is 'R' reflexive ? Is 'R'
symmetric ? 5

3. (a) What are the inverse, converse and


contrapositive of the implication "If today is
holiday then I will go for a movie." ? 3

(b) Draw the logic circuit for


Y = AB'C + ABC' + AB'C' 4

(c) In how many ways can a prize winner


choose three books from a list of
10 bestsellers, if repeats are allowed ? 3

4. (a) What is understood by the logical


quantifiers ? How would you represent the
following propositions and their negations
using logical quantifiers : 5
(i) There is a lawyer who never tells lies.
(ii) All politicians are not honest.

(b) Show that


(-pn(-qnr))v(qnr)v(pAr)<=>r 3

(c) Define Modus Tollens. 2

MCS-013 2
5. (a) If R is the set of all real numbers, then
show that a map g : R —› R defined by
g(x) = x for x E R is a bijective map. 4

(b) Let A = (1, 2, 3, 41 and

11 2 3 4
f=
2 4 1 3

11 2 3 4
g=
4 1 2 3

Find fog and gof. 4

(c) A club has 25 members. How many ways


are there to choose four members of the
club to serve on an executive committee ?

MCS-013 3 14,000
No. of Printed Pages : 3 MCS-013 I

MCA (Revised) / BCA (Revised)


Term-End Examination
June, 2015

MCS 013 : DISCRETE MATHEMATICS


-

Time : 2 hours Maximum Marks : 50


Note : Question number 1 is compulsory. Attempt any
three questions from the rest.

1. (a) Write down the truth table of


p --> q r r E131q.
Also explain whether it is a tautology or
not. 5

(b) Show that is irrational. 4

(c) Give the geometric representation of


R x 121. 3

(d) Find the f inverse of the function


f : f(x) = x3 — 3. 3

(e) Present a direct proof of the statement :


"Square of an odd integer is odd." 3

(f) How many permutations are there for the


word 'UNIVERSITY" ? 2

MCS-013 1 P.T.O.
2. (a) (i) Check whether
(A U B) n c.AU (B n C) or not,
using Venn Diagram. 3
(ii) Find the dual of A U (B U C). 2

(b) Prove that C (n, r) = C (n, n — r), for


0 <r<n,nE N. 5

3. (a) State and prove Addition Theorem of


Probability. 5

(b) Show that in any group of 30 people, we


can always find 5 people who were born on
the same day of the week. 3

(c) State Pigeonhole principle. Also give an


example of its application. 2

4. (a) What is the probability that a number


between 1 and 200 is divisible by neither
2, 3, 5 nor 7 ? 3

(b) In how many ways can 20 students be


grouped into 3 groups ?

(c) In how many ways can r distinct objects be


distributed into 6 different boxes with at
least two boxes empty ? 4

MCS-013 2
5. (a) Give an example of a compound proposition
that is neither a tautology nor a
contradiction. 2

(b) Show that 2'1 > n3 for n > 10. 5

(c) Draw the logic circuit for the following


boolean expression :
x.y + x. y' + x. y. 3

MCS-013 3 12,000
No. of Printed Pages : 3 I MCS-013
MCA (Revised) / BCA (Revised)
Term-End Examination
December, 2015

MCS-013 : DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question number 1 is compulsory. Attempt any


three questions from the rest.

1. (a) Write the truth value of the disjunction of


"The earth is flat" and "3 + 5 = 2". 2

(b) If p and q are two propositions, then show


that-(p V n -q. 4

(c) Use Mathematical induction to prove that


11 1 1
1+-+-+ < 2 - - V n E N.
4 9 n2 -

(d) If f : R --> R is a function such that


f(x) = 3x + 2, prove that f is one-one onto.
Also, find the inverse of f. 4

(e) How many integers between 100 and 999


consist of distinct even digits ?

MCS-013 1 P.T.O.
(f) Show that the number of words of length n
on an alphabet of m letters is m n.

2. (a) Prove that :


(n + 1)
C(n, r) = C(n + 1, r + 1). 5
(r + 1)

(b) Express the Boolean expression in three


variables (x + y' + z') (xy + x'z) in DNF. 5

3. (a) Two dice, one red and one white, are rolled.
What is the probability that the white die
turns up a smaller number than the red
die ? 4

(b) State and explain De Morgan's law for


Boolean algebra. Also, explain duality
principle with the help of an example. 4

(c) In how many distinct ways is it possible to


seat eight persons at a round table ? 2

4. (a) Use Mathematical induction to prove that 4

+ + n = n (n + 1) (2n + 1)
12 + 22 + 32 n N.
6

MCS-013 2
(b) Find the Boolean expression C for the
following logic circuit :

x3

(c) Prove the following equivalence : 2


— V x P(x) a3X P(x)

5. (a) Verify that pAqn—p is a contradiction


and p —> co-> — p v q is a tautology. 5

(b) Show that is irrational. 5

MCS-013 3 19,000
No. of Printed Pages : 3 I MCS-013 I
MCA (Revised) / BCA (Revised)
Term-End Examination
December, 2017
00690

MCS 013 : DISCRETE MATHEMATICS


-

Time : 2 hours Maximum Marks : 50

Note : Question number 1 is compulsory. Attempt any


three questions from the rest.

1. (a) Translate the statement


"The sum of two positive integers is
positive" into a logical expression. 2

(b) Write the negation of


"If x is an integer then x is a rational
number." 2

(c) Prove that if x2 is an even integer, then x is


an even integer by contraposition method. 3
(d) Draw a Venn Diagram to show the
following set operations : 3
(i) A — B
(ii) (A n B) U C
(iii) (A n B) n c
MCS-0 1 3 1 P.T.O.
(e) A box contains 5 balls. Find the number of
ordered samples of size 2
(i) with replacement, and
(ii) without replacement. 4
(0 Check whether the function f(x) = x + 1 is
one-one or not. 2
(g) How many numbers from 0 to 999 are not
divisible by either 5 or 7 ? 4

2. (a) A and B are mutually exclusive events such


that P(A) = 0.3 and P(B) = 0.4. What is the
probability that either A or B does not
occur ? 3
(b) How many six-digit numbers contain
exactly three different digits ? 2
(c) In how many ways can an employer
distribute 100 one-rupee notes among
6 employees so that each gets at least one
note ? 3
(d) How many words can be formed from A, B,
C, using the letter A thrice, the letter B
twice and the letter C once ? 2

3. (a) Explain Pascal's Triangle. 2


(b) Given A = (1, 2, 3, 4) and Relation R as
{(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (4, 4)).
Examine whether R is
(i) Symmetric
(ii) Reflexive
(iii) Transitive
MCS-013 2
(c) Let f : R R defined by f(x) = 3x - 4.
Find f-1. 3
(d) Let A = fa, b, c, dl, B = 11, 2, 31,
R = f(a, 2), (b, 1), (c, 2), (d, 1)).
Is R a function ? Why ? 2

(a) Find CNF of (p V q) H (p A q). 4

(b) What is a proper subset ? Write the


number of proper subsets of the set
{a, b, c, d}. 3
(c) Draw the circuit for the following Boolean
expression using logic gates
Y = ABC + A'BC' + ABC'. 3
5. (a) Construct a truth table to check whether
the following is a tautology or a
contingency or a contradiction : 4
(i) p ---> (q > p)

(ii) p A (q A p)
(b) 'If today is a holiday then I will go for a
movie.' Write
(i) Inverse
Contrapositive 2
(c) Show that n2 > 2n + 1 for n 3 by
Mathematical Induction. 4

MCS-013 3 11,000
No. of Printed Pages : 3 I MCS-013

MCA (Revised) / BCA (Revised)


Term-End Examination
June, 2018
jejtr--j-_

MCS 013 : DISCRETE MATHEMATICS


-

Time : 2 hours Maximum Marks : 50

Note : Question number 1 is compulsory. Attempt any


three questions from the rest.

1. (a) How many three digit numbers are there


with no digit repeated ?

(b) Show that 2


— (pVq)=---pA—q

(c) Prove that 3


ab + fc (a' + = ab + c

(d) Find the domain for which the function


fix) = 3x2 — 1 and g(x) = 1 — 5x are equal.
Also find a domain for which the functions
are not equal.

MCS-013 1 P.T.O.
(e) Prove that 3
(A—B)UB=AUB

(f) If there are 12 persons in a party, and if


each two of them shake hands with each
other, how many handshakes happen in
the party ? 3

(g) Show that for integers greater than zero : 3


211 > = n + 1

2. (a) Use mathematical induction method to


prove that
n(n + 1) (2n + 1)
1 2 + 2 2 + 3 2 ++ n 2 =
6
(b) Draw Venn diagrams to represent the
following for sets A, B and C. 4
(i) A B
AnBUC
Find n if 2P(n, 2) + 50 = P(2n, 2). 2

If f : R --> R is a function such that


f(x) = 3x + 5, prove that f is one-one onto. 4

Show that p V (q A r) <=> (p V q) A (p V r) is a


tautology. 3
(c) Find in how many ways can 25 identical
books be placed in 5 identical boxes. 3

MCS-013 2
4. (a) Find the Boolean Expression for the given
circuit. 3
x >

z
Figure 1

(b) Show whether 17 is rational or


irrational. 4

(c) Prove that 3


p<=4.ci - --( pq)A(qp)•

5. (a) Let A = fa, b, c, dl, B = (1, 2, 31 and


R = ((a, 2), (b, 1), (c, 2), (d, 1)1. Is R a
function ? Why ?
(b) How many permutations are there of the
letters, taken all at a time, of the word
DISTINCT ? 3

(c) Show that in any group of 30 people, we


can always find 5 people who were born on
the same day of the week.
(d) Find how many 4 digit numbers are odd.

14,000
MCS-013
No. of Printed Pages : 3 1MCS-013(S)

MCA (Revised) / BCA (Revised)


Term-End Examination
r. . . I 1 •11 1

December, 2018

MCS-013(5) : DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question number 1 is compulsory. Attempt any


three questions from the rest.

1. (a) Find the dual of


(i) An(BnC).(AnB)nCand
(ii) (A U B) n (A U C). 4
(b) Give the geometric representation of
R x (2). R is the set of Real Numbers.
(c) Find the number of distinct sets of 5 cards
that can be dealt from a deck of 52 cards.
(d) Find the number of ways of placing
n people in (n — 1) rooms, no room being
empty. 4
(e)
Verify that p A q A (- p) is a contradiction
and p co-* p v q is a tautology. 4
MCS-013(S) 1 P.T.O.
2. (a) Prove that if x, y E I such that xy is odd,
then both x and y are odd, by proving its
contrapositive. I is the set of Integers. 5

(b) Design a logic circuit to operate a light


bulb by two switches x i and x2.

3. (a) A box contains 3 red, 3 blue and 4 white


socks. In how many ways can 8 socks be
pulled out of the box, one at a time, if order
is important ? 5

(b) Suppose 5 points are chosen at random


within or on the boundary of an equilateral
triangle of side 1 metre.
Show how we can find two points at a
1 5
distance of at most — metre.
2

4. (a) Find the boolean expression for the


following circuit : 4

MCS-01 3(S) 2
(b) Find the inverse of the following function : 3
f(x) .= X3 — 3

(c) State and explain Pigenhole principle. 3

5. (a) A car manufacturer has 5 service centres in


a city. 10 identical cars were served in
these centres for a particular mechanical
defect. In how many ways could the cars
have been distributed at the various
centres ? 6

(b) Show that V5 is irrational. 4

MCS-013(S) 3 14,000
89792

No of Printed Pages : 4 MCS-013


M. C. A. (REVISED)/B. C. A. (REVISED)
Term-End Examination
June, 2019
MCS-013 : DISCRETE MATHEMATICS

Time : 2 Hours Maximum Marks : 50


Note : Question No. 1 is compulsory. Attempt any

three questions from the rest.

1. (a) Obtain the truth value of the disjunction of

"The earth is flat" and "3 + 5 = 2." 4


(b) Write down the truth table of
(p —> q n — r) (r e q). 4

(c) Show that 24 > n3 for n > 10 .


(d) Design a logic circuit capable of operating a
central light bulb in a hall by three
switches xi, x2, x3 (say) placed at the three
entrances to that hall. 4
(A-1) P. T. O.
[ 21 MCS-013

(e) If X = b, c} and Y = (1;2, 3) , find X x X

and X x Y. 4

2. (a) Suppose 10 people have exactly the same

briefcase, which they leave at a counter.

The briefcases are handed back to the

people randomly. What is the probability

that no one gets the right briefcase ? 5

(b) What is a function ? Explain the following

types of functions with example : 5

(i) Bijective

Surjective

3. (a) Show that : 5

(p --›- q) A (p -+ -r) [p (q v r)].

(b) Prove that (x v y)t = x' n y' and

(X A y 5

(A-1)
31 MCS-013

4. (a) Let f : B2 -+ B be a function which is


.

defined by : 5

f (0,0) = 1,1 (1,0) = 0,

f (0,1) =1, f (1,1) = 1

Find the Boolean expression 'specifying the

function f.

(b) Give the expression

(XiV(X2A4))A(X2V X4

find the corresponding circuit, where

xi (1 5 i 5 4) are assumed to be inputs to

the circuitary. 5

5. (a) There is a village that consists of two types

of people-those who always tell the truth

and those who always lie. Suppose that you

(A-1) P. T. O.
[4] MCS-013

visit the village and two villagers A and B

come up to you. Further suppose :

A says, "B always tells the truth" and B

says, "A and I are of opposite types." What

types are A and B ? 5

(b) Draw a Venn diagram to represent the


following : 5
(i) (A B) n (A C)

(ii) (A L) B) n C

MCS-013 10,000

(A-1)
5 730i

No. of Printed Pages : 4 MCS-013


M. C. A. (REVISED)B. C. A. (REVISED)
(MCA/13CA)
Term-End Examination
December, 2019
MCS-013 : DISCRETE MATHEMATICS

Time : 2 Hours Maximum Marks : 50


Note : Question number 1 is compulsory. Attempt
any three questions from the rest.

1. (a) Construct the truth table for the formula :


= (P (Q —> R) —> ((P —> —“P R))

Check whether it is a tautology or not . 5

(b) Show that is irrational. 4

(c) Given A = {1, 3, 5, 7), B = {2, 3, 5, 8).

List all the elements of (A n B) x (B — A). 3

(d) Show that the function f (x) = x 3 and

g (x) = x113 for all x e R are inverse of one

another. 2

113 (B-17) P. T. O.
[ 2] MCS-013

(e) Give the direct proof of the statement : 3

"The product of two odd integers is odd."

(f) How many license plate containing two


letter followed by three digit can be
formed 2 If the letters as well as digits can
be repeated. 3

(a) Find the power set of : 2

A= (a, b, c, d}.

(b) In a group of students, 70 have a personal


computer, 120 have a personal stereo and
41 have both. HoW many own at least one
of these device ? Draw an appropriate
Venn diagram. 4

(c) 1" C98 = 999C97 + xC901 Find x.


. 4

3. (a) Draw logical circuit for the following logical


expression : 3

xi A
(b) Find the probability of getting the sum 9 or
11 in a single throw of two dice. 3
I 31 MCS-013

(c) A drawer contains ten black and ten white


socks. What ie the least no. of socks one
must pull out -to be sure to get a matched
pair ? 4

4. (a) A problem of discrete mathematics is given


to three students whose chances of solving
1 1
it are — 1 and —. What is the probability
2 4
that exactly one of them solves it ? 3

(b) A house has 4 doors and 10 windows. In


how many ways can a thief rob the house
by entering through a window and exiting
through a door ? 3

(c) A committee of 2 hawkers and 3


shopkeepers is to formed from 7 hawkers
and 10 shopkeepers. Find the no. of ways
in which this can be done if a particular
shopkeeper is included and a particular
hawker is excluded. 4
MCS-013

5. (a) Show that 5 divides n 5 - n , where It is a

non-negative integer. 4

(b) Write the negation of the following


statement : 2

"If he studies he will pass the


examination."

Give the output of the given circuit : 4

MCS-013 12,000
No. of Printed Pages : 4 MCS-013
M. C. A.B. C. A. REVISED
(MCA/BCA)
Term-End Examination
June, 2020
MCS-013 : DISCRETE MATHEMATICS

Time : 2 Hours Maximum Marks : 50

Note : Question No. 1 is compulsory. Attempt, any

three questions from the rest.

1. (a) Check whether the following formula is


tautology, contradiction or contingency : 5

((13 Q).-± v v (ID)

(b) Two finite sets have x and y number of


elements. The total number of subsets of
the first set is four times the total number
of subsets of second set. Find out the value
of x — y. 4

P. T. O.
[2] MCS-013

(c) In a group of 400 people 250 can speak in


English only and 70 can speak Hindi only.3

(i) How many can speak English ?

(ii) How many can speak Hindi ?

(iii) How many can speak both English


and Hindi ?

(d) If f A —> B and g : B —> C are injective


function, then gof: A —> C is an injective
function. Prove or disprove. 3
(e) Use the method of proof by contradiction to
show that x e R. if x 3 + 4x = 0 , then x = O.
3
(f) Three persons enter in a railway
compartment. If there are 5 seats vacant,
in how many ways they can take these
seats ? 2

2. (a) Given : 5
A = {1, 3, 5, 7}

B = {2, 3, 5, 8}

List the elements of (A x B) x (B — A).

Is (A x B) (B — A) a subset of A x B ?
[3] MCS-013

(b) Prove that : 5


n+lcr (0 5
n Cr ner-1 = r n) .

3. (a) Show that in any set of eleven integers


there are two which are divisible by 10, by
applying pigeonhole principle. 3
(b) How many solutions are there of : 4
x+y+z=17
subject to the constraints :
x 1
y 2

z2 3.
(c) If : 3
1
P (A) = —
4

P (B) = —
5

and P (A u B) = 1—
2
find :
(i) • P (A n B)

P (A n H)

P. T. O.
141 MCS-013

4. (a) Five balls are drawn from a bag containing


6 white and 4 black balls. What; is the
probability that 3 are white and 2 black ? 3

(b) From the digit 1, 2, 3, 4, 5, 6, how many


three digit odd numbers can be formed
when
(i) repetition of digit is allowed ? 2
(ii) repetition of digit is not allowed ? 2
(c) How many numbers divisible by 2 lying
between 50,000 and 70,000 can be formed
from the digits 3, 4, 5, 6, 7, 8, 9, no digit
being repeated in any number. 3
5. (a) Show that : 4
1.2 + 2.3 + n (n + 1) — n (n + 1) (n + 2)
3
(b) Write the negation of the following
statement : 2
If it is raining, then the game is cancelled.
(c) Draw the circuit represented by the
following Boolean function : 4
f : xy +

MCS-013
364o
No. of Printed Pages : 4 MCS-013

MCA (Revised) / BCA (Revised)


Term-End Examination
February, 2021

MCS-013 : DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Answer any three


questions from the rest.

1. (a) Show using truth table whether (p  q  r)


and (p  r)  (q  r) are equivalent or not. 3

(b) Using Mathematical Induction, prove that :


n(n  1)
1 + 2 + 3 + ... + n = . 4
2

(c) Prove that if A is a set with n elements,


then |P(A)| = 2n. 3

(d) If there are 7 men and 5 women, how many


circular arrangements are possible in
which women do not sit adjacent to each
other ? 3

MCS-013 1 P.T.O.
(e) Find Boolean expression for the following
logic circuit : 3

(f) If f : R  R be a function given by


f(x) = x3 – 2, find whether f –1 exists or
not. If f –1 exists, find it. 4

2. (a) How many words can be formed using the

letters of the word ‘‘DEPARTMENT’’, if


each letter must be used at most once ? 4

(b) Give geometric representation for


{1, 3}  {– 2, 3}. 2

(c) Show that (p  q)  q = p  q. 2

(d) Find the number of ways to distribute


20 distinct objects into 10 distinct boxes
with at least 4 boxes remaining empty. 2

MCS-013 2
3. (a) Draw Venn diagrams for the following
expressions : 3
(i) ABC
(ii) ABC
(iii) ABC

(b) Draw logic circuit for the following Boolean


expression : 2
(X1  X2)  (X1  X2)

(c) Write the following statements in the


symbolic form : 2
(i) Every thing is correct.
(ii) All birds can not fly.

(d) Explain Principle of Duality with the help


of an example. 3

4. (a) Show that 11 is irrational. 4

(b) What is an indirect proof ? Explain with the


help of an example. 3

(c) Explain De Morgan’s Laws with the help of


Venn diagram. 3

5. (a) In a ten-question true-false exam, a student


must achieve five correct answers to pass. If
he selects his answers randomly, what is
the probability that he will pass ? 3
MCS-013 3 P.T.O.
(b) In how many ways can an employer
distribute 50 twenty-rupee notes among
5 employees so that each gets at least one
note ? 2

(c) Show that in any group of 30 people, you


can always find 5 people who were born on
the same day of the week. 3

(d) Draw truth table for : 2


(p  q)  p

MCS-013 4
No. of Printed Pages : 3 MCS-013

MCA (Revised) / BCA (Revised)


Term-End Examination
June, 2021

MCS-013 : DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any three


questions from the rest.

1. (a) Write the truth value of the conjunction of :


‘‘The earth is round’’ and ‘‘3 > 4’’. 2

(b) Use Mathematical Induction to prove that :


1 1 1 1
1+ + + ... 2–  n  N. 4
4 9 2 n
n

(c) If f : R  R is a function such that


f(x) = 3x – 2, prove that f is injective. Also
find the inverse of f. 5

(d) Show that p(q  r) and (p  q)  (p  r)


are logically equivalent. 3

MCS-013 1 P.T.O.
(e) A and B are two mutually exclusive events
such that P(A) = 0.4 and P(B) = 0.2. What
is the probability that :
(i) A does not occur ?
(ii) A or B does not occur ?
(iii) Either A or B does not occur ? 3
(f) Find the number of ways of placing
n people in n – 1 rooms, no room being
empty. 3
2. (a) What is integer partition ? Write down all
the partitions of 8. Also find P84 and P87 . 4

(b) Find Boolean Expression for the following


logical circuit : 4

(c) Let two functions be such that f(x) = x2 + 2


and g(x) = 2x. Define fog and gof. 2

3. (a) Reduce the following Boolean Expression to


simpler form : 4
E(X1, X2, X3) = (X1  X2  X3)  (X1  X2) 
(X2  X3)

(b) Show that ~(p  q)  p is a tautology. 2

(c) Prove that 2 is irrational. 4

MCS-013 2
4. (a) What is Relation ? How is relation different
from function ? Explain any two properties
of relations with an example. 5

(b) A company has the following professionals :


Project Leaders – 5, Team Leaders – 6,
System Architects – 3.

Find how many different committees can be


formed of 10 professionals, each containing
at least 2 Project Leaders, at least 3 Team
Leaders and at least 1 System Architect. 3

(c) Find the dual of A  B  C. 2

5. (a) Explain the Identity Laws of Boolean


Algebra. 2

(b) State and prove the Addition Theorem of


Probability. 4

(c) Verify that p  q  ~ p is a contradiction. 2

(d) What is Exclusive Disjunction ? Write truth


table for p  q. 2

MCS-013 3 P.T.O.
[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.
No. of Printed Pages : 3 MCS-013

MCA (Revised) / BCA (Revised)


Term-End Examination
June, 2022

MCS-013 : DISCRETE MATHEMATICS

Time : 2 hours Maximum Marks : 50

Note : Question no. 1 is compulsory. Attempt any


three questions from the rest.

1. (a) Use pigeonhole principle to find the


minimum number of cars that will have
same colour; if 20 cars are painted using
6 colours. 2

(b) Show that 3 is irrational. 4

(c) Draw the logic circuit for the following


Boolean expression : 4
(X1  X2  X3)  (X1  X2  X3)

(d) Write the set expression (shaded part) for


the following Venn diagrams : 3

MCS-013 1 P.T.O.
(e) Write suitable mathematical statement that
can be represented by ( x) ( y) ( z)P. 2
(f) Disprove that
( a  R) ( b  R) [(a2 = b2)  (a = b)],
using a counter-example. 2
(g) There are 5 women and 6 men. A
committee has to be formed of 3 people. In
how many ways can this be done if at least
one woman should be there in the
committee ? 3

2. (a) Prove using mathematical induction that

(1 + x)n > 1 + nx for all x > 0 and n > 1. 5

(b) What is proper subset ? Explain with the


help of an example. 2
(c) Show p  (p  q)  p is a tautology. 3

3. (a) Every function is a relation. Is every


relation a function ? Why ? 3
(b) Explain circular permutation with the help
of an example. 3
(c) Find the Boolean expression of Q in the
logic circuit given below : 4

MCS-013 2
4. (a) If A and B are two mutually exclusive
events such that P(A) = 0·4 and P(B) = 0·2,
what is the probability that either A or B
does not occur ? 2

(b) Give the geometric representation of


{3}  R. 2

(c) Present a direct proof of the statement


‘‘Square of an odd integer is odd.’’ 3

(d) Find the inverse of the function


x4
f(x) = . 3
x3

5. (a) Show that


C(n, m) C(m, k) = C(n, k) C(n – k, m – k)
for 1  k  m  n. 3

(b) How many 3-letter words can be formed


from the letters of the word ‘‘HAPPY’’ ? 2

(c) What is contradiction ? Show whether


p  q   p is a contradiction or not. 3

(d) Draw the Venn diagram for the expression


A  B  C. 2

MCS-013 3 P.T.O.
No. of Printed Pages : 4 MCS-013
M. C. A. (REVISED)/B. C. A. (REVISED)
(MCA/BCA)
Term-End Examination
December, 2022
MCS-013 : DISCRETE MATHEMATICS

Time : 2 Hours Maximum Marks : 50

Note : Question No. 1 is compulsory. Attempt any

three questions from the rest.

1. (a) Write De Morgan’s laws for predicate logic


and propositional logic. 4

(b) Show that [( p → q ) ∧ ~ q ] → ~ p is a

tautology, without using truth table. 4

(c) Show that 2n > n3 for n ≥ 10. 4

(d) Construct the logic circuit represented by


the Boolean expression (X1′ ∧ X2 ) ∨

(X1 ∨ X3 ), where X1 , X2 , X3 are assumed

inputs to the circuit. 4

P. T. O.
[2] MCS-013

(e) What is the difference between

permutation and combination ? If n couples

are at a dance party, in how many ways

can the men and women be pained for a

single dance ? 4

2. (a) If m and n are positive integers, show

that : 3

(m + n)! ≥ m! + n!

(b) Find inverse of the function f (x), where

) x 3 − 3.
f ( x= 3

(c) Show whether 15 is a rational or

irrational. 4

3. (a) Find the Boolean expression corresponding

to the following circuit. Also obtain the

CNF of the expression : 4


[3] MCS-013

(b) What is Cartesian product ? Give the

geometric representation of the Cartesian

product of A and B, where A = {2, 3, 4} and

B = {1, 4}. 4

(c) Let A = {a, b, c, d} and B = {1, 2, 3} and

R = {(a, 2), (b, 1), (c, 2), (d, 1)}. Is R a

function ? Why ? 2

4. (a) What is Piegonhole principle ? Explain

with a suitable example. 3

(b) Determine all the integer solution to

9, where xi ≥ 1, i = 1,
x1 + x2 + x3 + x4 =

2, 3, 4. 3

(c) Prove by induction that n3 − n is divisible

by 3 for all positive integers. 4


[4] MCS-013

5. (a) If there are 5 men and 4 women, how many

circular arrangements are possible in

which women don’t sit adjacent to each

other ? 4

(b) Write the principle of duality. Find the


dual of : 6

(i) ~ (X ∧ Y) ∨ Z

(ii) (X ∨ Y) ∧ (X ∧ Z)

MCS–013

You might also like