Name of the Candidate: Reg. No.

:
21IT310
B.TECH. DEGREE– NOVEMBER 2022 –EXAMINATIONS
BRANCH: INFORMATION TECHNOLOGY
DISCRETE MATHEMATICS
Duration : 3Hours Maximum: 100 Marks
Answer All Questions
PART – A (10 x 3 = 30) CO Marks
0 1 1
A1. Let R be the relation represented by the matrix �� = 1 1 0 . Identify the matrix CO1 (3)
1 0 1
representing �−1 ��� �
A2. Let f : Z → Z be such that f (x) = x + 1. Is f a bijection? Is f invertible, and if it is, what is its CO1 (3)
inverse?
A3. What is the solution of the recurrence relation an = an−1 + 2an−2 with a0 = 2 and a1 = 7? CO2 (3)
A4. Let p, q, and r be the propositions CO5 (3)
p: You have the flu.
q: You miss the final examination.
r: You pass the course.
Express each of these propositions as an English sentence.
a) p → q b) ￢q ↔ r
A5. Identify the truth value of the formula (p ∧ q) → (p ∨ q) without using truth table. CO5 (3)
A6. Check if NAND operator is associative or not without using truth table. CO5 (3)
A7. a. Let P(x) be the statement “x + 1 > x.” What is the truth value of the quantification ∀xP(x), CO7 (3)
where the domain consists of all real numbers?
b. What is the truth value of ∃xP(x), where P(x) is the statement “x2 > 10” and the universe of
discourse consists of the positive integers not exceeding 4?
A8. For each of these statements find a domain for which the statement is true and a domain for CO7 (3)
which the statement is false.
a) Everyone is studying discrete mathematics.
b) Everyone is older than 21 years.
c) Every two people have the same mother.
A9. Identify the variables that are bound and free. Also identify the scope of the quantifiers from CO8 (3)
the statements listed below
(i) (x)(P(x) ∧R(x))→(x)P(X) ∧Q(x)
(ii) (x)(P(x)→Q(x) ∧(x)R(x)) ∧S(x)
A10. Recall rules of generalization and rules of specification with an example. CO8 (3)
PART – B (70 Marks) CO Marks
B1. a. Show that the relation R consisting of all pairs (x, y) such that x and y are bit strings of CO1 (10)
length three or more that agree in their first three bits is an equivalence relation on the set
of all bit strings of length three or more.
b. Let A be the set of students at your school and B the set of books in the school library. CO1 (7)
Let R and S be the relations consisting of all ordered pairs (a, b), where student a is
required to read book b in a course, and where student a has read book b, respectively.
Describe the ordered pairs in each of these relations.
a) R ∪ S b) R ∩ S c) R −S d) S - R
[OR]
B2. a. Let R be the relation consisting of all pairs (x, y) such that x and y are strings of CO1 (10)
uppercase and lowercase English letters with the property that for every positive integer
n, the nth characters in x and y are the same letter, either uppercase or lowercase. Show
that R is an equivalence relation.
b. Determine whether the relation R on the set of all real numbers is reflexive, symmetric, CO1 (7)
antisymmetric, and/or transitive, where (x, y) ∈ R if and only if
Contd……………
 a) x + y = 0. b) x = 2y.

B3. a. Show that a graph G with p points and ≥ (p-1)/2 is connected. CO3 (6)
b. Interpret that a graph G is connected iff for any partition of the vertex set V of G into CO3 (6)
subsets V1 and V2, there is a line joining a point of V1 to V2
[OR]
B4. a. Compute the incidence matrix and chromatic number for the graph CO3 (6)

b. (i) Show that a graph has an even number of vertices of odd degree. (3 marks) CO3 (6)
(ii) Draw all subgraphs of the graph. (3 marks)

B5. a. Check if the lattice D(18) is not a Boolean algebra. CO4 (7)
b. In a distributive lattice, prove that the following are equivalent CO4 (7)
(i) � ∧ �) ≤ � ≤ (� ∨ �) �� � = � ∧ � ∨ � ∧ � ∨ (� ∧ �)

[OR]
B6. a. Let L be a complemented distributive lattie. For a, b ��, show that the following are CO4 (7)
equivalent (i) a≤ b (ii) � ∧ �' = 0 (iii) �' ∨ � = 1 (iv) �' ≤ �'
b. For the poset ({3, 5, 9, 15, 24, 45}, |) CO4 (7)
a) Find all upper bounds of {3, 5}.
b) Find the least upper bound of {3, 5}, if it exists.
c) Find all lower bounds of {15, 45}.
d) Find the greatest lower bound of {15, 45}, if it exists.

B7. a. Compute the truth value of the formula 7 � ∧ � ∨ 7� ∨ (((7� ∧ �) ∨ 7�) ∧ �) CO5 (6)
b. Compute the truth value of � ∨ � → � ∧ 7� ↔ (� ∨ 7�) CO5 (6)

[OR]
B8. a. Show the implication (P→ (� → �)) ⇒ (� → �) → (� → �) CO5 (6)
b. Show the equivalence without using truth table 7(P↔Q) ⇔ (� ∨ �) ∧ 7(� ∧ �) CO5 (6)

B9. a. Derive �, � ⟶ (� ⟶ �⋀� ) ⇒ � ⟶ � using CP rule CO6 (6)

b. Obtain the PDNF and PCNF of �⋁(7� ⟶ �⋁ 7� ⟶ � ) CO6 (9)
[OR]
B10. a. Show that the set of premises � ⟶ �, � ⟶ � , � ⟶ 7� ��� �⋀� are inconsistent. CO6 (6)
b. Obtain the PCNF and PDNF of (7� ⟶ �)⋀(� ⟷ �) CO6 (9)
***************