UNIT-IV

Question Paper Code : 3365

8.
Show that[(pv qg)a-(-pa(-qv-r)] [10] BCA (Semester-IV) Examination, 2021-22
DISCRETE MATHEMATICS
v(- pa ~g) v(-pa~r) is Tautology by using laws of
logic. [Paper: BCA-401 |
Time: Three Hours] [Maximum Marks: 70
9. Prove that validity of the following argument "IfI get the job
and work hard, then I will get promoted. IfI get promoted,
Note: Answer five questions in all. Question No. 1is
then I will be happy. I will not be happy. Therefore, either I
compulsory. Besides this attempt one question from
willnot get thejob or Iwill not work hard". [10] each unit.

----- X -----
1. Answer allquestions in brief: [3x10=30]

(a Define Multiset with two examples.

, (b If Rbe arelation in the set of integers z defined by

R={(y):xez,ye z(x-)is divisible by 6,.
Then prove that is an equivalence relation.

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

f={(.a).(2.a),(3,d), (4.e)). Show that f isa
function but f is not afunction.

Define Semi group and Monoid.

3365/600 (4 ) 3365/600 (1) [P.TO.]

 Show that the binary operation * defined on (R,*)
where *y=r isnot associative.
,2,3"Mrs13)
3. Let A= B=C= R.Consider the function f:A> Band

g:B’C defined by f(a)= 2a +1, g(b)=;.

3 verify
(t) Find the product of twO permutations and show that
(sof)' =f'og'.
) it is not commutative.
UNIT-II
[10]

Define OR, AND and NOT gate.

4. Prove that the fourth root of unity 1, -1,i,-i forman Abelian
lt Define Modular and complete Lattice with examples. multiplicative group. [10]
Construct truth table for 5. IfR be the group ofreal numbers under addition and let p
be the groupofpositive real numbers under multiplication.
(1)
Let f:R-’R* be defined by f(x)=e then showthat
(2) f is an isomorphisn. [10]
UNIT-III
Verify that the proposition pa(gA~p) is a
6. Define Hasse diagram. Draw a Hasse diagram from the
contradiction.
directed graph G for a partial order relation on a set
UNIT-I
A={1,23,4). [10]
2. Let R ands be relation from to B,showthat: [10] 7. Use Kamaugh map to simplify thefollowing: [10]
If RgS,then Rc S (a) X= ABC+ ABC

(1 (Rns)" = R*'os (b) X= ABC'+ABC'+ ABC'+ ABC

(c) X= AB'C'+A'BC+ ABC +ABC' +AB'C +ABC

(m) (RUS'=Rus
3365/600 (2) 3365/600 (3) [P.T.O.]
 Over MK-640
Turn (1) 3365
4/ MK-640 (4) 3365
4/

7,7 MRns (iv) MRuS (i )

MR-1 (ü) MR' )
Find:
1 0|0 0| 0 |0
10 1 =Mg
and 0 1=0 MR ABC'+ A'B+
C' ABC'+ X= (ii)
7,7 AB'C
1| 1 0 10
1 AB'C' A'B+
C' X= (i)
that: such relations
Aon following : simplify
the to
Karnaugh
map Use (b)
the be andS Rlet and 3}2,{1, = A Let (b) B)+(A
AB'C) ABC+ ABC + (AB'+C
set. DeMorgan'
onlaw s prove and State (a) 1. expression:
marks. simplify algebra Boolean Using (a) 10.
the
equal carryquestions questions.
All five anyAnswer i-Note 7,7 -)r (pA (iv)
70 MM.: [ Hours 3Tim:e q p (111)
(pA)’r (i )
BCA-401 Paper:
MATHEMATICS DISCRETE following:
Examination,
2023 Semester IVth B.C.A, the meaning
of sentences
the simple the write
exam final the on Aon get You r:
logic
understand You q:
3365 mathematics discrete course
in taake You p:
following: Consider
the (6)
 Over Turn
MK-640 )(3 43365/ MK-64Q ) 2( 3365
4/
tautology. is 7,7 generators. all its find then yes, Ifnot. or
group cyclic itcheck
is Also group. abelian an
form
X) 6}, 5, 4,3, 2,({1, that Show Group. Define 5.
proposition the that Show (a) 9.
group. cancellation
of
law prove and State (b)
14 disjunction
both. conjunction
and over laws
7,7 gf. fgthat show then
distributive prove and propositions.
State Define 8.
2) 1 3
Da2 element
of
7,7
of
eachcomplement
of the find then n, of
)
4) 3 2 and

1J 4 3
divisors positive all ofset the denote D,Let (b) 4) (123
:group.
permutation
lf Define (a) 4.
=fogl (gofl
14
verify: alsO onto andone-one also gofis that show
functions,
then onto and one-one be C g:B’
representationis
not lattices
or following the Define
and B Afunction.composition
Iff: 3.
thatjustify alslattices
o properties
of the Write (a) 7.
14 S-R-1u
1 S)1= U(R(11i)
14 diagram. Hasse S-1 oR-1 =(Rn S (i)
the Find divides
y'. relation
'x the ordered
by be S-1 c R-! then RES, if ()
24} 18, 12, 8,9, 6,4, 3,2,{1, = A that: show B,to fromA
Let: Set. orderd partial Define relation be andSLetR relation.equivalence Define 2.
6.