Scribd
Upload
14 views2 pages

CS4101

bit deoghar

Uploaded by

hat7410580
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
14 views2 pages

CS4101

bit deoghar

Uploaded by

hat7410580
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

BIRLA INSTITUTE OF TECHNOLOGY, MESRA, RANCHI

(SHORT SEMESTER EXAMINATION)


CLASS: BE SEMESTER : SS/16
BRANCH: CSE SESSION : 2015-16

SUBJECT: CS4101 DISCRETE MATHEMATICAL STRUCTURES


TIME: FULL MARKS: 100

INSTRUCTIONS:
1. The question paper contains 7 questions each of 20 marks and total 140 marks.
2. Candidates may attempt any 5 questions maximum of 100 marks.
3. The missing data, if any, may be assumed suitably.
4. Before attempting the question paper, be sure that you have got the correct question paper.
5. Tables/Data hand book/Graph paper etc. to be supplied to the candidates in the examination hall.
----------------------------------------------------------------------------------------------------------------------------------

Q.1(a) Construct the truth table of ~ q  ~ p    p  q  . [4]


Q.1(b) Use mathematical induction to show that 2  1 is divisible by 3 for all n  1. [6]
2n

Q.1(c) Obtain the principal conjunctive and disjunctive normal forms of the formula S given by: [10]
S  (~ p  r )  ( q  p )

Q.2(a) What is the truth value of the quantification xP (x ) if: [4]
(i) P ( x ) : ( x  1)( x  2) is an even integer
(ii) P ( x ) : ( x  1)  x
Q.2(b) Prove that if n is positive integer, then n is odd iff 5n + 6 is odd. [6]
Q.2(c) 1 1 1 1 n [10]
   ......  
n.n  1 n  1
Prove that using Mathematical Induction.
1.2 2.3 3.4

Q.3(a) Let A = {2, 8, 14, 18}. Define a relation R on A such that xRy iff x-y > 3. [4]
Draw the diagraph of R and give M R .
Q.3(b) Let R  {(1,1), (1,2), (1,3), (1,4), ( 2,1), ( 2,2), ( 2,3), ( 2,4), (3,1), (3,2), (3.3), (3,4), ( 4,2)} be a relation [6]
on the set X  {1,2,3,4}. Find M R and M R 2 . From this, determine whether R is transitive or
not.
Q.3(c) 1 0 0 1 [10]
0 1 1 0
Find the transitive closure of M R  
0 1 1 0
 
1 0 0 1

Q.4(a) Consider the relation R on A  4,5,6,7defined by: [4]


R  {( 4,5), (5,5), (5,6), (5,7), (6,7 ), (7,4), (7,7 )}
Find the symmetric closure of R.
Q.4(b) Define partially ordered relation. Let P(A) be the collection of all subsets of set A. Show that the [6]
relation  of set inclusion is a partial ordered relation on P(A). Hence draw the Hasse diagram.
Q.4(c) Determine whether the relation R on the set A is reflexive, irreflexive, symmetric, asymmetric, [10]
antisymmetric or transitive
A  Z ; aRb if and only if a  b

Q.5(a) Draw the undirected graph whose incidence matrix is given below: [4]
0 1 0 0 1
0 1 1 0 1
MI  
0 0 0 1 0
 
1 0 0 0 0
between the vertex set a, b, c, d , eto the edge set e1 , e2 , e3 , e4 , e5 , e6 .
PTO
Q.5(b) If a graph G of n vertices is isomorphic to its complement, then prove that n must be a multiple [6]
of 4.
Q.5(c) Find the Shortest path between the vertex a and b in the following weighted graph. [10]

Q.6(a) Define rooted tree with example. [4]


Q.6(b) Draw a binary tree whose post order search produces string SEARCHING. [6]
Q.6(c) Find the minimal spanning tree using suitable algorithm in the following graph. [10]

Q.7(a) Prove cancellation laws in a Group. [4]


Q.7(b) Prove that in a group if every element is its own inverse, then the group is abelian. [6]
Q.7(c)
Prove that if (G1 ,1 ) and (G1 ,1 ) are groups, then G  G1  G2 i.e. (G ,) is also s group with binary
operation  defined as:

(a1 , b1 ) * ((a 2 , b2 )  (a1 1 a 2 , a 2 2 b2 )

:::::20.06.2016:::::

You might also like