Total No. of Questions: 30 set {1, 2, 3, 4}?
Enrollment No....................................... a) {(0,0), (1,1), (2,2), (2,3)}
Faculty of Engineering b) {(1,1), (1,2), (2,2), (3,3), (4,3), (4,4)}
c) {,(1,1), (1,2), (2,1), (2,3), (3,4)}
Mid Sem Examination Makeup Semester July 2020 d) {(0,1), (1,1), (2,3), (2,2), (3,4), (3,1)
CS3BS03 Discrete Mathematics
Programme: [Link]. Branch/Specialisation: CTIS/DS A Poset in which every pair of elements has both a least upper
bound and a greatest lower bound is termed as _______
Duration: 30 Min. Maximum Marks: 30 a) sublattice
Note: All questions are compulsory. Question may be of Q.5 b) lattice 1 B
1. MCQ type, c) trail
2. One word, fill in the blanks, d) walk
3. Match the column, (If this type will be there then no of question will reduce and marking
scheme will be different) If every two elements of a poset are comparable then the poset is
4. Very short answer type of questions {Maximum 5 Questions (Answer with maximum 20 called ________
Alpha Numeric Words)}. a) sub ordered poset
Q.6 b) totally ordered poset 1 B
Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined c) sub lattice
by S <= R if a divides b. Number of edges in the Hasse diagram d) semigroup
of is ______
Q.1 a) 6 1 B Which of the following is/are the universal logic gates?
b) 5 a) OR and NOR
c) 9 b) AND
d) 4 Q.7 1 C
c) NAND and NOR
The less-than relation, <, on a set of real numbers is ______ d) NOT
a) not a partial ordering because it is not asymmetric and Which of the following is a Simplification law?
irreflexive equals antisymmetric a) M.(~M+N) = M.N
Q.2 b) a partial ordering since it is asymmetric and reflexive 1 A b) M+(N.O) = (M+N)(M+O)
c) a partial ordering since it is antisymmetric and reflexive Q.8 1 A
c) ~(M+N) = ~M.~N
d) not a partial ordering because it is not antisymmetric and d) M.(N.O) = (M.N).O
reflexive
K-map is used for _______
Suppose a relation R = {(3, 3), (5, 5), (5, 3), (5, 5), (6, 6)} on S = a) logic minimization
{3, 5, 6}. Here R is known as _________
b) expression maximization 1 A
a) equivalence relation Q.9
Q.3 1 A c) summing of parity bits
b) reflexive relation
c) symmetric relation d) logic gate creation
d) transitive relation
Q.10 The output of an EX-NOR gate is 1. Which input combination is 1 C
Q.4 Which of the following relations is the reflexive relation over the 1 B
correct?
a) A = 1, B = 0
b) A = 0, B = 1
c) A = 0, B = 0
d) A = 0, B’ = 1
******
