RAJSHREE INSTITUTE OF MANAGEMENT AND TECHNOLOGY, BAREILLY

UNIT-TEST-1
B.TECH CS/IT Third SEM. (2023-24)
Discrete Structures and Theory of Logic

TIME: 1:30 hours MM: 20 MARKS

SECTION A
1. Attempt allquestions in brief. 1x6=6
a) Discuss the ways of set representation. (CO1)
b) Explain an equivalent relation. (CO1)
c) Explain maxtermsin K-map. (CO2)
d) What is a bijective function? (CO2)
e) What are SOP and POS forms? (CO2)
f) What is a POSET?(CO1)

SECTION B

2. Attempt any three questions. 3*3=9

a) If A={1,2,3,6} where a is related to b by divisibility. Check whether the relation is partial

order or not. Construct a hasse diagram and determine maximal and minimal elements.
(CO1)
b) Explain lattice and its properties pictorially. (CO1)
c) Define Boolean algebra. Show that a’.[(b’+c)’+ b.c] + [(a+b’)’.c] = a’.b using rules of
Boolean Algebra. Where a’ is the complement of an element a. (CO2)
d) Simplify using K-map: F(A,B,C,D) = ∑( m0, m1, m2, m4, m5, m6, m8, m9, m12, m13,
m14 ). (CO2)

SECTION C
3. Attempt any one question. 1*5=5
a)Define Modular Lattice. Justify that if ‘a’ and ‘b’ are the elements in abounded
distributive lattice and if ‘a’ has complement a′. Then, (CO1)
I) a ˅ (a′˄ b)=a˅ b II ) a˄ (a′˅ b)=a˄ b
b) Simplify the following Boolean expressions using Boolean algebra (CO2)
i. xy + x ́z +yz
ii. C(B + C)(A + B + C)
iii. A + B(A + B) + A(A ́ + B)
iv. XY + (XZ) ́ + XY ́Z(XY + Z)