DST EndSem IT PYQ

1. Formal Logic

a.

b.

c.

d.

e.
2. Proof, Rela on and Analysis of Algorithm

a.

b.

c.
d. Recurrence Rela on

i.

e.
3. Sets and Combina ons

a.

b.
 c.
4. Rela ons, Func ons and Matrices

a.

b.

c.
d.

e.

f.

g.

h.

i.

j.

k.
5. La ces and Boolean Algebra

a.

b.
 c.
6. Graph Theory
a. Isomorphism

i.
b. Euler’s Formula

i.

ii.

iii.
c. Warshall’s Algorithm
 i.

ii.
d. Spanning Trees

i.

ii.
e. BFS, DFS
i.
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Compiled by Madhav Gupta (2K21/CO/262)
Scanned by CamScanner
Scanned by CamScanner
 Tetal No. of Page -3 Roll No.
SecondSemester Bock (CSE
EndTerm Examination May-2024
CS102: DISCRETE STRUCTURES
Time: 3:00 Hours Mox. Matks: 50
Note: Anser any fiv qwstions, All questions corry eqal marks. Assme xnitahle
missing data. if any:

W Test the validity of the tollowing argument relating to the students of lO|
Department of Computer Scienee and Engineering (CSE) using Rules of
Interence:
i) Astudent of the CSE will graduate this semester only i' the student has
passed the subject programming fundanentals.
(i) If Raju does not study the subject programming fundanentals for l0
hours aweck, then he will notpass in programming fundanmentals.
(i) lf students study programming fundamentals for 10 hours a weck, then
they cannot play volleyball.
Therefore, it can be concluded that at least one student will not graduate this
sémester unless the student does not play volleyball.
B Convert the statement (x ’ (yA w)) ^(z’ (y Aw)) into PDNF fornN (CO#1|
Q. No. 2 |Sx2|
A Show that among any n + 1 positive integers not exceeding 2n there must (COW2|
be an integer that divides one of the other integers.
B If the computational complexity of adivide and conquer algorithm is (COw2]
determined using recurrence relation f(n) = 2f(Vn) +1, (1) =1,
where n is a perfect square, what is the big theta (0) estimate for the
complexity of the algorithms?
Q.Ao. 3 |Sx2|
ALet A={a, b, c, d} and R a relation on A defined as CO#M
R={(a, b),(b, a). (b,c), (c, d)}. Is Ra transitive relation? If not, find the
ransitive closure of R.
2 3 4 5 ICOW)
BIf A= {1,2,3,4, 5, 6) ,P, =( 4 1 2 6
2 3 4 5 2 3 4 5
P22 3 11 5 4 6P: 3 2 5 4
Find (p, op,)"p, . Is the resulttng permutation odd or even?'
Page I of 3
 9Ao. 4 [5x2]
Let A =(a, b, c, d, e, f, g, h} and R be the relation defined by |CO#3|
(1 1 1 1 1 1 1 17
1 0 0 1 1 0 1
0 0 1 0 1 0 1 1
00 1 0 1 1 1
M¡ = 00 0 1 0 0 1
00 0 0 1 0 1
|0 0 0 0 0 0 1 1
0 0 0 0 0 0 1!
H/Show that (A, R) is a poset.
sá) Does the poset (A, R) have a least element and a greatest element? If
s0,fdentify them.
i) Show that the poset (A,R) is complemented and list all pairs of
complements.
Kivy Prove or disprove that (A, R) is a Boolean aigebra.
B Let * be a binary cperation on a set A, and suppose that * satisfies the (CO*3|
idermpotent, Commutative and Associative Properties Va, b, cE A. Define
a relation S on Aby asbif and only if a= a+b. Show that (A,S) is a
set, and for all a, bin A, GLB(a, b) = a*b. (Note: GLB(a, b)=anb)
No.5
ACompare isomorphism and homomorphism of semigroups. If Zis the s.i of iCO#3)
integers, T the set of even numbers and x is the multiplication operator,
prove or disprove that the semigroups (Z, x) and (T, x) are isomorphic.
BState the Boolean polynomial for the function, f: B4 ’ B given by logic |CO#3|
diagrarn show in the
figure.
Ce the properties of
BBolean alzebra (or
any graphical rnethod)
to refine the
polynonial to use
minimal number of
variables and
operaor.
Drawgic diayrarn for the new Boolean polynomial.

Page 2 of 3
 |5x2)
of the possible spanning trees for |CO#4|
Drawthe digraphs graph is given
the symmctric relation whose trees arce there?
spanning
alongside. How many
codes E01 to E08) for 2nd |CO#4]
offers 8 elective subjects (with of the number of students
BA collegestudents to choose from. The data tabulated below:.
Semester
Subject, and Subject is as
registeredfor both Subject, Subject
Subject, | Subject, E05 E08
E04 e) E03 8
E01 E08
E07 6 E06
E04 E03
b)
E07
E02 g) E06 E01 11
4 h)
of two subjects,
C EOS
E02 examination
d) the not
will occur in the timetable if time-slot results in astudent
Aclash same the
conducted during the of the subjects for which
which are of one
able to take the examination
being
student is registered. examination per day, in how
only one examination be
Assuming that a student takes can the end-semester
) numbers of days elective subjects?
minimum for these
many in the timetable
conducted without any clash time-tables can be generated for
the
different clash-free elective subjects? (Hint:
(i) How many End-Sem Examination
for the
of
conduct ofgraph colouring)
Application |5x2)
Q. No. 7 fully parenthesized [CO#4]
tree for the
Construct a labelled positional binary (e+(f*g)). Assuming that
A
algebraic expression ((a +b) - c) x show the result of'performing a
the label of v,
visiting a vertex v printsconstructed binary tree.
post-order search on the wished to send out a
[CO#5|
formed entrepreneurship
B The CEO of a newly major clients across 5 towns, T = (t, tz, tg, t4, tg.
sales1man to visit all these towns is
The travel cost between 7 50 1 1
=nifthe
givenby the matrix C, where Ci 0 3 50 8
cost of travel from town i ioj is (7 X C=so 3 0 6 2
7
1000). If the headquarters of this 1 50 6
2 7
establish1ment is located at ti, write a
l1 8
round
program to find the most economical minimum cost of the trip?
strip for the salesman. What willbe the
Page 3 of3
Recommended Marking Scheme End-Term Examination December–2024: CO205 Discrete Structures
(The solutions provided are suggestive in nature)

Q. No. 1A: Aspects to be evaluated [5]

Defining predicates and domain of discourse correctly ( *5=1.25)
Let 𝑥 ∈ set of students of DTU
𝑃(𝑥): 𝑥 ℎ𝑎𝑠 𝐶𝐺𝑃𝐴 > 6.0
𝑄(𝑥): 𝑥 𝑖𝑠 𝑒𝑙𝑖𝑔𝑖𝑏𝑙𝑒 𝑡𝑜 𝑎𝑝𝑝𝑙𝑦 𝑓𝑜𝑟 𝑝𝑙𝑎𝑐𝑒𝑚𝑒𝑛𝑡
𝑅(𝑥): 𝑥 ℎ𝑎𝑠 𝑛𝑜𝑡 𝑜𝑏𝑡𝑎𝑖𝑛𝑒𝑑 𝑝𝑎𝑠𝑠𝑖𝑛𝑔 𝑔𝑟𝑎𝑑𝑒 𝑖𝑛 𝑎 𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡ℎ𝑎𝑡 𝑥 𝑟𝑒𝑔𝑖𝑠𝑡𝑒𝑟𝑒𝑑
𝑆(𝑥): 𝑥 𝑐𝑎𝑛 𝑎𝑝𝑝𝑒𝑎𝑟𝑓𝑜𝑟 𝑖𝑛𝑡𝑒𝑟𝑠ℎ𝑖𝑝 𝑡𝑒𝑠𝑡

Correct construction of predicate statements for 3 premises and presumed conclusion ( *4=1.0)
𝑃 : ∀𝑥 𝑃(𝑥) → 𝑄(𝑥) ; 𝑃 : ∀𝑥 𝑅(𝑥) → ¬𝑆(𝑥) ; 𝑃 : ∀𝑥 𝑄(𝑥) → 𝑆(𝑥) ;
𝑃 : ∃𝑥 ¬𝑃(𝑥) ; 𝑃𝑟𝑒𝑠𝑢𝑚𝑒𝑑 𝐶𝑜𝑛𝑐𝑙𝑢𝑠𝑖𝑜𝑛 ∴ ∃𝑥 (¬𝑅(𝑥))
Application of rules of inferences to reach presumed conclusion using each of the three premises ( *9=2.25)
# Step Reason
1. 𝑃(𝑎) → 𝑄(𝑎) Universal instantiation of 𝑃 , where 𝑎 ∈ set of students of CSE Department
2. 𝑅(𝑎) → ¬𝑆(𝑎) Universal instantiation of 𝑃
3. 𝑄(𝑎) → 𝑆(𝑎) Universal instantiation of 𝑃
4. ¬𝑃(𝑎) Universal instantiation of 𝑃
5. 𝑃(𝑎) → 𝑆(𝑎) Hypothetical Syllogism 1 and 3.
6. 𝑆(𝑎) → ¬𝑅(𝑎) Contrapositive of 2.
7. 𝑃(𝑎) → ¬𝑅(𝑎) Hypothetical Syllogism 5 and 6.
8. ¬𝑅(𝑎) Modus Tollens 7 and 𝑃 .
9. ∃𝑥 ¬𝑅(𝑥) Existential generalisation of 8, which is the presumed conclusion

Stating validity of the argument. (0.5)

Q. No. 1B: Aspects to be evaluated [5]

Correct use of logical equivalence to generate PDNF form OR
Correct generation of truth table OR K-Map for identifying the minterms to produce PDNF form
𝑥 → (𝑦 ∧ 𝑤) ∧ 𝑧 → (𝑦 ∧ 𝑤)
≡ ¬𝑥 ∨ (𝑦 ∧ 𝑤) ∧ ¬𝑧 ∨ (𝑦 ∧ 𝑤)
≡ (¬𝑥 ∧ ¬𝑧) ∨ (𝑦 ∧ 𝑤)
≡ ¬𝑥 ∧ (¬𝑦 ∨ 𝑦) ∧ ¬𝑧 ∧ (¬𝑤 ∨ 𝑤) ∨ (¬𝑥 ∨ 𝑥) ∧ 𝑦 ∧ (¬𝑧 ∨ 𝑧) ∧ 𝑤
≡ (¬𝑥 ∧ ¬𝑦 ∧ ¬𝑧 ∧ ¬𝑤) ∨ (¬𝑥 ∧ ¬𝑦 ∧ ¬𝑧 ∧ 𝑤) ∨ (¬𝑥 ∧ 𝑦 ∧ ¬𝑧 ∧ ¬𝑤) ∨ (¬𝑥 ∧ 𝑦 ∧ ¬𝑧 ∧ 𝑤) ∨
(¬𝑥 ∧ 𝑦 ∧ 𝑧 ∧ 𝑤) ∨ (𝑥 ∧ 𝑦 ∧ ¬𝑧 ∧ 𝑤) ∨ (𝑥 ∧ 𝑦 ∧ 𝑧 ∧ 𝑤)
Q. No. 2A: Aspects to be evaluated [5]
Application any valid method of proving the inequality
Let 𝑃(𝑛) denote the proposition: “𝑛 − 𝑛 is divisible by 3.”
Proof by Principle of Mathematical Induction (PMI):
Basic Step: The statement P(1) is true because 1 − 1 = 0 is divisible by 3.
Inductive Step:
Assume that 𝑃(𝑘) is true; i.e. assume that 𝑘 − 𝑘 is divisible by 3 for arbitrary positive integer 𝑘.
To complete inductive step, prove 𝑃(𝑘) → 𝑃(𝑘 + 1) is true; i.e. 3 divides (𝑘 + 1) − (𝑘 + 1)
(𝑘 + 1) − (𝑘 + 1) = (𝑘 + 3𝑘 + 3𝑘 + 1) − (𝑘 + 1) = (𝑘 − 𝑘) + 3(𝑘 + 𝑘) = 𝑃(𝑘) + 3(𝑘 + 𝑘)
which is divisible 3 as the first and second terms are both divisible by 3. This completes the inductive
∴Using PMI, concluded that 𝑛 − 𝑛 is divisible by 3

Page 1 of 6
Note: Question 2B has a misprint, the recurrence relation was printed as 𝑎 = 5𝑎 − 𝟔𝒂𝒏 − 𝟐 for
𝑛 ≥ 2, 𝑎 = 1, 𝑎 = 2.5 instead of 𝑎 = 5𝑎 − 𝟔𝒂𝒏 𝟐 for 𝑛 ≥ 2, 𝑎 = 1, 𝑎 = 2.5 . Some
students may have not received the correction to this question. It is recommended that the benefit of doubt
be provided to the students.
Q. No. 2B: Aspects to be evaluated [5]

Application of any of the techniques for finding solution to recursive relations

𝑎 = 5𝑎 − 6𝑎 for 𝑛 ≥ 2, 𝑎 = 1, 𝑎 = 2.5
0.5
Characteristic Equation: 𝑥 − 5𝑥 − 6 = 0 or (𝑥 − 2)(𝑥 − 3) = 0
Root of Characteristic equation: 𝛼 = 2 , 𝛽 = 3 0.5

General Form of Solution 𝑎 = 𝑢 𝛼 + 𝑣 𝛽 i.e. 𝑎 = 𝑢 2 + 𝑣 3 1

Using 𝑎 = 1, 𝑎 = 2.5 , 𝑎 =1=𝑢 +𝑣 and 𝑎 = =2𝑢 +3𝑣 ∴𝑢=𝑣= 1

Thus 𝑎 = 2 + 3 = (2 + 3 ) 1

𝟏 1
𝒂𝟐𝟓 = 𝟐𝟐𝟓 + 𝟑𝟐𝟓 = (33,554,432 + 847,288,609,443) = 423,661,081,937.5
𝟐

Q. No. 3A: Aspects to be evaluated [5]

Understanding of Transitive property of relation, transitive closure using any appropriate method
Given 𝐴={𝑎,𝑏,𝑐,𝑑} and 𝑅={(𝑎,𝑏),(𝑏,𝑎),(𝑏,𝑐),(𝑐,𝑑)}.
Using graphical method
𝑅 =𝑅∪𝑅 ∪𝑅 ∪𝑅
= {(𝑎, 𝑎), (𝑎, 𝑏), (𝑎, 𝑐), (𝑎, 𝑑)(𝑏, 𝑎), (𝑏, 𝑏), (𝑏, 𝑐), (𝑏, 𝑑), (𝑐, 𝑑)}

Page 2 of 6
OR Using Warshall’s Algorithm
0 1 0 0
1 0 1 0
𝑀 =𝑊 = Examine 𝑊 for 𝑘 = 1 to generate 𝑊 :
0 0 0 1
0 0 0 0
Column : 1 in position 2 ∴ add 1 in position 2,2 if not existing, and
Row : 1 in position 2 𝑤 = 1 𝑖𝑓 𝑤 = 1, to generate 𝑊
0 1 0 0
1 1 1 0
𝑊 = Examine 𝑊 for 𝑘 = 2 to generate 𝑊 :
0 0 0 1
0 0 0 0

Column : 1 in positions 1,2 ∴ add 1 in positions 1,1; 1,2; 1,3; 2,1; 2,2; 2,3 if not
Row : 1 in positions 1,2,3 existing, and 𝑤 = 1 𝑖𝑓 𝑤 = 1, to generate 𝑊
1 1 1 0
1 1 1 0
𝑊 = Examine 𝑊 for 𝑘 = 3 to generate 𝑊 :
0 0 0 1
0 0 0 0

Column : 1 in positions 1,2 ∴ add 1 in positions 1,4; 2,4; if not existing,

Row : 1 in positions 4 and 𝑤 = 1 𝑖𝑓 𝑤 = 1, to generate 𝑊
1 1 1 1
1 1 1 1
𝑊 = Examine 𝑊 for 𝑘 = 4 to generate 𝑊 :
0 0 0 1
0 0 0 0
Row 4 has no 1s ∴ 𝑊 = 𝑊 = 𝑀
1 1 1 1
1 1 1 1
𝑀 =
0 0 0 1
0 0 0 0

OR 𝑴𝑹 = 𝑴𝑹 ∨ 𝑴𝑹𝟐 ∨ 𝑴𝑹𝟑 ∨ 𝑴𝑹𝟒

Q. No. 3B: Aspects to be evaluated [5]

Correct composition of permutations (2.5)
Correct identification of odd/even permutations (2.5)
Given = {1, 2, 3, 4, 5, 6,7,8} ,
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
𝑝 = ; 𝑝 = ;
3 4 1 2 6 5 7 8 2 3 1 5 4 6 7 8
1 2 3 4 5 6 7 8
𝑝 = .
6 3 2 5 4 1 7 8
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
(𝑝 ∘ 𝑝 ) ∘ 𝑝 = ∘𝑝 =
1 5 2 3 6 4 7 8 4 2 5 6 3 1 7 8
1 2 3 4 5 6 7 8
= (3 5) ∘ (1 4 6) = (3 5) ∘ (1 6) ∘ (1 4) , which is a
4 2 5 6 3 1 7 8
composition of odd number of transpositions. ∴ (𝑝 ∘ 𝑝 ) ∘ 𝑝 results in an odd permutation.

Page 3 of 6
Q. No. 4A: Aspects to be evaluated [5]
Understanding of the definition of partial order set and drawing the Hasse Diagram for the poset
Understanding of the definition of isomorphic posets
Given 𝐴 = {1,2,3,5,6,10,15,30} with the partial order ≤ of (2+2)
divisibility on A, the Hasse Diagram of the poset (𝐴, ≤) is
shown in Fig. 1.

Given 𝐵 = 𝑃(𝑆), where 𝑆 = {𝑒, 𝑓, 𝑔}

∴ B = { { }, {𝑒}, {𝑓}, {𝑔}, {𝑒, 𝑓}, {𝑒, 𝑔}, {𝑓. 𝑔}, {𝑒, 𝑓, 𝑔} }

The Hasse Diagram of the poset (𝐵, ⊆) is shown in Fig.2.

It is possible to define a function 𝑓: 𝐴 → 𝐵, a one-to-one correspondence, from 𝐴 to 𝐵 as: (1)

𝑓(1) = { }; 𝑓(2) = {𝑒 }; 𝑓(3) = {𝑓 }; 𝑓(5) = { 𝑔}; 𝑓(6) = {𝑒, 𝑓 }; 𝑓(10) = { 𝑒, 𝑔};

𝑓(15) = {𝑓, 𝑔 }; 𝑓(30) = { 𝑒, 𝑓, 𝑔};

The posets (𝐴, ≤) and (𝐵, ⊆) are therefore isomorphic.

OR

The Hasse Diagrams of posets (𝐴, ≤) and (𝐵, ⊆) are of the same form except for the labels of
the vertices. ∴ posets (𝐴, ≤) and (𝐵, ⊆) are isomorphic

Q. No. 4B: Aspects to be evaluated [5]

Interpretation / identification of Lower Bound, Upper Bound, GLB, LUB of a subset of the (1.25 *
poset(𝐴, ≤) 4
=5.0)
(i) Lower Bounds (B) = { }, Lower Bound of (C) = {𝑎, 𝑏, 𝑐}
(ii) Upper Bounds (B) = {𝑐, 𝑑, 𝑒, 𝑓, 𝑔, ℎ} , Upper Bounds (C) = { 𝑓, 𝑔, ℎ}
(iii) GLB (B) does not exist, GLB (C) = 𝑐
(iv) LUB (B) = c, LUB (C) does not exist

Q. No. 5A: Aspects to be evaluated [5]

Application of the understanding of definition of Boolean Algebra and the different Method of
Proofs to prove / disprove a given statement
Given: 𝐷 is the set of positive integers that divides any integer 𝑛 ≥ 1 , 𝑝 is a prime number and
𝑝 divides 𝑛
Required to prove if 𝐷 is a Boolean Algebra or not a Boolean Algebra
Proof by Contradiction: Assume that 𝐷 is a Boolean Algebra.
Given 𝑝 divides 𝑛, ∴ 𝑛 = 𝑝 𝑞 for some integer 𝑞
Since 𝑝 is also a divisor of 𝑛 , 𝑝 is an element of 𝐷 .
If 𝐷 is a Boolean Algebra, then 𝑝 must have a complement, 𝑝′ and by definition of Boolean
Algebra, 𝐻𝐶𝐹 (𝑝 , 𝑝 ) = 1, the least element and 𝐿𝐶𝑀(𝑝 , 𝑝 ) = 𝑛 , the identity element
{ Using the identity 𝑎 ∙ 𝑏 = 𝐻𝐶𝐹(𝑎, 𝑏) ∙ 𝐿𝐶𝑀(𝑎, 𝑏) }
𝑝∙𝑝 =1 ∙𝑛; i.e. 𝑝 = = 𝑝𝑞

This shows that 𝐻𝐶𝐹(𝑝, 𝑝𝑞) = 1, which is not possible ( ∵ 𝑝 is the common divisor of 𝑝 and 𝑝𝑞) ,
Thus resulting in a contradiction. Hence proved that 𝐷 cannot be a Boolean Algebra.

Page 4 of 6
Q. No. 5B: Aspects to be evaluated [5]
Understanding of Boolean polynomial (2.5)
Application of properties of Boolean algebra / application of Karnaugh-Map (2.5)

(2.5)

(𝑦 ∧ 𝑥 ) ∨ (𝑦 ∧ 𝑤 ) ∨ (𝑦 ∧ 𝑤) ∨ 𝑧 O Using K-Map
≡ (𝑦 ∧ 𝑥 ) ∨ [𝑦 ∧ (𝑤 ∨ 𝑤)] ∨ 𝑧 R
≡ (𝑦 ∧ 𝑥 ) ∨ 𝑦 ∨ 𝑧′ 𝑦 ∨ 𝑧′
≡ 𝑦 ∨ 𝑧′ (2.5)

Q. No. 6A: Aspects to be evaluated – Understanding of Spanning Tree of a undirected graph [5]

There are six possible spanning trees.

Q. No. 6B: Aspects to be evaluated [5]

Understanding the concepts and application of graph colouring
Starting at any vertex, say vertex 𝑎; vertex 𝑎 can in coloured in 𝑥 ways; vertex 𝑏 can in 3
coloured in (𝑥 − 1) ways; vertex 𝑐 can in coloured in (𝑥 − 2) ways; vertex 𝑑 can in coloured
in (𝑥 − 1) ways; vertex 𝑒 can in coloured in (𝑥 − 2) ways and vertex 𝑓 can in coloured in (𝑥 −
2) ways.

∴ Chromatic Polynomial, 𝑃 (𝑥) = 𝑥(𝑥 − 1) (𝑥 − 2)

𝑃 (0) = 𝑃 (1) = 𝑃 (2) = 0 ; 𝑃 (3) =6 2

∴ Chromatic Number of the graph H, χ(H) = 3

Page 5 of 6
Q. No. 7A: Aspects to be evaluated [5]
Understanding and application of Euler’s path
The graph with each display hall / stand as a vertex and an edge between 2.5
two vertices if the corresponding room/stand is connected by a door is
given in Graph G.

It can be observed that vertices, 𝐻 , 𝐻 , 𝐻 and 𝐻 have odd-degrees. Also, if a graph has more 2.5
than two vertices of odd degree, then there can be no Euler path in that graph. Graph G has more
than two vertices with odd degree. Hence, there is no Euler path in Graph G.

Thus, it is NOT possible to visit every exhibit hall / stand in the museum by passing through each
door exactly once.

Q. No. 7B: Aspects to be evaluated [5]

Data structure for correct representation of graph and cost matrix / weighted graph.
Any algorithm for Identification of minimal spanning tree (MST)
Identification of minimum cost.
One of possible minimal spanning trees (MST) with root as vertex A is given below

The minimum cost for establishing this data network will be

∑ 𝑤𝑖𝑒𝑔ℎ𝑡𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑒𝑑𝑔𝑒𝑠 𝑜𝑓 𝑡ℎ𝑒 𝑀𝑆𝑇 = (2.4 + 1.8 + 1.7 + 2.1 + 2.6 + 2.8 + 2.5 + 2.1 + 2.2)

= ₹20.2 𝐿𝑎𝑘ℎ𝑠

Page 6 of 6