Discrete Mathematics Questions Bank

Short Questions
1. What is DeMorgan’s Law?
2. Explain existential quantifier with an example.
3. Solve the differential equation
4. Determine the value of n if:
5. Define cut edge, cut set, cut vertices in a graph with examples.
6. Apply laws of Algebra (Set Theory) to prove that (A – B) ∩ (B-A) = Φ
7. Show that “less than and equal to” is a partial ordering relation on set of
integers.
8. Interpret whether G is an abelian or not, where, G = {1, – 1, i, – i} with
the binary operation multiplication be an algebraic structure, and (i)2= -1.
9.
10.Find the minimum number of students required in a class to be sure that
at least 5 will receive the same grade if there are four possible grades A,
B, C, D?
11.Show that the number of odd degree vertices in any connected graph is

12.Interpret the truth value of the Boolean expression [(a ≤b) ∧ (b > c)],
always even.

where a=3, b=5, c=8.

13.Find the contra positive of “If an integer is multiple of 15, then it is
always divisible by 5 and 3”
14.Illustrate the difference between walk, path, and circuit.
15.Identify the number of ways in which 7 boys and 5 girls can be seated
together in a row so that no two girls are together?
16.Explain the Involution Law.
17.Let A= {4, 5, 6} and R= {(4, 4), (5, 5), (6, 6). Then what type of relation
is this.
18.In how many ways can a group of 10 girls appear for a photograph in a
row, if the leader of the group is to occupy the chair at the centre?
19.Particular solution of the equation is: ar- 2ar -1 + 4ar -2 = 7.
20.Let ring Z30 = {0, 1, 2, 3…... 29} of integer modulo 30. Then 7-1 will be.
21.A vertex which is having zero degree is called as.......... Explain it with
the help of suitable diagram.
22.A graph with all their vertexes is connected to each other is called
as........Explain it with the help of suitable diagram.
23.A commutative ring R is an……....… if R has no zero divisors.
24.Explain group in detail and its properties with the help of suitable
examples.
25.Explain biconditional statement with the help of suitable examples.
26.Determine the power set of set 1,2,  }.
27.Define multi-graph.
28.Draw Venn diagram for A  B’  C’.
29.Define existential quantifier with example.
30.How many lines can be drawn through 10 points in a circle?
31.Find particular solution of the difference equation:
32.State LaGrange’s theorem.
33.State binomial theorem.
34.Find the chromatic number of graphs.
35.Define ring  , ,.  R and give its example.
36.Define finite and infinite sets. Give examples of each.
37.Define the union and intersection of two sets. Provide an example for
each.
38.What is the Cartesian product of two sets? Give an example.
39.Explain the difference between a partial ordering relation and an
equivalence relation.
40.What are bijective functions? Provide an example.
41.How do you find the inverse of a function? Explain with an example.
42.What is the image of a set under a function? Illustrate with an example.
43.Define mathematical induction and provide a basic example.
44.What is Cantor's diagonal argument? What does it prove?
45.State and explain the Power Set Theorem.
46.Define an equivalence relation with an example.
47.Define a Complete Graph with the help of an illustration.
48.What is a Monoid?
49.Find out the number of ways that the letters of the word “DETAIL” can
be arranged such that the vowels must occupy odd positions.
50.Simplify the expression (x + y) (x + z) using the laws of Boolean
Algebra.
51.Let R be a binary relation on a set A. Prove that If R is reflexive, then R -1
(Power-1) is also reflexive.
52.Prove that if n is an odd integer, then n3+n is even.
53.How many functions are there from a set with three elements to a set with

54.Define g: Z -> Z by the rule g(n) =n2 for all n ∈ Z. Is g one-to-one? Prove
four elements?

or give a counter example.

55.How many permutations are there of {W, X, Y, Z}? Write them all.
56.Let f: R→R be defined by f(x) = x3+5. Show that f is one-to-one and
onto. Find a formula that defines the inverse function f--1.
57.Find the sum of first π natural numbers.
58.Prove that AUB = BUA
59.Determine the cardinality of the sets: P= {n 7: n is a positive integer} and
Q= {l, l, m, m, m, n, n}.
60.What are the steps to prove a formula using mathematical induction?
61.Find the particular solution of the difference equation: 2ar+1 −ar =12
62.What do you understand by a recurrence relation? Give example.
63.Define a normal subgroup and give its example.
64.True or False “The spanning tree of a graph is unique”. Justify your
answer.
Long Questions:
1. Among the 1000 positive integers: i) Determine the integers which are
not divisible by 5, nor by 7, nor by 9. ii) Determine the integers divisible
by 5, but not by 7, not by 9.
2. Let A = {1, 2, 3,4}. Determine whether the following relations are
reflexive, symmetric, transitive or anti symmetric: i) {(2, 2), (2, 3), (2, 4),
(3, 2), (3, 3), (3, 4)} ii) {(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (4, 4)} iii) {(2,
4), (4, 2)} iv) {(1, 2), (2, 3), (3, 4)}.
3. Construct the truth table for:
i) ((P→ q) → t) → ((p^~q) →t)).
ii) (p→ q) ^ (q→r) ^ p→r .
4. From the following formulae, find tautology, contingency and

contradiction:
5. Explain extended Pigeonhole principle.
6. Solve the differential equation: ar+6 ar -1+9 ar -2=3 with initial condition
a0 =1 and a1 =1.
7. Write short notes on:
i) COSET.
ii) RINGS.
iii) Integral domain.
iv) FIELD.

real numbers and * is a binary operation defined by a ∗ b=ab/4. Show

8. Consider an algebraic system (G, *), where G is the set of all non-zero

that (G, *) is an abelian group.

9. Prove a) Euler’s theorem for planer graph.
 b) Explain homomorphic and isomorphic graphs.
10.Solve the recurrence relation an - 6 a(n-1) +8a(n-2) =3n, where a0 =3 and a1=7.
11. Solve using Generating Functions a(r+2) – 5a(r+1) + 6ar = 2 with a0=1, a1=2.
12.Interpret whether the given relations are equivalence relations or not: R1=

13.Interpret the composition of [f ∘ (g ∘ h)] (x) for x = -1, when f(x) = x,

{(x, y): x is parallel to y}, R2= {(x, y): x is perpendicular to y}.

g(x) = 2x and h(x) = 3x.

(p→ (q ∨ r)), (q → p), (s → r), p concludes (p → s)

14.Utilize indirect method of proof to show that following argument is valid:

15.Utilize the principle of mathematical induction show that n 3+2n is

16.Find the equivalent disjunctive normal form of: i) p ∧ (q ↔ p) ii) p → ((p

divisible by 3.

→ q) ∧ (q v p))
17.Identify the percentage of population that reads neither of these papers? If
in a population of 25000, 13000 read “TOI”, 10500 read “Hindustan

18.Find the Conjunctive Normal Form of: i) (q v (p ∧ r)) ∧ ((p v r) ∧ q) ii)

Times”, and 3500 read both the two papers.

(p v q) ↔ (p ∧ q)
19.Explain what you understand by binary trees? Supplement your answer
with an application of binary trees and find: i) The no. of pendant vertices
in a binary tree. ii) The minimum height of a binary tree.
20.Show that R= {0,1,2,3,4} is a commutative Ring w.r.t (*)5 and (+)5.
21.Show that a graph with n vertices, (n-1) edges, and no circuits is
connected. Also justify the statement that “A graph is a tree if and only if
it is minimally connected”.
22.Interpret the order for each element of G; G= {a, a 2, a3, a4, a5, a6=e}. Is
this group cyclic? If yes, who is the generator?
23.Explain Partial order relation and let A= {1, 2, 3, 4} then show whether
the relation (x, y) belongs to R, if x>=y defined on the sets of positive
integers is a partial order relation.
24.Define Multiset. Discuss various operations that can be performed on
Multisets. How a Multiset can be different from normal set. Explain with
examples.
25.Explain all types of compound statement in detail with the help of
suitable examples and by truth table show that p ^ (q v r) Ξ (p ^ q) v (p
^r).
26.Explain Tautologies and Contradictions in detail and also explain their
difference with the help of suitable examples in detail.
27.How many permutations can be made out of the letter of word
“COMPUTER”? How many of these i) Begin with C ii) End with R iii)
Begin with C and end with R.
28.A committee of 6 is to be selected from 4 teachers, 5 boys and 6 girls.
Find the number of ways in which this can be done, so that at least one
boy and at least one girl are in the committee.
29.Solve the following recurrence relation for r>=2 a r– a(r-1)-6a(r-2) = -30, a0 =
20, a1 = -5.
30.Find the particular solution of ar – 2a(r-1) + a(r-2) = 4.
31.Let Ring Z10 = {0, 1, 2, 3…., 9} of integer modulo 10. Then find. i) Find
units of Z10 ii) find -3, -8 iii) Find inverse of 3 and 9 iv) find roots of the
eq: 2x2 + 4x + 4.
32.Explain and compare monoid and sub-monoid in detail and its properties
with the help of suitable examples.
33.Explain Dijkstra’s algorithm and find the shortest path between a and z
using Dijkstra’s algorithm for the following graph.

34.Find the minimum spanning tree using Kruskal’s algorithm for the

following graph.
35.Consider the function f, g : R →R defined by: f(x) = x 2 + 3x + 1, g(x) =
2x – 3 find the composition function ‘gof’ and ‘fog’.
36.Among the first 500 positive integers: i) Determine the integers which are
not divisible by 2, nor by 3, nor by 5. ii) Determine the integers which are
exactly divisible by one of them.
37.Prove by truth table:

38.From the following formulae find tautology, contingency and

contradiction:
(a) (P & ~P) v (Q & ~Q)
(b) ~ (P v ~~Q) & (P & ~Q)
(c) (P ← → Q) v (Q ← → P)
(d) ~ [(P → Q) → R]
(e) [P → (Q → R)] & (P → R)
(f) (P & Q) → (P → Q)
(g) ~P → P
(h) ~P → (Q v P)
(i) ~P & ~(~P v ~Q)
(j) P v (Q → P)
(k) (P ← → Q) & [(~P v ~Q) & P]
39.Prove by mathematical induction 1+ 2+ 3+4……n = n(n+1)/2
40.In a box, there are 6 balls of which 3 are white and three are black. They
are drawn successively. i)Without replacement ii) With replacement.
What is the chance that color is alternate?
41.Solve the differential equation: ar + 4ar-1 + 4ar-2 = r2 – 3r +5.
42.Solve the recurrence relation ar+2 – 3ar-1 +2ar=0, by the method of
generating functions with the initial conditions a0 2 and a1 3.
43.Consider an algebraic system (Q, *), where Q is the set of rational
numbers and * is a binary operation defined by: a*b = a + b-ab,  a, b
Q. Determine whether (Q, +) is a group.
44.Write Dijkstra's algorithm to find shortest path in a graph and find
shortest path from v1 to v6 in following graph:
45.State and explain the pigeonhole principle. In a class of 40 students, it is
known that each student has at least one of the following three hobbies:
reading, painting, or playing a musical instrument. Prove that at least 14
students share the same hobby using the pigeonhole principle.
46.Consider a graph with vertices V= {A, B, C, D, E} and edges E= {(A, B),
(B, C), (C, D), (D, E), (E, A)}}. Draw the graph and determine its degree
sequence.
47.Explain the concept of Eulerian paths in graphs. Determine whether the
graph in Part A has a Eulerian path. Justify your answer.
48.Explain the concept of Eulerian and Hamiltonian paths. Using the graph
from Part A, determine whether it contains an Eulerian path or a
Hamiltonian path. Justify your answer based on the definitions and
properties of these paths.
49.Prove that if f:X→Y and g: Y→Z be two one–to-one onto function, then
gof is also one-to-one function.
50.Let A = {1,2,3,4} and R= {(2,1), (2,3), (3,2), (4,3)}. Find the transitive
closure of R using Warshall’s algorithm

52.Prove that the following is a tautology a∨∼(b∧c) ↔(a∨∼b) ∨∼c.

51.Prove [(p→q) Λ (q→r)] →(p→r) is a tautology.

53.Prove by Mathematical induction: 1/1.3 + 1/3.5 + 1/5.7+……+1/(2n-1)

(2n+1) =n/(2n+1).
54.In a group of students, there are 6 boys and 4 girls. Out of 10 students, 4
students have to be selected. Find out how many different ways the
students can be selected such that at least one boy should be selected?
55.Solve the recurrence equation by method of generating function:
ar−7ar−1+10ar−2=3r, r≥2 with initial conditions a0 =0, a1 =1.
56.Consider the set Q of rational numbers, and let * be the operation on Q
defined by: a*b = a + b − ab a) Find: i) 3 * 4 ii) 2 * (−5) iii) 7 * (1/2). b)
Is (Q, *) a semigroup? Is it commutative? c) Find the identity element for
*. d) Does any of the elements in Q have an inverse? If yes, list them.
57.Discuss the following with example each: a) Hamiltonian graphs. b)
Isomorphic graphs. c) Euler’s formula. d) Four-color theorem. e)
Bipartite graphs.
58.If R = {(1,2), (1,3), (2,3), (2,4), (3,1)} and S = {(2,1), (3,1), (3,2), (4,2)}

59.Determine whether the relation R= {(a, b) ∈R, a−b≤1 on the set +ve
are relations on A = {1,2,3,4}. Find R∪S, R∩S, SoR, R−1

Integers} is: i) Reflexive ii) Symmetric iv) Antisymmetric v) a partial

60.Prove the following is a tautology a∨∼(b∧c) ↔(a∨∼b) ∨∼c

order relation.

61.Construct the truth table for (h→i∧ j) → (h→i)

62.Determine the value of n if: i) ii) 20Cn+2 =20C2n−1 nCn−2 =10.
63.Prove by mathematical induction that the sum of the cubes of three
consecutive integers is divisible by 9.
64.Solve the recurrence relation ar+2−2ar+1+ar=2r by the method of generating
functions with the initial conditions a0 =2 and a1 =1.
65.Define the following terms with an example: a) Semigroup. b) Abelian
group. c) Ring. d) Integral domain. e) Closure Property.
66.Draw the minimum spanning tree of the following graph.

67.State and Prove Euler’s formula for Planar Graphs.