MODEL CAT 1 QUESTION PAPER

DEPARTMENT OF MATHEMATICS
SCHOOL OF ADVANCED SCIENCES
Fall Semester – 2018 ~ 2019
Continuous Assessment Test – I, January - 2019
Course Code : MAT1014 Slot : A1+TA1
Course Name : Discrete Mathematics and Graph Theory Date : 20/01/2019
Faculty Name: Dr. D. Ezhilmaran
Max. Marks : 50 Duration : 90 Minutes
---------------------------------------------------------------------------------------------------------------------------------------
ANSWER ALL QUESTIONS
(5 x 10 marks = 50 marks)
1 Test the consistency of the following Statements. [10]
i. If Jack studies well he will pass in exams.
ii. If Jack studies well he will get a job.
iii. Succeeding in exam and getting a job simultaneously are not possible for him.
iv. Jack either enjoys or studies well.
v. Finally, Jack enjoys.
2 Obtain the PCNF and PDNF of the following formula and hence conclude whether it is a [10]
tautology  P   Q  R     P   Q  R  
3 (i) Symbolize the arguments and check the validity? [6+4]
Every person likes ice cream.
Billy is a person.
Therefore, Billy likes ice cream.
(ii) What is the negation of the following statements?
(a) Some subsets of N have 5 elements.
(b) All people like ice cream.
4 Show that from [10]
(a) (x)( F ( x)  S ( x))  ( y)( M ( y)  W ( y))
(b) (y)( M ( y)  W ( y))
the conclusion ( x)( F ( x)  S ( x)) .
5 (i) Prove that the set of idempotent elements of a commutative monoid M ,  forms a [4+6]
submonoid.
(ii) Show that the set Q of all positive rational numbers forms an abelian group under the
1
operation  defined by a  b   a.b  ; a, b  Q 
2
 MODEL CAT 2 QUESTION PAPER
Winter Semester 2018-19

Continuous Assessment Test – II

Programme Name & Branch: B. Tech.

Course Name & Code: Discrete Mathematics and Graph theory-MAT1014

Slot: A2

Exam Duration: 90 minutes Maximum Marks: 50

Answer All the Questions (5 × 10 = 50)

1. a. Show that in a group (G,*), if for any a, b in G, (a*b)2=a2*b2, then (G,*) must be abelian. (5)

b. Let a and b be non-identity elements of different orders in a group of order 155. Prove that the
only subgroup of G that contains both a and b is G itself. (5)

2. a. Devise a single error correcting group code (2,5) with parity bits x3=x1, x4=x2 and x5=x1+x2. Find
its parity check matrix, generator matrix, group code and decoding table. Correct the single error in
the received word 10001 using decoding table. (6)

b. If x ≤ y and z ≤ w, then prove that x ∧ z ≤ y ∧ w and x ∨ z ≤ y ∨ w. (4)

3. a. Prove that (S30, D), S30 the set of divisors of 30, is a Poset. Draw its Hasse diagram. Find LUB and
GLB of every pair of elements and hence show that (S30, D) is a lattice. (4)

b. In any Boolean Algebra, show that (6)

(i) 𝑎 = 𝑏 ⟺ 𝑎𝑏 ′ + 𝑎′ 𝑏 = 0

(ii) (𝑎 + 𝑏)(𝑎′ + 𝑐) = 𝑎𝑐 + 𝑎′𝑏 = 𝑎𝑐 + 𝑎′ 𝑏 + 𝑏𝑐.

4. a. Let 𝑆 = {1,2,3}. Prove that (𝑃(𝑆), ∪, ∩ ,′ ), 𝑃(𝑆) 𝑡ℎ𝑒 𝑝𝑜𝑤𝑒𝑟 𝑠𝑒𝑡 𝑜𝑓 𝑆, is a Boolean algebra.
List all sub-Boolean algebra of the Boolean algebra. (5)
b. Expand 𝑓(𝑥, 𝑦, 𝑧) = 𝑥 ∗ 𝑦 + 𝑦 ∗ 𝑧′ into its sum of products canonical form (5)

5. a. Show that in a lattice with two or more elements, no element is its own complement. (4)
b. Reduce the Boolean function (6)
𝑓(𝑎, 𝑏, 𝑐, 𝑑) = 𝑎′ 𝑏 ′ 𝑐 ′ 𝑑′ + 𝑎′ 𝑏 ′ 𝑐𝑑 ′ + 𝑎𝑏 ′ 𝑐 ′ 𝑑′ + 𝑎𝑏𝑐𝑑 by using Karnaugh map.
 MODEL FAT QUESTION PAPERS
Final Assessment Test (FAT) – May 2017
Course: MAT1014 - Discrete Mathematics and Graph Theory
Class NBR(s):4419 / 4422 / 5327 Slot: A1+TA1+TAA1
Time: Three Hours Max. Marks: 100

Answer any FIVE Questions

(5 X 20 = 100 Marks)
1. a) Obtain the pdnf and pcnf of the following formula and hence conclude whether it is a tautology [10]
( P  (Q  R ))  (P  (Q  R ))
b) Test the consistency of the following Statements. [10]
i. If Jack studies well he will pass in exams.
ii. If Jack studies well he will get a job.
iii. Succeeding in exam and getting a job simultaneously are not possible for him.
iv. Jack either enjoys or studies well.
v. Finally, Jack enjoys.
2. a) Show that the conclusion ( x) ( F ( x)  S ( x)) follows from [10]
(i) ( x ) ( F ( x )  S ( x))  ( y ) ( M ( y )  W ( y )) and
(ii) (y ) ( M ( y )  W ( y ))
b) Show that [10]
(i)  ( P  Q )  (P  (P  Q ))  (P  Q )
(ii) ( P  Q )  (P  (P  Q ))  (P  Q )
3. a) (i) Prove that for any monoid M ,  , no two rows or columns of the composition table are identical. [4]

(ii) Establish the isomorphism between the following two algebraic systems:
[6]
I. F ,  where F  { f 0 , f 1 , f 2 , f 3 } with f  f 1  { 1,2 , 2,3 , 3,4 , 4,1 } and the
k k 1 0 4
composite functions are formed from the equation f  f  f , k  2 . Further, f  f
is the identity map.
II. Z 4 ,  4 , the algebraic system of equivalence classes generated by congruence modulo
4 under addition modulo 4.
b) State and prove Lagrange’s theorem. [10]
4. a) What is the condition for a code to correct 'k' or fewer errors. Generate a single error correcting code [10]
with m = 4 and n = 7.
b) Obtain the Hasse diagrams of the lattices S n , D when n  30, 45 . Which of these are [10]
complemented? Are these lattices distributive? Explain.
5. a) (i) State and prove the isotonicity property of a lattice 〈 , ≤〉. [5]
(ii) Obtain the simplified Boolean expression which is equivalent to the expression m0  m1  m 2  m3 [5]

b) Obtain the Karnaugh map for the Boolean function f  x1  [ x 2  ( x 3  x 4 )] . [10]

n ( n  1)
6. a) (i) Prove that any simple graph with n vertices has at most edges. [5]
2
(ii) Prove that the graph K 5 is nonplanar. [5]

Page 1 of 2
 b) Determine all the fundamental circuits and fundamental cut-sets of the following graph with respect [10]
to the spanning tree shown by thick lines. Also find its vertex connectivity.

d
a h
b g
e
c k
f

7. a) Find the chromatic polynomial of the graph given below. [10]

b) Determine a shortest spanning tree for the following graph using Kruskal’s algorithm. Can we modify [10]
the algorithm to generate a Hamiltonian path.



Page 2 of 2
 Final Assessment Test (FAT) – May 2017
Course : MAT1014 - Discrete Mathematics and Graph Theory
Class NBR(s):4425 / 4427 / 4429 Slot: A2+TA2+TAA2
Time: Three Hours Max. Marks: 100

Answer any FIVE Questions

(5 X 20 = 100 Marks)
1. a) Obtain the principal conjunctive normal form of the formula S given by (~ → )⋀( ⟷ ) and [10]
hence obtain Principal disjunctive normal form of S.
b) Show that the following sets of premises are inconsistent [4+4
(i) → ( → ), → ( ∧∼ ), ∧ . +2]
(ii) → , → , →∼ ,
Hence show that → ( → ), → ( ∧∼ ), ∧ ⇒
2. a) Prove that ( ) ( )→ ( )∧ ( ) , (∃ )( ( )) ⇒ ( ) ∧ (∃ )( ( ) ∧ ( )). [8]

b) Show that the set of all the invertible elements of a monoid form a group under the same [6]
operation as that of the monoid.
c) Let ( ,∗) be a given semigroup. Prove that there exists a homomorphism : ⟶ , where [6]
( ,∘) is a semi group of functions from S to S under left composition.
3. a) Show that if every element in a group is its own inverse, then the group must be abelian. [4]
b) Prove that the order of a subgroup of a finite group divides the order of the group. [10]
c) Let R be the set of real numbers in [0,1] and '≤' be the usual "less than or equal to" in R. Show that [6]
(R,≤) is a lattice. What are the operations of meet and join on this lattice?
4. a) Prove that every chain is a distributive lattice. [6]
b) ʹ ʹ [10]
Show that in a complemented distributive lattice ≤ ⇔ ∗ =0⇔ ⊕ = 1 ⇔ ʹ ≤ ʹ.
c) In any Boolean Algebra, show that ≤ ⇒ + = ( + ). [4]
5. a) Show that a mapping from one Boolean algebra to another which preserves the operations [6]
⊕ ʹ also preserves the operation ∗.
b) Show that the Boolean expression [4]
ʹ ʹ
ʹ ʹ ʹ ʹ
∗ ⊕ ∗ ⊕ ∗ = ∗ ∗ ʹ

c) Prove that a connected graph G is Euler if and only if all vertices of G is even. [10]
6. a) Prove that a tree with n vertices has n-1 edges. [10]
b) Prove that every circuit has even number of edges in common with any cut-set. [10]
7. a) Prove that a tree with two or more vertices is 2-chromatic. [6]
b) Prove that the chromatic polynomial of a complete graph with n vertices is [8]
( ) = ( − 1)( − 2) … ( − + 1)
c) Show that if a bipartite graph has any circuits, they must all be of even length. [6]


 Final Assessment Test (FAT) – May 2017
Course: MAT1014 - Discrete Mathematics and Graph Theory
Class NBR(s):4431 / 4434 /4436 / 4439 / 4444 / 4448 / 4934 Slot: C1+TC1+TCC1
Time: Three Hours Max. Marks: 100

Answer any FIVE Questions

(5 X 20 = 100 Marks)
1. a) If A works hard, then either B or C will enjoy themselves. [10]
If B enjoys himself, then A will not work hard.
If D enjoys himself, then C will not.
Therefore, if A works hard, then D will not enjoy himself.
Show that the above statements constitute a valid argument by using the Rule CP.
b) Obtain the PCNF of the statement S : ( P  Q )  (P  R ) . Using this obtain the PCNF of  S and [10]
hence the PDNF of S. Also determine the unique representation of the PCNF and PDNF.
2. a) (i) Prove that the set of idempotent elements of a commutative monoid  M ,  forms a submonoid. [10]
(ii) Show that the set Q  of all positive rational numbers forms an abelian group under the
1
operation  defined by a  b  a  b ; a, b  Q  .
2
b) Find the code generated by the given parity matrix ‘H’ when the encoding function is e : B3  B 6 [10]
 1 1 0 1 0 0
H   1 0 1 0 1 0 
0 1 1 0 0 1 
3. a) Let L,  be a lattice in which ,  denote the operations of meet and join respectively. For any [10]
a, b  L , prove that a  b  a  b  a  a  b  b .
b) Show that every chain is a distributive lattice. Also discuss about the converse of this statement with [10]
justification.
4. a) State and prove the necessary and sufficient conditions for a connected graph to be an Euler [8]
graph.
b) Obtain a graph G for the following adjacency matrix. [6]
0 1 0 1
0 0
1 0 0 1 
1 1

0 0 0 1
0 1
A(G )   .
1 1 0 0
0 1
0 1 1 1 0 1
 
0 1 1 0 1 0
Also find (I) the number of vertices in G.
(II) the number of edges in G.
(III) the degree of each vertex of G.
(IV) the number of loops in G and
(V) the number of components in G.
c) Let  (G ) be the number of components of G, then prove that the number of edges of a simple [6]
( n   )( n    1)
graph with  components cannot exceed .
2

Page 1 of 2
5. a) Use Kruskal’s and Prim’s algorithm to find a shortest path between vertices A to G in the following [10]
weighted network.

b) Prove that every tree is either unicentral or bicentral but not both. [10]
6. a) Find the chromatic polynomial and chromatic number for the following graph G. [10]
(i)

(ii)

b) Prove that a simple graph G on n vertices is a tree if and only if Pn ( )   (  1) ( n 1) [10]

7. a) (i) Use Karnaugh map to simplify the following Boolean expression [10]
wx y z  wx y z  wx y z wx y z  wx y z  wx y z  wx y z
(ii) Show that in a Boolean algebra ( a  b)  (b  c )  (c  a )  ( a   b )  (b  c )  (c   a ) .

b) Show that x P( x)  Q( x)   x  P( x)  x Q( x) by using the indirect method of proof. [10]



Page 2 of 2
 Final Assessment Test (FAT) – May 2017
Course: MAT1014 - Discrete Mathematics and Graph Theory
Class NBR(s):4449 / 4452 / 4457 / 4468 / 4471 / 4922 / 4929 Slot: C2+TC2+TCC2
Time: Three Hours Max. Marks: 100

Answer any FIVE Questions

(5 X 20 = 100 Marks)
1. a)  
Prove that P   Q  R    Q  R    P  R   R [5]

b) Without using truth table find the Principle conjunctive normal form and Principle disjunctive normal [10]

form of P   Q  P   P   Q  R  
c) Show that R   P  Q is a valid conclusion from the premises P  Q, Q  R , P  M and M . [5]

2. a) Let G denote the set of all matrices of the form where ∈ . Prove that G is a group under [8]
matrix multiplication.
b) State and prove Lagrange’s theorem for groups. [5]
c) Determine the group code (3, 6) using the parity check matrix H is given by [7]
1 1 0
⎡1 0 1⎤
⎢ ⎥
0 1 1⎥
H=⎢
⎢1 0 0⎥
⎢0 1 0⎥
⎣0 0 1⎦
3. a) Let  L ,   be a lattice in which  (meet) and  (join) denote the operations. Prove that for any [10]
a, b  L , a  b  a  b  a  a  b  b
b) S42 is the set of all divisors of 42 and D is the relation “divisor of” on S42 , prove that  S42 , D is a [5]
complemented lattice.
c) State and prove De-Morgan’s law for lattice. [5]
4. a) Obtain the product of sums canonical form in three variables of the Boolean expression x1  x 2 [5]

b) In any Boolean algebra prove that  a  b  b  c  c  a     a   b  b  c  c  a  [5]

c) Simplify the following Boolean function by using Quine- McCluskey method [10]
f  w, x , y , z   wxyz  wxyz  wxyz  wxyz  wxyz  wx yz  wxyz  wx yz
5. a) Prove or disprove the validity of the following argument (i) “All men are fallible” (ii) “all kings are men” [10]
The conclusion is “all kings are fallible”.
b) Using Dijkstra’s algorithm to find the shortest path from v1 to v7 [10]

Page 1 of 2
6. a) Explain the three kinds of tree traversal in graphs. Give examples. [10]
b) Find the minimum spanning tree of the following graph by using kruskal’s algorithm. [10]

7. a) (i) Define Bipartite graph. Give example. [4]

(ii) Define the Chromatic number and write the properties of Chromatic number. [8]
b) Define Chromatic Partitioning and the Chromatic Polynomial. [8]



Page 2 of 2