June-2021
B.A/B. Sc. (VI Semester) Examination
MATHEMATICS
Paper: MATH-363 (N/C)
(Discrete Mathematics)
Full Marks : 80
Pass Marks : 35%
Time : Three Hours
Notes: (i) Answer all questions.
(ii) The figures in the margin indicate full marks for the questions.
I. Answer any five parts: 2x5=10
(a) Let and be the it’s power set. Let be the inclusion relation on . Draw the Hasse diagram of the partial ordered set ( .
(b) Let B be a Boolean algebra and 𝑎 be any element in B. Prove that 𝑥=a if 𝑎 +x= 1 and 𝑎 ∗ 𝑥 = 0.
(c)Express the Boolean expression in the disjunctive normal form.
(d) Construct the truth table of the proposition .
(e)What is the probability of getting a number greater than 2 or an even number in a single through of a fair dice?
(f) Define complete graph and connected graph.
(g) Distinguish between permutation and combination.
II. Answer any four parts: 5x4=20
(a) Define a bounded lattice. Prove that for a bounded distributive lattice, the complements are unique.
(b) What do you mean by logically equivalent statements? Check whether the propositions and are equivalent or not.
(c) Draw the logic circuit corresponding to the Boolean expression .
(d) Define degree of a vertex in a graph. Show that number of odd degree vertices in a graph is always even.
(e)Define mutually exclusive and independent events. Let 𝐴 and 𝐵 be two events such that 𝑃(𝐴) = 0.42, 𝑃(𝐵) = 0.48 and 𝑃(𝐴 𝑎𝑛𝑑 𝐵) = 0.16. Determine 𝑃(A or B) and P(neither A nor B).
(f)How many permutations can be made out of letter in the word COMPUTER ? How many of these (i) begin with letter C, (ii) begin with C and ends with R, and (iii) C and R occupy last two end places?
(g) Let ( be a lattice. Prove that
III. Answer any five parts: 10x5=50
(a) (i) Distinguish between tautology and contradiction statements. Check whether the statement is a tautology or a contradiction.
(ii) Show that by induction. (5+5)
(b) Let be the set of all divisors of 70. If ( be a Boolean algebra, where , and . Find the value of the expressions
(i) and .
(ii)Determine whether the is a Boolean subalgebra of . Justify. (6+4)
(c) (i) If 𝐴 and 𝐵 are any two events, the prove that
.
(ii) If , find . (5+5)
(d)(i) Define order and size of a graph. What is the size of a 𝑟-regular graph of order 𝑝?
(ii) Define walk, path and circuit. Show that a tree cannot have a circuit.
(iii) Define a spanning tree and its branch and chords. Find the number of chords of with respect to a spanning tree in a graph of order 𝑛. (2+4+3)
(e) (i) What do you mean by logic gates. ? Describe the operations of OR and NOT gates with two input devices. Give their equivalent electrical circuits.
(ii) Let be a Boolean expression. Show that and .
(f)(i)Define a well-ordered set. Give an example.
(ii) Define dual of a statement in a lattice 𝐿. Write the dual of the statement .
(iii) Let 𝐿 be a lattice. Show that if and only if . (2+3+5)
(g) Define a tree. Show that a tree with 𝑛 vertices has n-1 edges.