(i) E1=xy + xy ' (ii) E2= xy+ x ' y+ x' y ' (iii) E2= xy+ x ' y '
Q-6. (a) (i) Define Eulerian graph and Hamiltonian graph. Give the necessary
and sufficient condition for a graph to be Eulerian.
(ii) Find the generating function of the convolution of the function
r r
a r=3 ,b r=2 for r ≥ 0 , and also write it’s numeric form.
OR B. Sc. (H) – VI Semester
(b) (i) Define Boolean algebra with an example? Prove De-Morgan’s law in Even Semester Examination 2023-24
Boolean algebra. Subject Code: BHM605
Discrete Mathematics
(ii) Prove that in a distributive lattice if an element has a complement then this
complement is unique. [Time: 03:00 Hrs.] [Maximum Marks: 70]
NOTE: Attempt all three sections.
SECTION – ‘A’
NOTE: Attempt the following question. (1x14= 14 Marks)
Q. 1. Answer the following: (1x7= 7 Marks)
(i) State Pigeonhole principle.
(ii) True or false, in a distributive lattice if an element has a complement it
is unique.
(iii) Form the truth table of OR gate.
(iv) What do we understand by subgraph of a graph?
(v) What is contrapositive of a statement?
(vi) What is absorption property of a lattice?
(vii) State principle of duality in a lattice.
Q. 2. Answer the following: (1x7= 7 Marks)
(i) True or false, generating function of convolution of two function is Q-4. (i) (a) Design a three-input AND-OR circuit L with the following truth
equal to the product of their generating function. table T = [A, B, C, D] = [00001111, 00110011, 01010101, 11001101]
(ii) Define trail in a graph. OR
(iii) The number of elements in a Boolean algebra can be (b) When does we say two elements are comparable? Prove that the statement
( i ) 8 , ( ii ) 9 , ( iii ) 10 , ( iv ) 11. P ∨Q is logically equivalent to ((P∧ Q)∨(Pc ∧Q c ))⇒ P . (7 marks)
(iv) State Russell’s paradox.
(v) What is a complete graph?
(ii) (a) Define the following terms. (i) Lattice (ii) Order in a lattice (iii) Dual of
(vi) What is the sum of degrees of vertices in a graph if it has 100 edges?
a statement in lattice also find dual of a ∨ b=1. (iv) Bounded lattice.
(vii) Define tree and forest in a graph.
OR
SECTION - ‘B’
(b) Find the minimum distance between vertex A and C using Dijkstra
Attempt all questions: (7 x 2 × 2 = 28 Marks) Algorithm. 6
B E 9
3
Q. 3. (i) (a) Define partially ordered relation. Show that the relation of set A 5 3 1 C
A
inclusion ‘⊆' is a partial order relation in a collection of sets. (7 marks) 8 F 3
D (7 marks)
2
OR
SECTION – ‘C’
(b) (i) Write Peano’s postulates for positive integers. (4 marks)
NOTE: Attempt any two. (14x2 = 28 Marks)
(ii) What is Konigsberg seven bridge problem and what is its solution.
Q-5. (a) For an n-vertex graph G (with n ≥ 1) the following are equivalent
(3 marks)
(i) G is connected and has no cycles. (ii) G has n−1 edges and no cycles.
(iii) G is connected and has n−1 edges.
(ii) (a) What is principle of mathematical induction. Use mathematical
induction to prove the following inequality 2n <n ! for all positive integers n ≥ OR
4 (7 marks) (b) (i) What are prime implicants and complete sum of products, Find the
prime implicants of boolean expression E=xyz + x' z ' + xy z ' + x ' y' z+ x' y z ' .
OR
(b) Form the adjacency matrix and incident matrix for the following (ii) Find the prime implicant and minimum sum of products form for each of
graph. w b y the following complete sum of product boolean expression using Karnaugh
Ae
a z map
cc A A
d
x
A
