SRM Institute of Science and Technology, VADAPALANI CAMPUS, Department of Mathematics

18MAB 302T- DISCRETE MATHEMATICS FOR ENGINEERS a) Hamming code b) Group code c) Parity check d) Symmetric code Ans: b
Question Bank for CT-III ( CSE & ECE)
UNIT – IV Part-B
1. Show that (i) Every cyclic group is abelian (ii) If ‘a’ is the generator
PART-A of a cyclic group ( G,*) , a 1 is also a generator of ( G,*).
1). * : A  A  A is said to be a binary operation if
2. Let I = {1, -1, I , -i} and ( I,*) is a group. Find the order of each
a) a * b  A forsome a  A b) a * b  A forsome b  A element of a group.
3. In a group G , prove that a * b   b 1 * a 1 , a, b  G.
1
c). a * b  A forsome a, b  A d) a * b  A for all a, b  A
Ans : d 4. If a, b  R, where( R,,) is a ring show that
2) The inverse of – i in the multiplication group {1,-1,i,-i} is (a  b) 2  a 2  a  b  b  a  b 2
a. 1 b. i c.-1 d. –I Ans: b 5. Define a Field with example.
3) Every group of prime order is ------
0 1 1
(a) Cyclic aod hence abelian (b) Abetian and hence cyclic  
(c) Not cyclic & ab€lian (d) Not abelian and cyclic Ans a 0 1 1
4) What are the generators of the group (Z, +)?. 6. Let H   1 0 0  be a parity check matrix. Determine the (2,5)
 
(a) 1 & 0 (b) -1 & 0 (c) 0 alone (d) 1& -1 Ans : d 0 1 0
5) The necessary oondition that a non-empty subset H of a group G to be a subgroup is 0 0 1
1 1
a) a, b  H  a , b  H
1
b) a, b  H  a * b  H
 
group code function eH : B 2  B 5 .
a, b  H  a * b   H
1
c) a, b  H  a * b  H d) Ans : b
7. Consider the (2,4) encoding function e as follows. How many errors
6) Let G be a group. If a, b  G then the inverse of a*b is
will e deduct? e(00) = 0000 , e(01) =0110 , e(10) = 1011 &
(a) a 1 * b 1 (b) a * b 1 (c) a 1 * b (d) b 1 * a 1 Ans : d e(11) =1100.
7) The minimum order of a non abelian group is
(a) 3 (b) 6 (c) 9 (d) 4 Ans : b 8. Define an integral domain and give one example.
8) Every subgroup of an abelian group is Part-C
(a) Normal (b) Abelian
(c) Cyclic (d) A permutation group Ans : a 9. Show that the identity element of a group (G,*) is unique.
9) The weight of the code word [11101] is 10. Prove that a subset H of a group ( G,*) is a subgroup of G if and only
(a) 1 (b) 5/4 (c) 4/5 (d) 4 Ans : d if a, b  H  a * b 1  H
10. A code can connect a set of at the most k errors if and only if the minimum
distance between any two code words is 11. Prove that the subgroup of cyclic group is cyclic.
a) Atmost (2k+1) b) Atmost (2k-1) c) Atleast (2k+1) d) Atleast 2k Ans:a 12. Prove that every group of prime order is cyclic.
11. Any code which is group under the operation  is called
 SRM Institute of Science and Technology, VADAPALANI CAMPUS, Department of Mathematics

13. Show that ( Z ,,) is a commutative ring with identity where the 17. Consider the parity check matrix H given by
, and  are defined for any a, b  Z as 1 1 0
operations .  
a  b  a  b  1 and a  b  a  b  ab 0 1 1
H  1 0 0  determine the group code function eH : B 2  B 5 .
14. If S is the set of ordered pairs (a,b) of real numbers and if the binary  
0 1 0
operations , and  are defined .by the equations 0
 0 1 
(a, b)  (c, d )  (a  c, b  d ) and (a, b)  (c, d )  (ac  bd , bc  ad )
Decode the following words relative to a maximum likelihood
Prove that ( S ,,) is a field.
decoding function associated with eH : 01110,11101,00001, 11000 .
1 0 0 0 1 1 0
18.If ( G,*), is an abelian group,show that a * b   a n * b n , a, b  G .
n
 
0 1 0 0 1 0 1
15. Given the generator matrix G =  .corresponding UNIT – V
0 0 1 0 0 1 1
  PART-A
0 0 0 1 1 1 1  1. The maximum number of edges in a simple graph with n vertices is

to the encoding function eG : B 4  B 7 . find the corresponding parity a.) n(n-1)/2 b) n(n+1)/2 c) (n-1)(n+1)/2 d) n/2 Ans : a
check matrix and use it to decode the following received words and hence to
2. A closed directed path containing all the edges in a diagraph G is called an
find the original message 110 0001 , 1110111 , 0010001 , 0011100.
a.) Closed circuit b) Hamiltonian circuit
16. Let eG : B 2  B 6 . is an (2,6) encoding function defined as
c) Eulerian circuit d) Isomorphic circuit Ans : c
e(00) = 000000, e(01) = 011101 3. Sum of the degrees of all vertices of a group G is equal to
e(10) = 001110, e(11) = 111111 a)Thrice the number of edges b) Twice the number of edges
a) Find minimum distance. c) Number of edges d) Five times the number of the edges Ans : b
b) How many errors can e detect?
4. Any connected graph with n vertices and n-1 edges is
c) How many errors can e corrects?
a) Graph b) Closed graph c) Tree d) Spanning tree Ans : c
5. Two isomorphic graphs must have
(a) Same number of vertices (b) Un equal number of edges
(c) Unequal number of vertices (d) degrees of the verties are not equal
 SRM Institute of Science and Technology, VADAPALANI CAMPUS, Department of Mathematics

Ans: a

6. A graph is bipartite if and only if its chromatic number is ________.

a) 1 (b) 2 (c) Odd (d) Even Ans: b 5. Draw all the spanning trees of the graph G shown below.

7. The chromatic number of the chess board is ______.

a) 1 (b) 2 (c) 3 (d) 4 Ans: b

8. Hamilton cycle is a cycle that contains every ________of G

6. If G= (V,E) is an undirected graph with e edges ,prove that
a) Path (b) Cycle (c) Vertex d) Edge Ans: C  deg(Vi )  2e
i
7. Find the chromatic number of the graphs below.
9. An edge with identical ends is called _________.

a) Distinct (b) Loop (c) Direct d) Adjacent Ans: b

10. Graph G is 2-colourable iff G is Part-C

a) Bipartite (b) Simple (c) Complete (d) Trivial Ans: a 8. Prove that a tree with n vertices has n-1 edges,
9. Are the following graphs isomorphic? Justify your answer..
Part-B
1. State and prove Handshaking theorem
2. Give an example of a graph which contains
(i) An Eulerian circuit but not a Hamiltonian circuit
(ii) A Hamiltonian circuit but not an Eulerian circuit
10. Find the minimum spanning tree for the weighted graph using Krushkal's
3. Which of the following graph is a Hamiltonian graph? Give reason. algorithm.

4. Check whether the following graph is Eulerian and / or Hamiltonian Graph.

 SRM Institute of Science and Technology, VADAPALANI CAMPUS, Department of Mathematics

11. Find the minimum spanning tree for the weighted gaplL using Kruskal's
algorithm.

(ii) Write the adjacency matrix of the following graph:

12. Give step by step procedure of Knrskal's algorithm end hence use
spanning tree for the weighted graph shown below.

13. Prove that the number of edges in a bipartite graph with n vertices is
n2
atmost .
4
14. Determine whether the following graphs are isomorphic or not.

15. Prove that the maximum number of edges in a simple disconnected graph G
(n  k )( n  k  1)
with n vertices and k components is .
2
16. (i) Write the incident matrix of the following graph: