4. There is a person z such that x is the father of z and z is the mother of y.

5. each person has a job y and has no job z where z is not equal to y.

22. Chromatic number of a complete graph Kn is n.

The Chromatic number of the complete graph after removing one of the edges i.e. Kn – e is n – 1.

26. (B)

Chromatic number of K10 – e will be 10 – 1 = 9.

33.

Option (C) must be ∃𝑥{𝑃(𝑥) → 𝑄(𝑥)} ⟺ [{∀𝑥𝑃(𝑥) → ∃𝑥𝑄(𝑥)}]

38.

The graph has degree 10. Therefore, the number of edges, m = 5. (Since, d = 2m)

Number of vertices, n = 7
𝑛(𝑛−1) 7(6)
Number of edges in the complemented graph = − 𝑚= − 5 = 21 − 5 = 16
2 2

39.

The graph is a tree with (a + 17) vertices, the number of edges e = a + 16

Total degree of the graph d = 2e = 2a + 32

Therefore, we have 3a + 10 + 12 + 8 = 2a + 32

Therefore, a = 2

41. (B)

𝑆1 : 𝑝 ↑ 𝑞 = ¬(𝑝 ∧ 𝑞) = ¬𝑝 ∨ ¬𝑞
 𝑆2 : 𝑝 ↓ 𝑞 = ¬(𝑝 ∨ 𝑞) = ¬𝑝 ∧ ¬𝑞
Hence only S1 is true

63.

Using the pigeon hole principle

The 7 branches are the 7 pigeon holes. The students represent the pigeons.

Using the extended principle, we have

𝑚−1
⌊ ⌋ + 1 = 10
7
∴ 𝑚 = 64
65.

(a) 𝐴 ∪ 𝐵 = 1111101010 {1,2,3,4,5,7,9}

66. (A)

Solving the homogeneous part of the recurrence relation we have

𝑎𝑛 − 6𝑎𝑛−1 + 8𝑎𝑛−2 = 0
The characteristics equations is

𝑟 2 − 6𝑟 + 8 = 0
(𝑟 − 4)(𝑟 − 2) = 0

𝑟 = 4,2

Particular solution is substituting 𝒂𝒏 = 𝑪

𝑪 − 𝟔𝑪 + 𝟖𝑪 = 𝟗
∴𝑪=𝟑
The characteristic solution is

𝒂𝒏 = 𝑨𝟒𝒏 + 𝑩𝟐𝒏 + 𝟑
For n = 0 we have, A + B = 7

For n = 1 we have, 2A + B = 11

Solving the equations gives the solution of recurrence relation as

 𝒂𝒏 = 𝟒𝒏+𝟏 + 𝟑. 𝟐𝒏 + 𝟑

78.

Applying pigeon hole principle,

The grades represent the pigeon holes and the students represents the pigeons
33−1
Using the extended principle, we have ⌊
4
⌋+ 1 = 9.

Hence at least 9 students will have same grades.