CONFIDENTIAL

HERITAGE INSTITUTE OF TECHNOLOGY

B.Tech. 3rd Semester Class Test Examination 2021 Session: 2021-22

Discipline: CSE, IT, CSBS
Paper Name: Discrete Mathematics
Paper Code: CSEN 2102
Time Allotted: 1 hr Full Marks: 30

Figures out of the right margin indicate full marks.

𝐴𝑛𝑠𝑤𝑒𝑟 𝑎𝑙𝑙 𝑡ℎ𝑒 𝑞𝑢𝑒𝑠𝑡𝑖𝑜𝑛𝑠
𝐶𝑎𝑛𝑑𝑖𝑑𝑎𝑡𝑒𝑠 𝑎𝑟𝑒 𝑟𝑒𝑞𝑢𝑖𝑟𝑒𝑑 𝑡𝑜 𝑔𝑖𝑣𝑒 𝑎𝑛𝑠𝑤𝑒𝑟 𝑖𝑛 𝑡ℎ𝑒𝑖𝑟 𝑜𝑤𝑛 𝑤𝑜𝑟𝑑𝑠 𝑎𝑠 𝑓𝑎𝑟 𝑎𝑠 𝑝𝑟𝑎𝑐𝑡𝑖𝑐𝑎𝑏𝑙𝑒.

1(𝑎) (i)Use the Decomposition Theorem to find the chromatic CO1, [Analyse/IOCQ] (4
polynomial of the following graph. Show your calculations in CO2 + 1)
detail. +5
a b = 10
e

c d

(ii) If a tree can be coloured with at most 3 colours in 768

ways, find the number of vertices of the tree. [Apply/IOCQ]

State Fermat’s Little Theorem. Use it to find the remainder in

(𝑏) the division of 3211 + 22309 by 17. Show your calculations in
detail.

2(a) One hundred tickets numbered 1, 2, 3, … , 100 are sold to 100 CO4 [Evaluate/HOCQ] 5+5
people for a drawing. Four different prizes are awarded – a = 10
grand prize, the first, second and third prizes. How many ways
are there to award the prizes if
(i) there are no restrictions?
(ii) the person holding Ticket No. 51 wins the grand prize?
(iii) the person holding Ticket No. 51 wins one of the prizes?
(iv) the person holding Ticket No. 51 does not win a prize?
(v) the persons holding Ticket 49 and 51 both win prizes?

(b) Using a truth table, prove that the following compound CO5, [Evaluate/HOCQ]
proposition is a tautology. CO6
((𝑝 ∨ 𝑞) ∧ (𝑝 → 𝑟) ∧ (𝑞 → 𝑟)) → 𝑟.
3(a) Let 𝐺 be a simple planar graph with less than 30 edges. Prove CO1, [Understand/LOCQ] 2+3
that 𝐺 has a vertex whose degree is less than or equal to 4. CO2 +3+
2=
(b) Use the Euclidean algorithm to find integer values of 𝑥 and 𝑦 10
that satisfy the equation 17𝑥 + 11𝑦 = 2. CO3 [Remember/LOCQ]

(c) Each user on a computer system has a password six characters CO4 [Understand/LOCQ]
long, where each character is an uppercase letter or a digit.
Each password must contain at least one digit. How many
*LOCQ: Lower Order Cognitive Question; IOCQ: Intermediate Order Cognitive Question; HOCQ: Higher Order Cognitive Question
 CONFIDENTIAL

HERITAGE INSTITUTE OF TECHNOLOGY

B.Tech. 3rd Semester Class Test Examination 2021 Session: 2021-22

Discipline: CSE, IT, CSBS
Paper Name: Discrete Mathematics
Paper Code: CSEN 2102
possible passwords are there?

(d) Prove the following implication without using a truth table. CO5,
((𝑝 ∨∼ 𝑝) → 𝑞) → ((𝑝 ∨∼ 𝑝) → 𝑟) ⇒ 𝑞 → 𝑟. CO6 [Apply/IOCQ]

Cognition Level LOCQ IOCQ HOCQ

Percentage distribution 26.67% 40.00% 33.33%

Course Outcome:

After the completion of the course students will be able to

CSEN2102. 1. Interpret the problems that can be formulated in terms of graphs and trees.
CSEN2102. 2. Explain network phenomena by using the concepts of connectivity, independent sets, cliques,
matching, graph coloring etc.
CSEN2102. 3. Achieve the ability to think and reason abstract mathematical definitions and ideas relating to
integers through concepts of well-ordering principle, division algorithm, greatest common divisors and
congruence.
CSEN2102. 4. Apply counting techniques and the crucial concept of recurrence to comprehend the
combinatorial aspects of algorithms.
CSEN2102. 5. Analyze the logical fundamentals of basic computational concepts.
CSEN2102. 6. Compare the notions of converse, contrapositive, inverse etc in order to consolidate the
comprehension of the logical subtleties involved in computational mathematics.

…………………………………………………………………………………………………………………………………………………………………
…………………………………………………………………………………………………………………………………………………………………
…………………………………………………………………………………

*LOCQ: Lower Order Cognitive Question; IOCQ: Intermediate Order Cognitive Question; HOCQ: Higher Order Cognitive Question