Regulation: R-20

P.B.R. VISVODAYA INSTITUTE OF TECHNOLOGY & SCIENCE

(Approved by AICTE, New Delhi and Affiliated to JNTUA, Anantapur)
KAVALI – 524201, S.P.S.R Nellore Dist., A.P. India. Ph: 08626-

DEPARTMENT OF COMPUTER SCIENCE 243930

AND ENGINEERING CSE – IOT, AI&ML

DISCRETE MATHEMATICS AND GRAPH THEORY (DM&GT)

QUESTION BANK
S.NO CO CODE COURSE OUTCOME
1 CO1 Apply mathematical logic to solve problems.

2 CO2 Understand the concepts and perform the operations related to sets, relations
and functions. Gain the conceptual background needed and identify structures
of algebraic nature.
3 CO3 Apply basic counting techniques to solve combinatorial problems.

4 CO4 Formulate problems and solve recurrence relations.

5 CO5 Apply Graph Theory in solving computer science problems.

UNIT-1 MATHEMATICAL LOGIC

1. Using the antecedent and consequent rules , show that SR is tautologically implied by
(PQ) (PR) (QS). [CO1,K3]

2. Obtain Principal conjunctive normal form and Principal Disjunctive normal form of the
formula S is given by (‫ך‬PR) (QP). [CO1,K2]

3. A) Show that an implication is logically equivalent to its contrapositive. [CO1,K2]

B) Show that (‫ך‬PQ) (P‫ ך‬Q) is a tautology. [CO1,K2]

4. A) Prove that r( pq) is a valid conclusion from the set of premises
pq, qr, pm, ‫ך‬m. [CO1,K3]
B) Explain Rules of Inference. [CO1,K3]

5. A) Show that RS can be derived from the premises P(QS), ‫ך‬RP and Q. [CO1,K2]
B) Explain the term tautology? Show that [(p→q)→r]→[(p→q)→(p→r)] is tautology ?
[CO1,K3]
6. A) Derive the following using CP rule if necessary P →(Q→R) , Q → (R→S ) ⇒ P→( Q→ S)
[CO1,K2]
B) State the inverse for the statement “If a triangle is not isosceles, then it is not equilateral”.
[CO1,K2]
 Regulation: R-20

SHORT ANSWER QUESTIONS (2 MARKS) .

1. Define Tautology and Contradiction [CO1,K1]

2. Construct the truth table for the compound statement( pq)  ‫ך‬q [CO1,K3]
3. What is a well formed formula? [CO1,K1]
4. Negate the following statements: (i) Ottawa is a small town.
(ii) Every city in Canada is clean. [CO1,K1]
5. Show that the propositions p → q and ¬𝑝q are logically equivalent.. [CO1,K2]
[CO1,K1]

UNIT-1 MULTIPLE CHOICE QUESTIONS(MCQ)

1) The disjunction of two statements P and Q is given by [ A ]

a) P v Q b) P ˄ Q c) P → Q d) P ↔ Q

2) The conjunction of two statements P and Q is given by [ B ]

a) P v Q b) P ˄ Q c) P → Q d) P ↔ Q

3) Which one of the following is a proposition [ C ]

a) What a beautiful day! b) come in
c) The earth is flat d) what is my line?

4) Which one of the following is not a proposition [ D ]

a) Socrates was a great philosopher b) Canada is a country
c) Moscow is the capital of Spain d) This statement is false

5) Let p: mark is rich, q: mark is happy. The symbolic form of the statement [ C ]
“ mark is neither rich nor happy” is
a) ~p˄ q b) p v ~q c) ~p v ~q d) ~p ˄ ~q

6) A compound statement that is always false is called [ B ]

a) tautology b) contradiction c) contingency d) none of these

7) The contra positive of p → q is [ C ]

a) q→p b) ~p → ~q c) ~q →~p d) none of these

8) Which one of the following statement is true [ D ]

a) The empty set is sub set of every set b) The empty set is unique
c) Every set is a sub set of itself d) All of these

9) Which one of the following is not an alphabet [ A ]

a){0,1} b) {a,b} c) {a,b,c} d) {a,b,c,ab,bc}

10) Which one of the following is false [ D ]

a) A  B = B  A b) A ∩ B = B∩ A c) A- B = B-A d) A  B = B  A

11) Which one of the following is partition of the set {a,b,c,d,e} [ D ]

a) {{a,b},{b,c},{d,e,f}} b) {{a,b},{c,d},{e,f}} c) {{a,b},{d,e,f}} d) None of these

12) A set with four elements has [ C ]

a) 4 sub sets b) 8 sub sets c) 16 sub sets d) None of these
 Regulation: R-20

13) Formula consists of “Sum of Products” [ C ]

a) PDNF b) PCNF c) DNF d) CNF

14) Formula consists of “Product of Sums ” [ D ]

a) PDNF b) PCNF c) DNF d) CNF

15) Let f(x)=2x+3 and g(x)=x2-1 then fog(2) is [ D ]

a) 21 b) 31 c) 11 d) None of these

16) Let f(x,y)=2x+3y-6xy then f(-2,3) is [ B ]

a) 31 b) 41 c) -41 d) None of these

17) Let f(x)=2x+3 and g(x)=x2 ,then g  f(x) is [ D ]

a) 2x2 +4 b) x2+3 c) 2x2+3 d) (2x+3) 2

18) The symbol of Universal Quantifier is [ A ]

a)  b)  c) v d) ˄

19) The symbol of Existential Quantifier is [ B ]

a)  b)  c) v d) ˄

20) In Duality, symbol ˄ is replaced by the symbol [ C ]

a)  b)  c) v d) ˄
 Regulation: R-20

UNIT-2 SET THEORY

1. Draw the Hasse diagram representing the partial ordering {(a, b)/ a divides b } on
{1,2,3,4,6,8,12} (or ) (D12, /) [CO2,K4]

2. A) State and prove pigeonhole principle. [CO2,K3]

B) If A = {,} and B = {1, 2, 3}. What are AB, BA, AA, BB an (AB) (BA). [CO2,K2]

3. A) State generalized Principle of Inclusion – Exclusion. How many bit strings of length 8
either starts with a 1 bit or ends with the 2 bits 0 0 ? [CO2,K3]
B) Let f(x) = x+2, g(x) =x-2, h(x) = 3x for xR. Where R is the set of Real numbers.
Find gof, fog, fof, gog, foh, hog, hof, fohog. [CO2,K3]

4. A) State and prove distributive inequalities of lattice. [CO2,K3]

B) Let R be the relation on the set of all ordered pairs of positive integers by (a,b)R(c,d) iff
ad = bc. Show that R is an equivalence relation. [CO2,K2]

5. A) Prove that G= {-1,1,i,-i} is an abelian group under multiplication. [CO2,K4]

B) Show that every chain is distributive lattice. [CO2,K3]

6. A) State and prove Generalised pigeonhole principle. [CO2,K3]

𝑎∗𝑏a∗c
B) If (L, ) be a lattice and a,b,cL, then show that bc  { [CO2,K2]
𝑎 𝑏  a  𝑐

SHORT ANSWER QUESTIONS (2 MARKS) .

1. If f: ZZZ is defined by f(x,y) = 2x+3y-6xy, compute f(-2,3) and f(-3,-5). [CO2,K1]

2. Define an equivalence relation. [CO2,K1]

3. Let A = {a,b,c}. Draw the Hasse Diagram for (p(A), ), where p(A) is the power set
of A. [CO2,K4]

4. Define lattice with example. [CO2,K1]

5. Define Group with an example. [CO2,K1]

UNIT-2 MULTIPLE CHOICE QUESTIONS(MCQ)

1) Partial ordering on a sets are represented by [ A ]
a) Hasse diagrams b) Equivalence relations
c) Venn diagrams d) Graphs of relations

2) If the characteristic function is primitive recursive, then the relation R is Said to be

a) Equivalence relation b) primitive recursive
c) compatibility relation d) invertible relation [ C ]
 Regulation: R-20

3) A function is called Bijective if is [ C ]

a) one-one only b) onto only c) ono-one and onto d) None of these

4) Let A ={2,3,5} and B={2,3,4,6,7} .A relation R from A to B is defined as

R={(a,b)/a is factor of b}, then Range of R is
a) { 2,3 } b) {2,3,4,6,7} c) {2,3,4,6} d) {3,4,6,7} [ A ]

5) Which one of the following is not a semi group

a) The set Z with binary operation of subtraction
b) The set N with binary operation of addition
c) The set N with binary operation of multiplication d) None of these [ A ]

6) The simplest algebraic structure is

a) group b) monoid c) semigroup d) abelian group [ C ]

7) Which one of the following relation on A={x,y,z} is Reflexive

a){(x,x),(y,y),(y,z),(z,y) b) {(x,x),(z,z),(y,z),(z,y)}
c){(x,x),(x,y),(y,y),(z,z) d) None [ D ]

8) Which one of the following relation on A={a,b,c} is not transitive

a) {(a,b),(b,c),(a,c)} b) {(a,a),(a,b),(a,c),(b,a),(b,c)} [ C ]
c) {(a,a),(b,b),(c,c)} d) {(a,b)}

9) Which one of the following relation on A={a,b,c} is both symmetric and anti-symmetric
a){(a,a),(b,b),(c,c)} b) {(a,b)} c) {(a,a),(a,c),(c,a),(b,c)} d ){(a,b),(b,a)} [ D ]

10) A group (G,*) in which the operation * is commutative is called

a) cyclic group b) normal group c) abelian group d) none of these [ C ]

11) Algebraic system (S,*) is called a semi-group if the binary operation * is

a) Commutative b) associative c) identity d) inverse [ B ]

12) The Power set of A is denoted by [ B ]

a) n(a) b) P(a) c) Q(a) d) R(a)

13) A null set is denoted by

a) v b) ˄ c) ϕ d) π [ C ]

14) A Relation is said to be equivalence relation if it is [ D ]

a) Reflexive b) Symmetric c) Transitive d) All the above

15) The number of elements of group is called

a) degree of group b) order of group c) complexity of group d) none of these [ B ]

16) For Boolean expression in n variables, there are ------- min terms [ C ]
a) 2n b) n+2 c) 2n d) n-2

17) If a set does not contain any elements, then it is called as [ B ]

a) Power set b) Null set c) Universal set d) Subset
 Regulation: R-20

18) Which one of the following is a group [ A ]

a) The set Z with binary operation of multiplication
b) The set R with binary operation of multiplication
c) The set Z+ with binary operation of addition
d) The set Q with binary operation of addition

19) If A ∩ B = ∅ then A and B are called [ D ]

a) Power set b) Null set c) Universal set d) Disjoint sets

20) If every element on A is on element of B then A is ----------- of B [ C ]

a) Power set b) Null set c) Subset d) Universal set
 Regulation: R-20

UNIT-3 ELEMENTARY COMBINATORICS

1. A) A multiple choice test has 15 questions and 4 choices for each answer. How many
ways the 15 questions be answer so that (i) Exactly 3 answers are correct?
(ii) at least 3 answers are correct. [CO3,K4]
B) Enumerate the number of non-negative integral solutions to the inequality
x1+x2+x3+x4+x5  19 [CO3,K3]

2. A) State the Multinomial theorem. What is the coefficient of x3y7 in (2x-9y)10 [CO3,K3]
B) Find the number of distinguishable permutations of the letters in the following work. [CO3,K3]
(i) BASIC (II) STRUCTURES ( III) ENGINEERING (IV) MATHEMATICS

3. A) In how many ways 23 different books be given to 5 students so that 2 of the

students will have 4 books each and the other 3 will have 5 books each. [CO3,K4]
12 13 25
B) What is the coefficient of x y in the expansion (2x-3y) [CO3,K3]

4. A) In how many ways can you select atleast one king, if you choose 5 cards from a
deck of 52 cards. [CO3,K4]
B) Determine the coefficient of xyz in the expansion of (2x-y-z)
2 4
[CO3,K3]

5. Consider the word “TALLAHASSEE” then how many arrangements are there
(i) all A’s together
(ii) where no two letters A appear together.
(iii) Where the letters ‘S’ are together and the letters ‘E’ are together.
(iv) 4 of letters taken from “TALLAHASSEE”. [CO3,K4]

6. A) State Binomial theorem. Find the expansion (x + y) 4. [CO3,K3]

B) Find the term which contains x11 and y4 in the expansion of (2x3-3xy2+z2)6 [CO3,K3]

SHORT ANSWER QUESTIONS (2 MARKS) .

1. Find the number of five permutations of a set with 9 elements. [CO3,K3]

2. How many different outcomes are possible by tossing 10 similar coins [CO3,K4]

3. How many different strings can be made from the letters “ABRACAPABRA”
[CO3,K4]

4. State sum rule and product rule of counting. [CO3,K1]

5. In how many ways can five children arrange themselves in a ring. [CO3,K4]
 Regulation: R-20

UNIT-3 MULTIPLE CHOICE QUESTION’S (MCQ)

1.The remainder when -43 is divided by 16 is

a) -11 b) 5 c) 11 d) -5 [ b ]

2. GCD {20,8} is
a) 16 b) 4 c) 8 d) 24 [ b ]

3.The value of base b in 1001ь=126 is

a) 2 b) 3 c) 4 d) 5 [ d ]

4. 15036 in hexadecimal system is

a) 4ABC b) 3ABC c) 3BAC d) 2ABC [ b ]

5. Which one of the following is not a triangular number

a) 3 b) 5 c) 6 d) 10 [ b ]

6. Co-efficient of x5 in the expansion of (1+x2)5 (1+x)4 is

(a) 40 (b) 50 (c) 30 (d) 60 [ d ]

7. In how many ways can the letters of the word 'LEADER' be arranged?
a)72 b)144 c) 360 d) 720 [ c ]

8. From a group of 7 men and 6 women, five persons are to be selected to form a committee so that
at least 3 men are there on the committee. In how many ways can it be done?
a) 564 b) 645 c)735 d) 756 [ d ]

9.How many 3-digit numbers can be formed from the digits 2, 3, 5, 6, 7 and 9, which are divisible by
5 and none of the digits is repeated?
a) 5 b) 10 c) 15 d) 20 [ d ]

10. A box contains 2 white balls, 3 black balls and 4 red balls. In how many ways
can 3 balls be drawn from the box, if at least one black ball is to be included in the draw?
a)32 b)48 c)64 d)96 [ c ]

11.Total number of bytes is

a) 128 b) 256 c) 64 d) none of these [ b ]

12. Number of ternary words of length n that can be formed is

a) 3n b) n+3 c) 3ⁿ d) n³ [ c ]

13. Number of words that can be formed by scrambling letter in the word computer is

a) 7! b) 8! c) 4! d) 9! [ b ]

14.If p(n,2)=42 then value of n is

a) 6 b) 5 c) 8 d) 7 [ d ]
 Regulation: R-20

15.Number of ways 7 boys and 3 girls can be seated in a row if the girls sit together at one
end of the row is
a) 60,480 b) 40,320 c) 30,240 d) 36,28,800 [ a ]

16.Number of ways a committee of five can be formed from a group of 5 boys and 4 girls,
if each committee must contain at least two girls is
a) 95 b) 105 c) 605 d) 405 [ b ]

17.Number of distinct words that can be formed by scrambling the letters in the word
KAVALI is
a) 360 b) 720 c) 5040 d) 2520 [ a ]

18.Coefficient of x²y⁶ in the expansion of (2x+y)⁸ is

a) 14 b) 28 c) 56 d) 112 [ d ]

19.Middle term in the binomial expansion (x+1/x)⁴ is

a) 12 b) 6 c) 6x² d) 12x² [ b ]

20. Largest binomial coefficient in the expansion of (x+y)⁷

a) 20 b) 21 c) 35 d) 56 [ c ]

UNIT-4 RECURRENCE RELATIONS

1. A) Find the first five terms of the sequence defined by a n =6an-1, a0=2 [CO4,K3]
B) Solve the recurrence relation 2 an -3 an-1 = 0, n1, a4 =8 [CO4,K3]

2. A) Determine the coefficient of x12 in x3(1-2x)10 [CO4,K3]

B) What is the solution of the recurrence realtion an = an-1 +2 an-2 with a0 = 2 and a1 = 7.
[CO4,K3]
3. Find the solution to the recurrence relation a n = 6an - 1 – 11an - 2 +6an - 3 with the intial conditions
a0 =2, a1=5, a2 =15. [CO4,K3]

4. Solve the recurrence relation an = 5an - 1 - 6 an -2 + 7n [CO4,K3]

5. A) Solve the recurrence relation an = an – 1+ n, where a0 = 2 by substation. [CO4,K3]

B) Solve the recurrence relation an + 5an-1 + 5 an-2 = 0 and a0 = 0 , a1= 2√5 using the
characteristic roots. [CO4,K3]

6. A) Find the generating function of the following sequence

(i) 0, 1, -2 ,3 , -4…….. (ii) 0, 2, 6, 12, 20, 30, 42,…… [CO4,K3]
B) Solve the recurrence relation an + 2 -4 an + 1 + 3an = -200, n0 and a0 =3000, a1=3300.
 Regulation: R-20
[CO4,K3]

SHORT ANSWER QUESTIONS (2 MARKS) .

1. Explain general solution and particular solution of recurrence relation. [CO4,K3]

2. Differentiate homogeneous recurrence relation with non-homogeneous recurrence

relations. [CO4,K2]

3. Solve the recurrence relation an+1 =4an given that a0=3. [CO4,K3]

4. Find the generating function for the sequence 1, 1, 0, 1, 1,…….. [CO4,K3]

5. Discuss the applications of generating functions. [CO4,K2]

MULTIPLE CHOICE QUESTION’S (MCQ)

1.Find the Sequence of generating form 2x2 (1-x)-1

a) 1,1,0,0, 0.. b) 0,0,2,2,2.. c) 2,2,2,1,1.. d) 0,0,0,0,0.. [ b ]

2.The general formula for nth term of a sequence is called as

a) Recurrence Relation b) Generating function c) Sequence d) none of these [ a ]

3.The Distinct Roots of the equation are

a) 1,1 b) 2+3i c) 2-3i d) 2,3 [ d ]

4. The Repeated Roots of the equation are

a) 1,1 b) 2+3i c) 2-3i d) 2,3 [ a ]

5. The Complex Roots of the equation are

a) 1,1 b) 2+3i c) 2,3 d)None of these [ b ]

6. The Recurrence Relation is also called as

a) Generating function b) Recurrence Relation c) Difference equation d) None [ c ]

7. The Roots of the equation r2 - r - 6 = 0 is

a) 1,1 b) -2,3 c) -2,-3 d) -1,-1 [ b ]

8. The Roots of the equation r2 - 6r + 9 = 0 is

a) 1,1 b) 2,2 c) 3,3 d) 4,4 [ c ]

9. The Generating function for the sequence {2,6,18,54,162…..} is [ a ]

a) 2/(1-3x) b) 1/(1-3x) c) 2/(1+3x) d)1/(1+3x)
 Regulation: R-20

10 The Generating function for the sequence {1,1,1,1,1,…..} is [ c ]

a) 2/(1-x) b) 1/(1+x) c) 1/(1-x) d) 2/(1+x)

11. The characteristic equation of Fibonacci recurrence relation is

a) x²+x+1=0 b) x²-x+1=0 c) x²-x-1=0 d) x²+x-1=0 [ c ]

12. Determine the value of a2 for the recurrence relation an = 17an-1 + 30n with a0=3.
a) 4387 b) 5484 c) 238 d) 1437 [ d ]

13.Consider the recurrence relation a1=4, an=5n+an-1. The value of a64 is _________
a) 10399 b) 23760 c) 75100 d) 53700 [ a ]

14. What is the solution to the recurrence relation an=5an-1+6an-2?

a) 2n2 b) 6n c) (3/2)n d) n!*3 [ b ]

15. What is the recurrence relation for 1, 7, 31, 127, 499 ?

a) bn+1=5bn-1+3 b) bn=4bn+7! c) bn=4bn-1+3 d) bn=bn-1+1 [ c ]

16. Find the value of a4 for the recurrence relation an=2an-1+3, with a0=6.
a) 320 b) 221 c) 141 d) 65 [ c ]

17.The order of recurrence relation an=an-1+2an-2+3an-6 is [ d ]

a) 3 b) 4 c) 5 d) 6

18.Which one of the following recurrence relation is a LHRRWCC

a) an=an-1+2an-2+3an-5 b) an=an-1+n c) an=a²n-1+3an-2 d) an=n an-1 [ a ]

19.Which one of the following recurrence relation is not homogeneous

a)an=a²n-1+3an-2 b) an=2an-1 c) an=an-1+n d) an=n an-1 [ c ]

20.The generating function for the sequence of n ones is

a) 1/1-x b) 1/1+x c) xⁿ-1/x-1 d) xⁿ+1/x+1 [ c ]
 Regulation: R-20

UNIT-5 GRAPHS

1. A) Define graph Isomorphism. Explain Isomorphism of two graphs with suitable examples.
[CO5,K4]
B) Draw the binary tree for the sequence of numbers {2,1,5,6,8,9,7,3,4} [CO5,K4]

2. A) Define (i) Directed graph (ii) undirected graph (iii) Bipartite graph
(iv) complete Bipartite graph (v) complete graph. [CO5,K1]
B) Prove that the chromatic number of a planar graph is no greater than 4. [CO5,K3]

3. Explain DFS algorithm with an example. [CO5,K3]

4. Explain BFS algorithm with an example. [CO5, K3]

5. Explain the kruskal’s & prim’s algorithm with an example. [CO5, K3]

6. A) Find how many edges in a graph in which having the 10 vertices and each vertex having
the degree 10. [CO5, K3]
B) What is the chromatic number of the following (i)Cn (ii)Kn, (iii)Km,n (iv) Tree with n
vertices. [CO5, K3]

SHORT ANSWER QUESTIONS (2 MARKS) .

1. Define Euler path and Euler circuit. [CO5,K1]

2. Define spanning tree with an example. [CO5,K1]

3. Define Multi graph with example [CO5,K1]

4. Define planar Graphs with example. [CO5,K1]

5. Define Hamiltonian Graph. Give an example. [CO5,K1]

 Regulation: R-20

UNIT-5 MULTIPLE CHOICE QUESTION’S(MCQ)

1. A simple graph with an edge between every two distinct vertices is called
a) regular graph b) cycle graph c) complete graph d) wheel graph [ c ]

2. Number of edges in complete graph k₇ is

a) 21 b) 7 c) 14 d) 35 [ a ]

3. Number of edges in the bipartite graph Km,n is

a) m+n b) mn c) mⁿ d) m-n [ b ]

4. Number of edges of a graph that has exactly five vertices with degrees 1,1,1,1,and 4 is
a) 8 b) 7 c) 5 d) 4 [ d ]

5. A wheel graph w₄ has edges

a) 4 b) 8 c) 10 d) none of these [ b ]

6. The degree of Isolated vertex is

a) 0 b) 1 c) 2 d) none of these [ a ]

7. The sum of the degrees in a graph is always

a) an odd integer b) a prime integer c) an even integer d) none of these [ c ]

8. In two isomorphic graphs G₁ and G₂

a) both G₁ and G₂ have same number of vertices [ d ]
b) both G₁ and G₂ have same number of edges
c) the corresponding vertices in G₁ and G₂ have the same degree d) all of these

9. A closed path with no repeated edges is called

a) cycle b) wheel c) circuit d) none of these [ c ]

10. A path in a connected graph that contains every edge exactly once is called
a) Hamiltonian path b) Eulerian path c) Petersen path d) none [ b ]

11.A connected, planar graph contains 24 edges. It divides the plane into 13 regions.
Number of vertices in the graph is
a) 24 b) 13 c) 26 d) 11 [ b ]

12. The chromatic number of the complete graph Kn is

a) n+1 b) n c) n-1 d) 2n [ b ]

13. The chromatic number of Km,n is

a) m+n b) m-n c) mn d) 2 [ d ]

14) The chromatic number of Cn if n is even is

a) 3 b) 2 c) 1 d) none of these [ b ]

15.A simple graph in which every vertex has the same degree is called [ c ]
 Regulation: R-20
a) Complete graph b) connected graph c) regular graph d) none of these

16. Number edges of a tree with 8 vertices is

a) 8 b) 7 c) 6 d) none of these [ b ]

17.Sum of degrees of all vertices of tree with 8 vertices is

a) 8 b) 14 c) 16 d) none of these [ b ]

18.Number of edges in a spanning tree of graph k₈ is

a) 8 b) 7 c) 6 d) none of these [ b ]

19. Number of distinct spanning trees of graph is called

a) Chromatic number of a graph b) complexity of a graph
c) Degree of a graph d) none of these [ b ]

20. Which one of the following statement is false about DFS method? [ c ]
a) It is used to find a spanning tree is a connected graph
b) It is also called backtracking
c) In this method vertices are visited level by level until all are visited
d) None of these