Vel Tech Rangarajan Dr.

Sagunthala R&D Institute of Science and

Technology
(Department of Mathematics)
10211CS101-DISCRETE MATHEMATICS
QUESTION BANK
PART –A UNIT-II

K1-Remember K2-Understand K3-Apply K4-Analyze K5-Evaluate K6-Create

S.NO PART-A (UNIT-II)- SETS AND RELATIONS CO K-LEVEL

1. Define LUB and GLB of a partially ordered set CO2 K1
2. Define POSET.
3. Define Equivalence relation with example CO2 K1
4. Draw the Hasse diagram of { A , ≤ }. where A={ 2 ,3 , 6 , 12 ,24 ,36 } CO2 K2
and the relation ≤ is defined as a ≤ b if a divides b.
5. The relation R on the set A={ 1 ,2 , 3 , 4 , 5 } is defined by the rule CO2 K2
( a , b ) ϵR ,if 3 divides a−b
(i) List the elements of R and R−1
(ii) Find the domain and range of R
(iii) Find the domain and range of R−1
(iv) List the elements of the complement of R .
6. State the Isotonic property of a Lattice. CO2 K1
7. Draw the Hasse diagram representing the partial ordering CO2 K2
{ ( a ,b ) : a∣b } on the set { 1 , 2, 3 , 4 ,5 , 6 , 7 , 8 }
8. Prove that the element 0 and 1 of Boolean algebra B are unique. CO2 K2
9. Differentiate Graph and Hasse diagram of a Poset with suitable CO2 K2
example.
10. Define distributive Lattice. Also state the relationship between CO2 K1
Chain and distributive Lattice.
11. Define Lattice Homomorphism. CO2 K1
12. State distributive lattice. CO2 K1
13. Define sub lattice. CO2 K1
14. Define lattice homomorphism. CO2 K1
15. When the lattice is called complete? CO2 K1
16. Give an example of a distributive lattice but not complete. CO2 K1
17. Define Boolean algebra. CO2 K1
18. State the De Morgan’s laws in Boolean algebra. CO2 K1
 PART-B UNIT-II

S.NO PART-B (UNIT-II) CO K-LEVEL

1. For any two sets A and B. Prove the following Identity CO2 K2
A−( A ∩B )= A−B .
2. If A={α,β}, B={1,2,3}. Find out CO2 K3
(AxB) U (BxA) and (AxB) ∩ (BxA)
3. If A={1,2,3,4} and P={{1,2},{3},{4}} is a partition of A. Find the CO2 K2
equivalence relation determined by P.
4. Let A=(6,12,18,24,36,72), a ≤ b if and only if a divides b. Draw CO2 K3
Hasse diagram for it and prove that it is a lattice, but not a
distributive lattice.
5. Draw the Hasse diagram for X={2,3,6,24,36,48} and relation ≤ be CO2 K3
such that x≤y, if x divides y.
6. Let A= {2, 4, 6, 8, 10, 12}, show that the relation ‘divides’ is a CO2 K2
partial ordering on A and draw Hasse diagram.
7. Define an equivalence relation? If R be a relation in the set of CO2 K2
integers Z defined by R = { (x , y ) : x є Z , y є Z , (x - y) is
divisible by 6 } .then prove that R is an equivalence relation ?
8. Let A be a given finite set and P(A) its power set. Let  be the CO2 K2
inclusion relation on the elements of P(A). Draw the Hass diagram
of ( P(A) ,  ) for
i) A = { a }
ii) ) A ={ a ,b}
iii) ) A = { a,b,c }
iv) A = { a,b,c,d }
9. Define a binary relation. Give an example. Let R be the relation CO2 K2
from the set A = {1, 3, 4} on itself and defined by R = { (1, 1), (1,
3), (3, 3), (4, 4)} the find the matrix of R ,draw the graph of R .
10. Prove that the relation R defined by “a is congruent to b modulo CO2 K3
m” on the set of integers is an equivalence relation.
11. If R denotes a relation on the set of all ordered pairs of positive CO2 K2
integers by (a,b)R(c,d) iff ad = bc ,show that ‘R’ is an equivalence
relation.
12. Let X= {1,2,3,4,5,} and relation R={(x,y)/x>y}.Draw the graph of CO2 K3
‘R’ and also give its matrix.
13. Draw the Hasse diagram representing the positive divisors of 36. CO2 K2
14. Show that the relation ‘R’ defined by (a,b) R (c,d) iff a+d = b+c is CO2 K3
 an equivalence relation.
15. If X= {1, 2, 3, 4} and R= {(x,y) }. If R is a relation on the set CO2 K3
A= {1, 2, 3, 4} defined by x R y if x exactly divides y. Prove that
(A,R) is a poset.
16. Let D24= {1,2,3,4,6,8,12,24} and the relation “ I “ exactly divides CO2 K3
be a partial ordering relation on D24.Then draw the Hasse Diagram
of (D24,I).
17. Give an example neither of relation which is symmetric but neither CO2 K2
reflexive nor anti symmetric nor transitive.
18. Consider the following relation R={(1,1),(1,2),(1,3),(1,4), (2,2),(2,3), CO2 K3
(2,4),(3,3),(3,4),(4,4)} defined over the set S={1,2,3,4} .
i) Is (S,R) is a Poset? Justify your answer.
ii) Is (S,R) Linearly ordered? Justify your answer.
iii) Is (S,R) Well-ordered? Justify your answer.
iv) Identify the minimal, maximal, greatest and least elements
v) Identify the lower bound and upper bound for the set {3} and also
find the least upper bound and greatest lower bound.

19. Let R1 and R2 be the “congruent modulo 3” and the “congruent modulo CO2 K3
4” relations, respectively, on the set of integers.
That is, R1 = {(a, b) | a ≡ b (mod 3)} and R2 = {(a, b) | a ≡ b (mod 4)}.
Find i) R1 U R2. ii) R1 ∩ R2. iii) R1 − R2. iv) R2 − R1.

20. Draw a Hasse diagram of ¿ X , ≤>¿, where X ={1 , 2 ,3 , 4 ,6 ,12 , 24 } CO2 K3

and R be a division relation . Find the Hasse diagram of the poset
¿ X , R>¿ .
21. Show that the least upper bound of a subset B in a poset¿ X , ≤>¿ is CO2 K2
unique if it exists.
22. Let A={a , b , c } and ρ( A) be its power set, draw a Hasse diagram of CO2 K2
¿ ρ ( A ) ,>¿
23. Show that the absorption laws are valid in a Boolean algebra. CO2 K2
24. In a lattice (L, ≤), prove that a ˄ ( a ۷ b )=a , ∀ a ,b ∈ L. CO2 K2
25. Prove that Every chain of Lattice is bounded CO2 K2
26. State and prove Isotonic property of Lattice. CO2 K3
27. State and prove Modular Inequality of lattice CO2 K3
28. Show that in a Boolean algebraa b ' + a' b=0 iff a=b. CO2 K3
29. Prove the Boolean identitya . b+ a . b' =a . CO2 K2
30. State and Prove the De Morgan’s laws of Boolean Algebra CO2 K3
31. State and Prove Idempotent and Dominance law of Boolean Algebra CO2 K3
32. What values of the Boolean variables x and y satisfy xy=x + y ? CO2 K3
 PART-A UNIT – III

K1-Remember K2-Understand K3-Apply K4-Analyze K5-Evaluate K6-Create

S.NO PART-A (UNIT-III) – FUNCTIONS AND RECURRENCE CO K-LEVEL

1. Define surjective function. CO3 K1
2. Let A={1 , 2, 3 , 4 } and B= { a ,b , c , d } and let CO3 K2
f ={ ( 1 , a ) , ( 2 , a ) , ( 3 , d ) , ( 4 ,c ) } . Show that f is a function but f −1 is not a
function.
3. Find g ₒ f ,let f and g be functions from positive integers to the positive CO3 K2
integers defined by f ( n )=n2 , g ( n )=2n .

()
4. 2 CO3 K2
Determine f ( 0 ) , f , f (−2) if the function f : R → R defined by
3

{
f ( x )= 3 x−4 , x> 0
−3 x +2 , x ≤ 0
Verify the function f ( x )=3 x−1 is bijective or not.
5. CO3 K2
6. Find f −1 (4 ) and f −1 (−4 ) if the function f : R → R defined by CO3 K2
2
f ( x )=x .
7. Define Pigeon hole principle? CO3 K1
8. State Generalized Pigeon hone principle? CO3 K1
9. Define sum rule and product rule? CO3 K1
10. State Pascal’s Identity? CO3 K1
11. State Vandermonde’s Identity? CO3 K1
12. State the conditions for permutation with repetition? CO3 K1
13. Show that 100 people atleast 9 of them were born in the same month? CO3 K2
14. Prove that in any group of six people, therer must be atleast 3 mutual CO3 K2
friends or atleast 3 mutual enemies
15. If we select 10 points in the interior of an equilateral triangle of side 1, CO3 K2
show that there must be atleast 2 points whose distance apart is less than
1/3
16. If we select any group of 1000 students on campus, show that atleast CO3 K2
three of them must have same birthday?
17. In how many ways can 6 person occupy 3 vacant seats? CO3 K2
18. Definition of Recurrence relation. CO3 K1
19. Let { A n } be a sequence that satisfies the recurrence relation CO3 K2
a n=a n−2+ an−1 for n=2 ,3 , 4 , … and suppose that a 0=3 , a1=5 ,what
are a 2,a 3?
n n CO3 K2
20. Let a n=2 + ( 5 ) (3 ) for n=0 , 1, 2 , … Find a 0 , a 1and a 2?
 PART B UNIT –III

S.NO PART-B (UNIT-III) CO K-

LEVEL
1. Determine the following functions is an one-to-one and onto (i) CO3 K3
f : R → R defined by f (x)=3 x 3 + x (ii) f : Z → Z defined by
2
f ( x)=x +14 x−51
2. 3 1 4 CO3 K3
If f , g , h : R → R are defined by f (x)=x −4 x , g (x)= 2 , h( x )=x
x +1
, find {(f ∘ g) ∘ h}(x ) and {f ∘(g ∘ h)}(x ) and check if they are equal.
3. If f , g : R → R where f (x)=ax +b , g (x)=1−x + x 2 and CO3 K3
2
( g ∘ f )( x)=9 x −9 x +3find the values of a and b
4. If S= { 1, 2 , 3 , 4 , 5 } and if the functions f , g , h :S → S are given by CO3 K3
f ={ ( 1 , 2 ) , ( 2 , 1 ) , ( 3 , 4 ) , ( 4 , 5 ) , ( 5 ,3 ) } g={ ( 1 , 3 ) , ( 2 , 5 ) , (3 , 1 ) , ( 4 , 2 ) , ( 5 , 4 ) }
h={(1 ,2),(2 ,2),(3 , 4),(4 , 3), (5 ,1)} (a) Verify whether f ∘ g=g ∘ f
(b) Explainwhy f and g have inverses but h does not (c)Find f −1 and
−1
g (d)Show that ¿
5. There are three files of identical red, blue and green balls, where CO3 K3
each files contains at least 10 balls. In how many ways can 10
balls be selected?
(1) If there is no restriction.
(2) If at least 1 red ball must be selected.
(3) If atleast 1 red, atleast 2 blue and atleast 3 green balls must be
selected.
(4) If atmost1red ball is selected
6. A factory makes custom sports cars at an increasing rate. In the CO3 K3
1stMonth only one car made, in the 2 nd month two cars are made,
and soon with n cars made in then 5thmonth.
(1)Setup the recurrence relation for the number of cars produced in
the first n month by this factory.
(2)How many cars are produced in the1styear?
7. From a club consisting of six men and seven women, in how many CO3 K3
ways we select a committee of
(1) 3 men and 4 women?
(2) 4 persons which has atleast one woman?
(3) 4persons that has atmost one man?
(4) 4 persons that has both sexes?
8. (i) In how many ways can all the letters in MATHEMATICAL be CO3 K3
arranged? (ii) Find the recurrence relation for the Fibonacci
 sequence.
9. Find the number of integers between 1 and 250 both inclusive that CO3 K3
are not divisible by any of the integers 2,3,5 and 7.
10. How many bit strings of length 10 contain (a)exactly four 1’s (b) CO3 K3
atmost four 1’s (c)at least four 1’s (d) an equal number of 0’s and 1’s.
11. From a club consisting of 6 men and 7 women, in how many ways CO3 K3
can we select a committee of (i) 3 men and 4 women (ii) 4 person
which has at least one woman (iii) 4 person that has at most one man
(iv) 4 person that has persons of both sexes (v)4 persons so that two
specific members are not included.
12. Solve the recurrence relation a n+2−6 an+1 +9 an=3(2n)+7 (3n ), n ≥ 0 CO3 K3
suchs that a 0=1 and a 1=4.
13. Use the method of generating function to solve the recurrence CO3 K3
relation a n=3 an−1 +1 ; n ≥1 given that a 0=1.
14. Use the method of generating function to solve the recurrence CO3 K3
relation 𝑎𝑛 = 4𝑎𝑛−1−4𝑎𝑛−2+4𝑛; 𝑛≥2 𝑔𝑖𝑣𝑒𝑛𝑡ℎ𝑎𝑡 𝑎0=2 𝑎𝑛𝑑 𝑎1=8.
15. Find all solutions of the recurrence relation 𝑎𝑛−2𝑎𝑛−1=2𝑛2, 𝑛≥1,
𝑎1=4.
CO3 K3

16. Using method of generating function to solve the recurrence relation CO3 K3
a n=3 an−1 +1 ;n≥1 given that a 0=1
17. 5+2 x CO3 K3
2
Identify the sequence having the expression 1−4 x as a Generating
function.
18. Using method of generating function to solve the recurrence relation CO3 K3
a =an−1 +a n−2 ;n≥2 given that
corresponding to Fibonacci sequence n
a 0=1, a 1=1