Roll No……..…...…………… Roll No……..…...

……………
Total No. of question: 08 Total No. of printed pages: 02 Total No. of question: 08 Total No. of printed pages: 02
M - 724 M - 724
B.Tech. III Semester/ATKT Examination Dec. 2020 B.Tech. III Semester/ATKT Examination Dec. 2020
Computer Science Engineering Computer Science Engineering
Discrete Structure Discrete Structure
Time: 03 Hours Maximum Marks: 70 Time: 03 Hours Maximum Marks: 70
Note: Attempt any five questions. Each question carries 14 marks. 5×14=70 Note: Attempt any five questions. Each question carries 14 marks. 5×14=70

Q. 1 (a) If A, B and C are any three sets, prove that- Q. 1 (a) If A, B and C are any three sets, prove that-
(i) −( ∩ ) =( − )∪( − ) (i) −( ∩ ) = ( − )∪( − )
(ii) −( ∪ ) =( − )∩( − ) (ii) −( ∪ ) = ( − )∩( − )
(b) Show that the maximum number of edges in simple graph with (b) Show that the maximum number of edges in simple graph with
( ) ( )
Vertices is . Vertices is .

Q. 2 (a) Which of the following formulas are tautologies? Explain what is Q. 2 (a) Which of the following formulas are tautologies? Explain what is
meant by "tautology" and write down truth tables to justify your meant by "tautology" and write down truth tables to justify your
answer. answer.
(i) p⇒q (i) p⇒q
(ii) (p ⇒ q) p (ii) (p ⇒ q) p
(ii) ((p ⇒ q) ⇒ p) ⇒ p (ii) ((p ⇒ q) ⇒ p) ⇒ p
(b) Write the short notes. (any two) (b) Write the short notes. (any two)
(a) Graph Coloring (b) Types of functions (a) Graph Coloring (b) Types of functions
(c) Recurrence relation (c) Recurrence relation
(d) Conjunctive and Disjunctive Normal Form (d) Conjunctive and Disjunctive Normal Form
(e) Lattice (e) Lattice

Q. 3 (a) Show that the rule of hypothetical syllogism is valid. Q. 3 (a) Show that the rule of hypothetical syllogism is valid.
p→q p→q
p→r p→r
p→r p→r
(b) Prove that the proposition is a tautology. (b) Prove that the proposition is a tautology.
( ∨∽ ) ∧ ( ∨∽ ) ∨ ( ∨∽ ) ∧ ( ∨∽ ) ∨

Q. 4 (a) Define the followings with examples. Q. 4 (a) Define the followings with examples.

P.T.O. P.T.O.
 (2) (2)

(i) Multi graph (ii) Isomorphic graph (i) Multi graph (ii) Isomorphic graph
(iii) Eulerian graph (iii) Eulerian graph
(b) What is Graph coloring? Define chromatic number give any one (b) What is Graph coloring? Define chromatic number give any one
example to explain your answer. example to explain your answer.

Q. 5 (a) Find the shortest path between a and z in the graph shown below. Q. 5 (a) Find the shortest path between a and z in the graph shown below.

b 4
 e b

4
e
3 3 4 2 3 3 4 2
a 2 c z a 2 c z
   
2 2 6 3 2 2 6 3


d 4
f 
d 4
f
(b) Write short notes. (b) Write short notes.
(i) Posets (ii) Lattices (i) Posets (ii) Lattices
(iii) Permutation and combination (iii) Permutation and combination

Q. 6 (a) Obtain disjunctive normal form of- Q. 6 (a) Obtain disjunctive normal form of-
∨ (∼ → ∨ ( →∽ ) ∨ (∼ → ∨ ( →∽ )
(b) Show that (b) Show that
(( ∨ ) ∧∽ (∼ ∧ ( ∨∽ ))) ∨ (∽ ∧ ) ∨ (∽ ∧∽ ) (( ∨ ) ∧∽ (∼ ∧ ( ∨∽ ))) ∨ (∽ ∧ ) ∨ (∽ ∧∽ )

Q. 7 (a) Write a short note on- Q. 7 (a) Write a short note on-
(i) Isomorphism of groups (i) Isomorphism of groups
(ii) Universal and existential quantifiers (ii) Universal and existential quantifiers
(b) If U is a universal set and its two subsets A and B, then (b) If U is a universal set and its two subsets A and B, then
prove that ( ∩ )′ = ′ ∪ ′ prove that ( ∩ )′ = ′ ∪ ′

Q. 8 (a) Show that. Q. 8 (a) Show that.

[( ∧ ) ⇒ ] ⇒ ( → ( ∧∽ ) is a contradiction. [( ∧ ) ⇒ ] ⇒ ( → ( ∧∽ ) is a contradiction.
(b) Write short notes on- (b) Write short notes on-
(i) Hasse diagram (ii) Lattices (i) Hasse diagram (ii) Lattices
(iii) Bpinomial theorem (iv) Permutations (iii) Bpinomial theorem (iv) Permutations

------*------*------ ------*------*------

M-724 M-724