USN MA322TIC

Third Semester B.E. Degree Examination, Apr/May 2024

COMPUTATIOANAL DISCRETE MATHEMATICS
(MODEL QUESTION PAPER)
Time: 3 hrs. Max. Marks: 100

Note: Answer any FIVE full questions, choosing ONE full question from each module.

Q. No. Questions Marks BL/CO

MODULE -1
1 Show that, for any propositions p, q, r the compound propositions,
a. 6 CL 2/CO1
[(𝑝 ∨ 𝑞) ∧ (𝑝 → 𝑟) ∧ (𝑞 → 𝑟)] → 𝑟 is a tautology or not.
Test the validity of the following argument:
I will get grade A in this course or I will not graduate.
b. If I do not graduate, I will join army. 7 CL 3/CO1
I got grade A
∴ I will not join the army.
Utilize the laws of inferences/laws of logic to verify if the following
argument is valid:
c. ∀𝑥, [𝑝(𝑥) → (𝑞(𝑥) ∧ 𝑟(𝑥))] 7 CL 3/CO1

∀𝑥, [𝑝(𝑥) ∧ 𝑠(𝑥)]

∴ ∀𝑥, [𝑟(𝑥) ∧ 𝑠(𝑥)]
OR
2. a. Define logical equivalence of two propositions. Show that the following
logical equivalences without using the truth tables: 6 CL 2/CO1
(𝑝 → 𝑞) ∧ (¬𝑞 ∧ (𝑟 ∨ ¬𝑞)) ⟺ ¬[𝑞 ∨ 𝑝].
b. Write the following in symbolic form and utilize the laws of
inferences/laws of logic to test if the argument is valid:
If you do not send me an e-mail message, then I will finish writing the
program. 7 CL 3/CO1
If you send me an e-mail message, then I will wake up feeling refreshed.
∴ If I do not finish writing the program, then I will wake up feeling
refreshed.
 c. Apply the proof by contradiction for the following statement: “If n is an
7 CL 3/CO1
odd integer, then n+9 is an even integer”.
MODULE -II
3 a. Applying Mathematical Induction, prove that, for any positive integer n,
6 CL 2/CO2
6𝑛+2 + 72𝑛+1 is divisible by 43.
b.
A bit is either 0 or 1. A byte is a sequence of 8 bits. Solve i) the
number of bytes ii) the number of bytes that begin with 11 and end
with 11 iii) the number of bytes that begin with 11 and do not end 7 CL 3/CO2
with 11
iv) the number of bytes that begin with 11 or end with 11.

c. Compute the coefficient of 𝑥11𝑦4𝑧 2 in the expansion of

7 CL 3/CO2
(2𝑥3 − 3𝑥𝑦2 + 𝑧2)6

OR
4 a. Applying Mathematical Induction, prove that, for any positive integer n,
𝑛(𝑛+1)(2𝑛+7) 6 CL 3/CO2
1.3 + 2.4 + 3.5 + ⋯ + 𝑛. (𝑛 + 2) = .
6
b. A message is made up of 12 different symbols and is to be transmitted
through a communication channel. In addition to those 12 symbols the
transmitter will also send a total of 45 blank spaces between the symbols 7 CL 3/CO2
with at least 3 spaces between each pair of consecutive symbols. In how
many ways can the transmitter send such a message?
c. A woman has 11 close relatives and she wishes to invite five of them to
dinner. In how many ways she can invite them in the following situations.
i) There is no restriction on the choice. ii) two particular persons will not 7 CL 3/CO2
attend separately. iii) Two particular persons will not attend together.
MODULE – III
5 a. Let f, g : Z+ → Z+, where ∀𝑥 ∈ Z+, f(x) = x + 1 and 𝑔(𝑥) = max(1, 𝑥 −
i)What is range of f? ii) Is f onto function? iii) Is f one to one function? 6 CL 3/CO3
iv) What is range of g? v) Is g onto function? vi) Is g one to one function?

b. (i)Let 𝑓and 𝑔 be functions from R to R defined by 𝑓(𝑥) = 𝑥 2 and 𝑔(𝑥) =

𝑥 + 5. Prove that 𝑔𝜊𝑓 ≠ 𝑓 𝜊𝑔.
7 CL 3/CO3
(ii)State Pigeon hole principle. Prove that in any set of 29 persons; at
least 5 persons have been born on the same day of the week.
c. Let A = {1, 2, 3, 6, 9, 12, 18}. On A, define the relation R by aRb iff a
divides b. Prove that R is a partial order on A. Draw the Hasse diagram for 7 CL 3/CO3
this relation.
 OR
6 a. Let A= {1, 2, 3, 4}, and let R be the relation defined by 𝑅 = {(𝑥, 𝑦)|𝑥, 𝑦 ∈
𝐴, 𝑥 ≤ 𝑦}. Determine whether R is reflexive, symmetric, antisymmetric or 6 CL 3/CO3
transitive.
b. Let A = {1, 2, 3, 4, 6} and R be a relation on A defined by aRb if and only
if a is a multiple of b. i) Write R as a set of ordered pairs ii) Represent R as
7 CL 3/CO3
a matrix iii) Draw the digraph of R. iv) Determine the in-degrees and out-
degrees of the vertices in the digraph
c. Draw the digraph and Hasse diagram representing the positive divisors of
7 CL 3/CO3
72.
MODULE – IV
7 a. In how many ways one can arrange the letters of the word
CORRESPONDENTS so that there are exactly 2 pairs of consecutive
6 CL 3/CO4
identical letters? ii) at least 3 pairs of consecutive identical letters? iii) no
pair of consecutive identical letters?
b. The number of viruses affected files in system is 1000 (to start with) and
this increases 250% every two hours. Use a recurrence relation to 7 CL 3/CO4
determine the number of viruses affected files in the system after one day.
c. Five teachers 𝑇1, 𝑇2, 𝑇3, 𝑇4, 𝑇5 are to be made class teachers for five classes
𝐶1, 𝐶2, 𝐶3, 𝐶4, 𝐶5 one teacher for each class. 𝑇1 𝑎𝑛𝑑 𝑇2 do not wish to
7 CL 3/CO4
become class teachers for 𝐶1 𝑜𝑟 𝐶2. 𝑇3 𝑎𝑛𝑑 𝑇4 for 𝐶4 𝑜𝑟 𝐶5 and 𝑇5 for 𝐶3
𝑜𝑟 𝐶4 𝑜𝑟 𝐶5. In how many ways can the teachers be assigned to work?
OR
8 a. Define Derangement. In how many ways can each of 10 people select a
left glove and a right glove out of a total of 10 pairs of gloves so that no 6 CL 2/CO4
person selects a matching pair of gloves?
b. In how many ways the 26 letters of English alphabet are permuted so that
7 CL 3/CO4
none of the pattern’s CAR, DOG, PUN or BYTE occurs?
c. Solve the recurrence relation: 𝑎𝑛 + 𝑎𝑛−1 − 6𝑎𝑛−2 = 0, 𝑛 ≥ 2, 𝑎0 = −1,
7 CL 3/CO4
𝑎1 = 8.
MODULE – V
9 a. Define: i) Euler trail and circuit ii) Regular graph
6 CL 2/CO5
iii) Complement of a graph. Give one example for each.
b. Define Isomorphism. Verify that the 2 graphs shown below are
7 CL 3/CO5
isomorphic.
 c. Obtain the prefix code for the message FALL OF THE WALL. Indicate
the code. 7 CL 3/CO5

OR
10 a. Define and give an example for each: (i) Rooted tree (ii) complete binary
6 CL 2/CO5
tree and (iii) Balanced tree.
b. Define a tree. Prove that the tree with 𝑛 vertices has 𝑛 – 1 edge. 7 CL 3/CO5
c. Construct an optimal prefix code for the symbols a, o, q, u, y, z that occur
7 CL 3/CO5
with frequencies 20, 28, 4, 17, 12, 7 respectively.

Cognitive Levels of Bloom’s Taxonomy

No. CL1 CL2 CL3 CL4 CL5 CL6

Level Remember Understand Apply Analyze Evaluate Create

Course Outcomes

CO1 Apply Logic principles and Quantifiers to solve complex problems in computer science. CL3
Demonstrate proficiency in combinatorial analysis to apply counting techniques in
CO2 CL3
computer science engineering application.
Develop understanding of relations and functions to apply on data Modelling and
CO3 CL3
optimization of algorithms.
Apply fundamental counting principles to solve diverse combinatorial problems,
CO4 CL3
demonstrating advanced analytical and problem-solving skills
CO5 Interpret fundamental graph theory and Trees. CL3