Scribd
Upload
93 views2 pages

Year - B.Sc. (IT) - I (C.B.C.S. Pattern) Sem-II Subject - UBITT204-Paper-IV - Discrete Mathematics

This document is a past exam paper for a Discrete Mathematics course. It contains 5 questions covering topics like: 1) Proving identities about sets, functions, and probabilities 2) Explaining concepts like injective/surjective functions, the pigeonhole principle, and recurrence relations 3) Drawing and analyzing graphs and trees 4) Defining terms from algebra like semigroups and monoids 5) Constructing truth tables and defining basic terms from graph theory and abstract algebra.

Uploaded by

Ramnaresh
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
93 views2 pages

Year - B.Sc. (IT) - I (C.B.C.S. Pattern) Sem-II Subject - UBITT204-Paper-IV - Discrete Mathematics

This document is a past exam paper for a Discrete Mathematics course. It contains 5 questions covering topics like: 1) Proving identities about sets, functions, and probabilities 2) Explaining concepts like injective/surjective functions, the pigeonhole principle, and recurrence relations 3) Drawing and analyzing graphs and trees 4) Defining terms from algebra like semigroups and monoids 5) Constructing truth tables and defining basic terms from graph theory and abstract algebra.

Uploaded by

Ramnaresh
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/ 2

B.Sc. (IT) - I (C.B.C.S.

Pattern) Sem-II
UBITT204-Paper-IV : Discrete Mathematics
P. Pages : 2 GUG/W/19/10923
Time : Three Hours *2795* Max. Marks : 80
_____________________________________________________________________
Notes : 1. All questions are compulsory and carry equal marks.
2. Draw neat and labelled diagram and use supporting data wherever necessary.
3. Avoid vogue answer and write specific answer related to question.

1. Either:
a) Prove that. 8
i) (A B)  (C D) = (A  C) (B  D)
ii) (A − B) − C = (A − C) − (B − C)

b) Make a truth table for statement. 8


i) (p  q)  (~ p)
ii) ~ (p  q)  r

OR
c) Define sets and explain different operations on sets with suitable examples. 8

d) Construct the truth table for following. 8


i) (A  B)  C
ii) (A  B)  C

2. Either:
a) To prove 8
i) p (n, n) = 2  p (n, n − 2)
ii) p (n, r) = n.p (n − 1, r − 1)

b) Explain following types of functions. 8


i) Injective (one - to - one) function
ii) Surjective (onto) function.

OR
c) Explain following. 8
i) The pigeonhole principle.
ii) Recurrence Relations.

d) Determine the value of n if. 8


n n +1
i) 4  P3 = P3
n n +1
ii) 6  P3 = 3  P3
3. Either:
a) Explain following. 8
i) Indegree of nodes. ii) Outdegree of nodes.
iii) Total degree of nodes. iv) Complete diagraph.

GUG/W/19/10923 1 P.T.O
b) Construct the tree. 8
i) ((3  (1 − x))  ((4 + (7 − (y+ 2))) 
ii) (7 + (6 − 2)) − (x − (y − 4))
OR
c) Show that following graph are isomorphic. 8
i)
4
ii) u3 u4

3 3

1 u2 u1
d) Find a spanning tree for following graph. 8
b c d
a
e f g
h
i
j k l
4. Either:
a) Let (A, ) be semigroup. Show that for a, b, c in A, if a  b = c  a and c  c = c  b then 8
(a  b)  c = c  (a  b)

b) Explain following properties of Binary operations. 8


i) Closure property ii) Associative property.
iii) Commutative property iv) Identity.
OR
c) What is Monoid? And also solve following consider an algebraic system (N, +), where 8
the set N = {0, 1, 2, 3, ------} the set of natural numbers and + is an addition operation.
Determine whether (N, +) is a monoid.

d) Explain following terms. 8


i) Abelian group. ii) Normal subgroup.

5. Solve all the questions.

a) Construct the truth table for following. 4


(P  ( Q R))  (Q R)  (P R)

b) Determine following. 4
10 50
i) C6 ii) C45

c) Define following terms. 4


i) Graph ii) Diagraph.

d) Explain following. 4
i) Semigroup. ii) Free Semigroup.

**********

GUG/W/19/10923 2

You might also like