Slot: A2 Set: B

SRM Institute of Science and Technology

College of Engineering and Technology
DEPARTMENT OF MATHEMATICS
SRM Nagar, Kattankulathur – 603203, Chengalpattu District, Tamilnadu
Academic Year: 2021-22 (Even)

Test : CLAT- III Date : 20/06/2022

Course Code & Title :18MAB302T-Discrete Mathematics for Engineers Duration: 2 Periods
Year/ Sem/Branch : II /IV/NWC Max. Marks: 50

Q.No Part – A( 10 x 1 = 10 Marks)

Question Answer

1. Generators of the cyclic group (ℤ6, +6) are

A. 1 and 3 B. 3 and 5 C

C. 1 and 5 D. 1 , 3 and 5
2. If ∘ is binary operation on the set of integers defined by a∘b=a+b+2, then the
identity element is D
A. 0 B. 1 C. −1 D. −2

3. A cyclic group is always

A. Abelian B. Non-commutative A
C. Non-abelian D. Permutation group

4. The weight of the word 101011 is C

A. 2 B. 3 C. 4 D. 5
5. The minimum distance between these code words 0000, 0110, 1011, 1100 is
A. 1 B. 2 C. 3 D. 4 B

6. The chromatic number of a complete graph of 5 vertices is

A. 2 B. 3 C. 4 D. 5 D

7. A vertex, which is adjacent to exactly one vertex in a graph is called ________

vertex. B
A. Isolated B. Pendant
C. Incident D. Simple
8. The degree of an isolated vertex is A
A. 0 B. 1 C. 2 D. 3
9. A _________ path of a graph G is a path, which includes every edges of G
exactly once. A
A. Eulerian B. Hamiltonian C. Planar D. Isomorphic
10. If two graphs are isomorphic then which statement is false?
A. Number of vertices of two graphs are equal
B. Number of edges of two graphs are equal
D
C. The degree sequence of the vertices of the graph are same
D. Corresponding vertices may not have the same degree

Part – B (4x 10 = 40 Marks)

Answer ANY Four
(i) If 𝑎 is a generator of the group G then 𝑎 !! is also a generator.
𝐺 =< 𝑎 >. So any element 𝑏 ∈ 𝐺, 𝑏 = 𝑎 ! , where 𝑟 is an integer.
[2 Marks]
Now, 𝑏 = 𝑎 ! = (𝑎 !! )!! .
Therefore, < 𝑎 !! > = 𝐺
Hence 𝑎 !! is also a generator.
[3 Marks]
11.
(ii) Show that group (G, ∘), (𝑎 ∘ 𝑏)!! = 𝑏 !! ∘ 𝑎 !! for all 𝑎, 𝑏 ∈ G.
𝑎 ∘ 𝑏 ∘ 𝑏 !! ∘ 𝑎 !! = 𝑎 ∘ 𝑏 ∘ 𝑏 !! ∘ 𝑎 !! = 𝑎 ∘ 𝑒 ∘ 𝑎 !! = 𝑎 ∘ 𝑎 !! = 𝑒,
[2 Marks]
𝑏 !! ∘ 𝑎 !! ∘ 𝑎 ∘ 𝑏 = 𝑏 !! ∘ 𝑎 !! ∘ 𝑎 ∘ 𝑏 = 𝑏 !! ∘ 𝑒 ∘ 𝑏 = 𝑏 !! ∘ 𝑏 = 𝑒.
[2 Marks]
!! !! !!
Hence by definition of inverse, (𝑎 ∘ 𝑏) =𝑏 ∘𝑎 for all 𝑎, 𝑏 ∈ G.
[1 Mark]

Show that the set 𝐺 = {1,2,3,4,5,6} form a cyclic group under the operation multiplication modulo 7.
Find all generators of this group. Is it a commutative group? Justify?

Modulo
1 2 3 4 5 6
7
1 1 2 3 4 5 6
2 2 4 6 1 3 5
3 3 6 2 5 1 4
4 4 1 5 2 6 3
5 5 3 1 6 4 2
6 6 5 4 3 2 1
12.
(a) Since all the elements in the composition table belong to the set 𝐺, the set 𝐺 is closed under
multiplication.
(b) Here 𝐺 is a subset of ℝ (set of real numbers) and real numbers obey associative property with
respect to multiplication. Hence 𝐺 satisfies associative property with respect to multiplication.
(c) Here 1 is the identity element.
(d) The inverse of 1, 2, 3, 4, 5, 𝑎𝑛𝑑 6 are 1, 4, 5, 2, 3, 6 respectively.
Hence 𝐺 is a group under the operation multiplication modulo 7.
[4 Marks]
Now, ‘3’ is the generator of the group 𝐺. Hence 𝐺 is a cyclic group.
[2 Marks]
The elements 3 and 5 are the generators of the group 𝐺.
 [3 Marks]
The composition table is symmetric about the main diagonal. Hence the group is commutative.
[1 Mark]

1 0 0 1 1 0
Given the generator matrix 0 1 0 0 1 1 corresponding to the encoding function
0 0 1 1 0 1
𝑒: 𝐵3 → 𝐵6 , find the corresponding parity check matrix and use it to decode the following
received words
(i) 111101 (ii) 100100 (iii) 111100 (iv) 010100

1 0 1 1 0 0
Parity check matrix: 𝐻 = 1 1 0 0 1 0
0 1 1 0 0 1
[2 Marks]
1
1 0 1 1 0 0 1 1
! 1
(i) 𝐻 𝑟 = 1 1 0 0 1 0 = 0
1
0 1 1 0 0 1 0 1
1
Since the syndrome is the third column of 𝐻, the element in the third position of 𝑟 is changed.
Therefore the decode word is 110101.
1
1 0 1 1 0 0 0 0
! 0
(ii) 𝐻 𝑟 = 1 1 0 0 1 0 = 1
13. 1
0 1 1 0 0 1 0 0
0
Since the syndrome is the fifth column of 𝐻, the element in the fifth position of 𝑟 is changed.
Therefore the decode word is 100110.
1
1 0 1 1 0 0 1 1
! 1
(iii) 𝐻 𝑟 = 1 1 0 0 1 0 = 0
1
0 1 1 0 0 1 0 0
0
Since the syndrome is the fourth column of 𝐻, the element in the fourth position of 𝑟 is
changed. Therefore the decode word is 111000.
0
1 0 1 1 0 0 1 1
! 0
(iv) 𝐻 𝑟 = 1 1 0 0 1 0 = 1
1
0 1 1 0 0 1 0 1
0
Since the syndrome is not identical to any column of 𝐻, the received word cannot be decode
uniquely.
[8 Marks]
 (i) Find the number of vertices, the number of edges and degree of each vertices. Also verify
the handshaking theorem.

Number of vertices: 5
Number of edges (e): 10
𝑑𝑒𝑔 𝑎 = 𝑑𝑒𝑔 𝑏 = 𝑑𝑒𝑔 𝑐 = 𝑑𝑒𝑔 𝑑 = 𝑑𝑒𝑔 𝑒 = 4
[3 Marks]
(degrees of 5 vertices) = 20 = 2 ∙ 10 = 2𝑒
14. Hence handshaking theorem verified.
[2 Marks]

(ii) Draw the graph represented by the following adjacency matrix.

0 1 1 1 0
1 0 0 1 1
1 0 0 1 1
1 1 1 0 0
0 1 1 0 0

Check whether the following two graphs G and H are isomorphic

15.

Number of Number of Degree

Graphs
vertices edges sequences
G 4 6 3,3,3,3
H 4 6 3,3,3,3
[3 Marks]

Bijective mapping:
 𝐴 ⟶ 𝑣!
𝐵 ⟶ 𝑣!
𝐶 ⟶ 𝑣!
𝐷 ⟶ 𝑣!
[3 Marks]
Adjacency matrices:
A B 𝐶 𝐷 𝑣! 𝑣! 𝑣! 𝑣!
𝐴 0 1 1 1 𝑣! 0 1 1 1
𝑣
𝐴! = 𝐵 1 0 1 1 ; 𝐴! = 𝑣! 1 0 1 1 ;
𝐶 1 1 0 1 ! 1 1 0 1
𝐷 1 1 1 0 𝑣! 1 1 1 0

[3 Marks]
Therefore 𝐴! = 𝐴! .
Hence 𝐺 and 𝐻 are isomorphic graphs. [1 Mark]
Write down the Kruskal’s algorithm for finding the minimum spanning trees. Find a minimum
spanning tree using Kruskal’s algorithm for the graph given below:

Kruskal’s algorithm:
(a) The edges of the given graph G are arranged in the order of increasing weights.
(b) An edge G with minimum weight is selected as an edge of the required spanning tree.
(c) Edges with minimum weight that do not from a circuit with the already selected edges are
successively added.
(d) The procedure is stopped after (𝑛 − 1) edges have been selected.
[3 Marks]
Edge Weight Included or not If not then why
16. EF 1 Yes −
AD 2 Yes −
HI 2 Yes −
CF 3 Yes −
BD 3 Yes −
EH 3 Yes −
BC 4 Yes −
GH 4 Yes −
FI 4 No 𝐹−𝐼−𝐻−𝐸
HF 4 − −
AB 5 − −
BE 5 − −
DG 6 − −
BF 6 − −
DE 7 − −
DH 8 − −
[5 Marks]
A B C

D E F

G I
H
[2 Marks]

Dr. Swarup Barik (SRMIST)