CENTURION UNIVERSITY OF TECHNOLOGY AND MANAGEMENT

ANDHRA PRADESH

END SEMESTER – 2023

SUBJECT CODE: Discrete Mathematics

SUBJECT NAME: CUTM1004

SEMESTER: I

Question WRT Part-A: Answer All Questions:(10*2=20) 10 10

No
1 Define Connective negation and explain with Truth table and an 2
example.

2 Write the following statements in symbolic form 2

a. If the sun is shining today, then 2+3>4
b. The crop will be destroyed if there is a flood.

3 Express the statements “Some student in the class study 2

computers” and “Every student in the class study either
Mathematics or computers” using quantifiers.

4 Give one example of a relation which is transitive but neither 2

reflexive nor symmetric nor anti symmetric.

5 Define Lattice and write the properties of Lattice. 2

6 If R1 = {(1, 1), (1, 2), (2, 1), (2,2), (3, 3)}and R 2 = {(1, 2), (2,1), (2,3), (3,2),(3, 2
3)}.Then R1ՈR2, R1-R2.

7 State and prove hand shaking theorem. 2

8 Define Cut vertex and cut edge of a graph. Give an example. 2

9 Define Hamilton graph and explain with examples. 2

10 Find the maximum possible height of a binary with 15 vertices 2

and draw graph of the tree.

Questio WR Part-B: Answer Any FIVE Questions: 8 5

1
n T (05*12=60)
No
1 a. Define conditional, bi 12
conditional and exclusive or write
the truth tables with examples.
(6 marks)

b. Prove that
(P → Q) ∧ (R → Q) ⇔ (P ∨ R) →
Q.
(6 marks)

2 12
a. Demonstrate that R is a valid
inference from the premises P →
Q, Q → R, and P .
(6 marks)
b. Establish the validity of the
following argument:”All integers
are rational numbers. Some
integers are powers of 2.
Therefore, some rational numbers
are powers of 2”.
(6 marks)

3 a. Write the matrix representation 12

and directed graph of the relation
on the set
A= {1,2,3,4} where R= { (1,1),
(2,2), (3,3), (4,4), (1,2), (2,1),
(1,3), (2,3), (2,4), (3,2), (4,3)}.
(6 marks)

b. Let the set A be {1,2,3,4} and

the relation R= { (1,1), (2,1),
(3,2) (4,3)} , find the composite
relation n for n= 2,3,4 and show
that R3=R 4.
(6 marks)

2
4 a. Show that congruence modulo m 12
is an equivalence relation.
(6 marks)

b. In the poset P shown in the side

figure , find upper bound and least
upper bound for the sets A= {2,3}
and B= {4,6}
(6 marks)

5 a. Explain about Bipartite graph , 12

complete Bipartite graph, How
many vertices and how many
edges are there in complete
bipartite graph K4,7 and K7,11 ?
(6 marks)

b. Define and discuss about sub

graphs, union and intersection of
graphs with suitable examples.
(6 marks)

6 Verify the following graphs are 12

isomorphic or not, explain with all
details, with adjency matrix.

7 a. Show that the complete graph 12

Kn has a Hamilton cycle.
(6 marks)

b. Prove that a connected graph G

with n vertices is a tree if and
only if it has (n − 1) edges
(6 marks)

3
8 Use Kruskal’s algorithm to find 12
MST for the following graph

Question WRT Part-C: Answer Any FOUR Questions: 5 4

(04*05=20)
No
1 5
Write the truth table for compound
proposition (p → q) → r

2 Verify the relation R ={ (1,1),(2,2), 5

(3,3),(1,2), (2,3),(1,3)} partially
ordered relation is defined on the set
A, where A={1,2,3}.

3 5
Construct the Hasse diagram of
Divisors of 36 ((D, 36), /)

4 Show that Every planar graph is 5

5-colourable.

5 Define a spanning tree. Find all 5

spanning trees of the
following graph

4
5