End Semester Examination (February 2022)

Academic Year: 2021-2022

Max. Marks: 50 Duration: 2 Hrs.
Class: S. Tech Semester: III
Course: Discrete Structures Course Code: DJ19ITC301
Program: Information Technology

Instructions:
(1) Solve ANY FIVE questions.
(2) Read the questions carefully.
(3) Assume suitable data wherever required, but justify it.
(4) All questions carry equal marks.
(5) Answer to each new question is to be started on a fresh page.
(6) Figure to the right indicate full marks.
(7) Draw the neat labelled diagrams wherever necessary.

Question Max.
No. Marks
Q1 (a) In survey of 265 college students, the following data were obtained:
64 had taken a Mathematics course,
94 had taken a Computer science course,
58 had taken a Business course,
28 had taken both a Mathematics and a Business course,
26 had taken both a Mathematics and a Computer science course,
22 had taken both a Computer science and a Business course, and
5
14 had taken all three types of courses.
Answer to the following questions:
a) How many students were surveyed who had taken none of the
three types of the courses?
b) How many had taken only Mathematics course.
c) How many had taken Computer science and Business course, but
not Mathematics.
d) How many had taken exactly one of the courses.

Q1 (b) Show that in a group of six persons, there is always a subgroup of three persons 5
who are pairwise friends or a subgroup of three persons who are pairwise strangers.

Q2 (a) Find the matrix representation and directed graph of the relation 𝑅 defined on set
𝐴 = {2, 3, 4, 6, 8, 24, 48} as 𝑎 𝑅 𝑏 if and only if 𝑎|𝑏 (𝑎 divides 𝑏.) 5
Determine whether 𝑅 is a partial order relation. Justify.

Page 1 of 3
Q2 (b) 𝑥+1
Let 𝐴 = 𝐵 = 𝐶 = ℝ, let 𝑓: 𝐴 ⟶ 𝐵, 𝑔: 𝐵 ⟶ 𝐶 be defined by 𝑓(𝑥) = and
2
5
𝑔(𝑥) = 2𝑥 2 + 5. Find 𝑓 ∘ 𝑔, 𝑔 ∘ 𝑓 and determine whether 𝑓, 𝑓 ∘ 𝑔, 𝑔 ∘ 𝑓 are
one-one, onto, bijective.

Q3 (a) 0 1 0 1 0 0 0
1 0 1 0 0 0 1
0 1 0 1 1 0 0 5
Draw the graph 𝐺 whose adjacency matrix is 1 0 1 0 0 0 0 .
0 0 1 0 0 1 0
0 0 0 0 1 0 1
[0 1 0 0 0 0 0]
Also find 𝜒(𝐺) [Chromatic number of 𝐺.]

Q3 (b) Use Huffman algorithm to construct a 2 − tree of minimum weighted path

length for the following data.
Symbol 𝐴 𝐵 𝐶 𝐷 𝐸 𝐹 𝐺 5
Frequencies 13 2 19 23 29 5 9
Also encode the symbols using Huffman coding.

Q4 (a) 1 2 3 4
Consider the symmetric group 𝑆4 , let 𝛼 = ( ) and
2 1 3 4
1 2 3 4
𝛽=( ). 5
1 3 2 4
a) Find 𝛼𝛽, 𝛽𝛼, 𝛼 2 and 𝛽 −1 .
b) Find the orders of 𝛼, 𝛽, 𝛽𝛼.
c) Is 𝑆4 an abelian group ?

Q4 (b) Find the subgroups generated by the elements of the group 𝑈(8) = {1, 3, 5, 7}
under multiplication modulo 8 and the group 𝑈(10) = {1, 3, 7, 9} under 5
multiplication modulo 10. Is 𝑈(8) isomorphic to 𝑈(10)?

Q5 (a) Consider the (2, 5) encoding function 𝑒: 𝐵 2 ⟶ 𝐵 5 defined as

1) 𝑒(00) = 00000
2) 𝑒(01) = 01110
3) 𝑒(10) = 10101 5
4) 𝑒(11) = 11011.

Decode the following words relative to maximum likely hood encoding function.
List the code words in the order same as the order given in the question above.
a) 11101 b) 10101 c) 00101 𝑑) 01111.

Page 2 of 3
Q5 (b) Check whether the (2, 6) encoding function 𝑒: 𝐵 2 ⟶ 𝐵 6 defined by
𝑒(00) = 000000, 𝑒(01) = 111001, 𝑒(10) = 101011 and 𝑒(11) = 010010 is a 5
group code? Also find the minimum distance of 𝑒 and the number of errors 𝑒 can
detect.

Q6 (a) Let the Hasse diagram of a POSET ({𝑎, 𝑏, 𝑐, 𝑑, 𝑒, 𝑓, 𝑔}, ≤) be as follows:

Answer the following questions:

a) Find the universal upper bound and universal lower bound.
b) Find the upper bound/s of the pairs {𝑏, 𝑔}, {𝑐, 𝑑}, {𝑎, 𝑐}.
c) Find the lower bound/s of the pairs {𝑏, 𝑔}, {𝑐, 𝑑}, {𝑎, 𝑐}
d) Find the complement of 𝑓.
Q6 (b) Draw the join (∨) and the meet (∧) table of the POSET corresponding to the
following Hasse diagram. Is it a Lattice?

All the Best!

Page 3 of 3