Scribd
Upload
207 views2 pages

Final Assessment Test - November 2016: Course: Class NBR(S) : Slot: Time: Three Hours Max. Marks: 100

This document provides instructions for a final assessment test in discrete mathematics and graph theory. It lists 7 questions to choose 5 from for the exam, which is worth a total of 100 marks. The questions cover topics such as logic, Boolean algebra, graph theory concepts like trees and chromatic polynomials, and discrete structures like lattices. Students are instructed to answer any 5 of the 7 questions, with each question worth 20 marks.

Uploaded by

Joese
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
207 views2 pages

Final Assessment Test - November 2016: Course: Class NBR(S) : Slot: Time: Three Hours Max. Marks: 100

This document provides instructions for a final assessment test in discrete mathematics and graph theory. It lists 7 questions to choose 5 from for the exam, which is worth a total of 100 marks. The questions cover topics such as logic, Boolean algebra, graph theory concepts like trees and chromatic polynomials, and discrete structures like lattices. Students are instructed to answer any 5 of the 7 questions, with each question worth 20 marks.

Uploaded by

Joese
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Final Assessment Test - November 2016

Course: MAT1014 - Discrete Mathematics and Graph Theory


Class NBR(s):3574 / 3582 /3596 / 3611 / 3622 / 3627 Slot: A1+TA1+TAA1
Time: Three Hours Max. Marks: 100

Answer any FIVE Questions


(5 X 20 = 100 Marks)
1. a) Verify whether the conclusion logically follows from the given arguments. [10]
“If you send me an e-mail message, then I will finish writing the program.” “If you do not send me
an e-mail message, then I will go to sleep early.” “If I go to sleep early, then I will wake up feeling
refreshed.” Leads to the conclusion, “If I do not finish writing the program, then I will wake up
feeling refreshed.”
b) Obtain the principal disjunctive and conjunctive normal forms of the following statement: [10]
( P  Q )  ( P  R )  ( Q  R )
2. a) Consider the following (2,3) encoding function e : B 2  B 5 defined by [10]
e(00)  00000 
e(10)  00111 
 Code words.
e(01)  01110 
e(11)  11111 
(i) How many errors will e detect atmost?
(ii) How many errors will e correct atmost?
(iii) Verify whether the given set of code words is a group code.
b) Let  G  S3  { f1 , f 2 , f3 , f 4 , f5 , f6 },   where S3 be the set of permutations of S  {1, 2,3} . [10]

(i) Verify whether (G , ) is a symmetric group.


(ii) If H  { f1 , f5 } is a subset of G, then verify whether ( H , ) is a subgroup of G. If so
compute all the distinct left cosets of H in G.
(iii) Check whether H is a normal subgroup.
3. a) Prove that every chain is a distributive lattice and verify whether the converse is true. [10]
b) Consider X  2, 4,5,10,12, 20, 25,50 and let for a, b  X , “ a  b ” be the relation ‘ a divides b’ [10]
on X then
(i) Prove that X is a Poset.
(ii) Draw the Hasse diagram of ( X , ) .
(iii) Check whether ( X , ) is a lattice.
4. a) (i) Suppose G is a simple graph in which every vertex is of degree 3 and e = 2n-3, where e and n [10]
denotes number of edges and number of vertices of G respectively. Find the value of n.
(ii) Let G be a graph with n vertices and e edges. If t vertices are of degree m and the remaining
( )
vertices are of degree p then prove that the number of edges is .

b) Let  (G ) be the number of components of G, then prove that the number of edges of a simple [10]
( n   )( n    1)
graph with  components cannot exceed .
2

Page 1 of 2
5. a) Define fundamental circuit. Also find all the fundamental circuits with respect to the mentioned [7]
spanning tree in the following graph.

b) Prove that every tree has either one centre or two centres. [10]
c) Prove that the number of pendant vertices in a binary tree with 'n' vertices is . [3]

6. a) Find the chromatic polynomial and chromatic number for the following graphs. [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) Verify the validity of the inferences. [10]


“If one person is successful than another, then he has worked harder to deserve success.”
“John has not worked harder than Peter.”
Therefore, “John is not successful than Peter.”
b) Show that in a Boolean algebra [10]
(i) a  0 if and only if ( a  b)  ( a   b )  b
(ii) ( a  b)  (b  c )  (c  a )  ( a   b )  (b  c )  (c   a )



Page 2 of 2

You might also like