2 0 2 0
BA/BSc (VI Semester) Examination
MATHEMATICS
Paper : MATH–363 (New Course)
( Discrete Mathematics )
Full Marks : 80
Pass Marks : 35%
Time : Three Hours
Note : 1. Answer all questions.
2. The figures in the margin indicate full marks for the questions.
1. Answer the following questions (any five) : 2×5=10
(a) What do you understand by ‘relation’ on sets? Give an example of relation.
(b) Define lattice with an example.
(c) What is modular lattice? Show that every distributive lattice is modular.
(d) Write a short note on distributive lattice.
(e) Briefly describe a logic gate.
(f) Show that , where and are Boolean variables.
(g) How do you distinguish between a propositional logic and a predicate logic?
(h) Define linearly ordered set with an example.
2. Answer the following questions (any four) : 5×4=20
(a) Define poset with an example.
(b) Let L be any lattice. Then show that , for all .
(c) Briefly describe the representation of the graphs of relations. Draw the directed graph that represents the relation
on .
(d) Write a short note on the principles of counting theory with examples.
(e) Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be formed?
(f) Discuss Pigeonhole principle with a suitable example.
(g) Construct truth tables for the following :
(i)
(ii)
(h) Use truth table to show that . What are truth tables?
(i) Define the complemented lattice. Is the complement of any element
unique? Supportive example should be given.
3. Answer the following questions (any five) : 10×5=50
(a) (i) Show that in a lattice L, 4
(ii) In any lattice, show that the statements
and
are equivalent for all . 3+3=6
(b) (i) Show that every chain is distributive lattice. 5
(ii) Prove that pentagonal lattice is not modular. 5
(c) (i) Show that in a distributive lattice (L, £), and imply that . 6
(ii) Write a short note on compound propositions. 4
(d) What is Boolean algebra? Let the operations and in be defined by
.
Show that is a Boolean algebra. 10
(e) Prove that in a Boolean algebra B for all
(i)
(ii)
(iii)
(iv)
(v) 2+2+2+2+2=10
(f) (i) Show that there are minimal Boolean functions in variables. 5
(ii) Express in disjunctive normal form and in conjunctive normal
form. 5
(g) (i) State the principle of mathematical induction. Show that
by mathematical induction. 5
(ii) Simplify the Boolean functions
and
5