Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Discrete Mathematics QB

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

DISCRETE MATHEMATICS

QUESTION BANK

1. Define partially ordered set.


2. What are the properties and types of Relations?.
3. Define Bijection function with an example.
4. Let f: R → R and g: R → R where R is the set of real numbers find [fog ](x )
and [gof ¿( x) , if f(x) = x2 + 3 and g(x) = x+4.
5. Let f: R→ R and g: R → R where R is the set of real numbers find [fog ](x ) ,
if f(x) = x2 – 2 and g(x) = x+4.
6. What is characteristic function with an example?
7. Define Hamilton path and cycle
8. State the Pigeonhole principle.
9. Define Complete graph with an example.
10.Write the generating function for the sequence 1,a,a2,a3…..
11.The matrices of the relations R and S are given by

( ) ( )
1 0 1 0 1 1
MR = 0 1 1 and MS= 1 1 0 .
0 0 0 0 1 0

Find the matrices of the relations R∩S ,RUS ,S∘ R ,R-1 and RC.

12.Consider X ={1 , 2 ,3 , 4,612 }.The relation { ( a ,b ) , a∣b } . Find LUB and GLB of
{ 1 , 3 } ,{ 2 , 3 } ,{ 4 , 6 },{ 1 , 2, 3 } ,{ 2 , 4 , 12 } ,{ 1 , 3 ,6 , 12 }
13.Let f : R → Rand g : R → R ,where R is the ser of all real numbers.
The function is given by f ( x )=x +1 , g ( x ) =x2 +1.
fog , gof , fof , gog , ( fog ) ( 2 )∧(fof )(4)
14.Let Z+ ¿¿ denote the set of all positive integers and Z denote the set of
integrs.Let f : Z +¿→ Z ¿ defined the set set of integers.Let f : Z +¿→ Z ¿ be defined
by

{
n
, if n is even
2 -1
f(n)= 1−n is Injective and Surjective on R. Also find f .
, if n is odd
2
15.Let A and B be sets. Using characteristic function, Show that for all
χ ( A∪B )( x)= χ A ( x)+ χ B ( x)− χ A∩B ( x )
x−2
f (x )=
16.P.T f : R−{3} →R−{1} given by x−3 is a bijection and find f-1

17.Let A,B,C be any three non-empty sets. Let f : A→B and g : B→ C be


mappings. If f and g are onto, then prove that ( gOf ¿ : A → C is onto. Also
give an example to show that gOf may be onto but both f and g may be onto
but both f and g need not be onto.
18.Show that 1 2 + 2 2 + 3 2 + 4 2 + ……… + n 2 = [n (n+1) (2n +1)] / 6, n≥ 1 by
mathematical Induction.
19.Solve the recurrence relation y n +2−5 y n+1 +6 y n=5 n with the initial conditions
y 0=0∧ y 1=2.

20.By mathematical induction ,1+2+3+4+………………….


21.Let A= {1,2,3,4,5,6} and P1 = (3,6,2) and P2 = (5,1,4) be permutations of A.

(i) Compute P1 ₒ P2 and write the result as a product of cycles and as the

product of transpositions.

(ii) Is P1 and P2 an even or odd permutations? Explain.

(iii) Prove that (P2 ₒ P1)-1 = P1-1ₒ P2-1 .

22.Prove that a graph without parallel edges or self-loop with “n “nodes and “k”
components can have at most (n-k) (n-k+1) edges.

2
23. Show that the following graphs are isomorphic.

V4 V3

B D V1 V2

You might also like