DM QUESTION BANK

1. Define Cantor’s diagonal argument?

2. Explain and prove Schroeder Bernstein theorem.
3. Write short note:
(a) Define sets and types of sets.
(b) Define relation and types of relation.
(c) Define functions and types of functions.
(d) State and prove Demorgan’s law.
4. Let f be a function from set integers such that f ( x )=x 3−2. Is f invertible and if it is then
what is its inverse.
5. State and prove Division algorithm law.
2 2 2 2 n ( n+1 ) ( 2 n+1 )
6. Show that 1 +2 +3 +… … … … … … … …+ n =
6
7. Show that following implication is tautology:
(a) ( p → q ) ∨r →[ ( p ∨ r ) → ( q ∨ r ) ]
(b) ( p ∧q → r ) ∨ ( p →r ) ∨ ( q → r )
8. Find the validity of the following argument:
“If my friend does not come to meet me, then I will go to office”.
“If I go to office, then I will complete my work”.
Using rule of inference, can we complete, “ if I am not happy. Then I will complete
my work”?
9. Show that the following implication is tautology, contradiction or contingency:
(a) ( p → q ¿ ∨r ↔[ ( p ∨ r ) → ( q ∨ r ) ]
(b) ( p ∧q → r ¿ ↔( p→ r )∨(q →r )
10. Find the validity of the following argument:
If I study then I will not fail in mathematics, if I do not play football then I will study,
But I failed in mathematics. Therefore, I must have played football.
11. What are quantifiers? Give examples.
12. Prove using contraposition: if (3n+7) is an odd integer, then ‘n’ is an even integer.
13. Translate these statements into English, where C(x) is “ x is a comedian” and F(x) is
“ x is funny” and the domain consist of all people.
(i) ∀ x (C ( x ) → F ( x ) )
(ii) ∃x¿
Negate the above statements and express in predicate logic as well as English.
14. Explain disjunctive normal form (D.N.F.) and conjunctive normal form (C.N.F.).

15. Show that p ∨(q ∧r ) and ( p ∨q)∧( p∨ r ) are logically equivalent. This is the
distributive law of disjunction over conjunction.
 DM QUESTION BANK
16. Explain and write properties of Rule of Inference for propositional logic.

2022
1. (1.5*10)
(a) If A={1 , 2, 3 }, B={3 , 4 } and C={4 , 5 , 6 }, determines the A ×(B ∪ C ).
(b) Find the number of ways that a party of seven persons can arrange themselves
around a circular table.
(c) In how many ways can a committee consisting of three man and two women be
chosen from seven men and five women?
(d) Describe the proof by contradiction.
(e) Define Normal subgroup.
(f) Differentiate between the graph and tree.
(g) State the well ordering principle.
(h) Prove that sum of degree of all vertices in a graph is equal to twice the number of
edges in graph.
(i) Describe the articulation points by giving suitable example.
(j) What is isomorphism of graph?
2.
(a) What are quantifiers? Explain the use of quantifiers by giving suitable examples.
(5)
(b) Define composition of function. If f and g be the function from the set of integers
defined by f ( x )=2 x +3 and g ( x )=3 x+ 2. Determine the following
(i) fog
(ii) gof (5)
(c) let f be the function from {a , b , c , d } to {1 , 2 ,3 , 4 } with f ( a )=4, f ( b )=2, f ( c ) =1
and f ( d )=3. Investigate the function f to be bijective. (5)
3.
(a) State the Pigeon hole principle. Find the minimum number of students in a class to
be sure that three of them are born in the same month. (5)
(b) State and prove the Schroeder-Bernstein theorem. (10)
4.
(a) What is conjunctive normal form. Obtain the Conjunctive normal form (CNF) of
the given Boolean function (6)
'
f ( x , y , z )=( x+ z)( x + y ).
(b) What do you mean by the graph coloring and chromatic number of the graph?
Determine the chromatic number of the following graph. (9)
 DM QUESTION BANK
5.
(a) If R is a relation on the set of positive integers I such that (a ,b)∈ R if only if
a−b ≤ 1. Determine whether the relation R is (8)
(i) Reflexive
(ii) Symmetric
(iii) Transitive
(iv) Antisymmetric
(v) A partial order relation
(vi) An equivalence relation
(b) Write the properties of group in algebraic structure. Prove that the set I of all
integers is a group with respect to the operation of addition of integers. (7)
6.
(a) Explain the Eulerian and Hamiltonian Walks by giving a suitable example. (5)
(b) Write the Euclidean algorithm for greatest common divisor? By applying the
Euclidean algorithm, compute the greatest common divisor (GCD) of 210 and 45.
(5)
(c) Define propositions and its connectives. Show that the ( p ∨ q) is logically
equivalent to (∼ p)∧(∼q ). (5)
7. Write short note on following (3*5)
(a) Weighted trees and prefix codes
(b) Integral domain and fields
(c) Rules of inference

2019
1. (1.5*10)
(a) For any A and B, show that
( A ∩ B ) ∪ ( A−B )= A .
(b) Define equivalence relation with example.
(c) How many 11 letter words can be formed using letters from the word
“INSTITUTION”?
2 2 2 2 n ( n+1 ) ( 2n+1 )
(d) Show that 1 +2 +3 +… … … …+ n = .
6
(e) What is bipartite graph?
(f) Define Euler formula.
(g) What is a cut point and bridge in graphs?
(h) What are quantifiers in propositions?
(i) What are bijective functions?
(j) List the applications of trees.

2.
(a) Let f be a function from the set of integers such that f ( x )=x +1. Is f invertible,
and if it is what is its inverse? (5)
(b) Seven woman and nine men are on faculty in the mathematics department in a
university. In how many ways a committee of five members of the department can
 DM QUESTION BANK
be constructed if at least one woman and atleast one man must be in the
committee? (5)
(c) Define Cantor’s Diagonal Argument. (5)
3.
(a) Show that following implication is tautology: (10)
(i) ( p → q ¿ ∨r ↔[ ( p ∨ r ) → ( q ∨ r ) ]
(ii) ( p ∧q → r ¿ ↔( p→ r )∨(q →r )
(b) Find the validity of the following Argument: (5)
Either Ram is a good boy or Rahul is a good boy.
Ram is not a good boy therefore Rahul is a good boy.
4.
(a) Determine the In-order, preorder and post-order Traversal of the following tree:(6)

(b) Write short notes on following: (9)

(i) CNF
(ii) Hamiltonian Graph
(iii) Subgroups in algebraic structures.
5.
(a) Find the shortest distance between A to Z: (10)

(b) What is a chromatic number in a graph? Determine the chromatic number for the
following graph: (5)
 DM QUESTION BANK

6.
(a) Explain and prove Schroeder Bernstein theorem. (10)
(b) What is a Perfect Graph? Explain with example. (5)
7.
(a) What is integral domain? Explain with example. (5)
(b) Consider an algebraic system (Q, *) where Q is a set of rational numbers and * is
binary operation defined by
a∗b=a+ b−ab
Determine whether (Q, *) is a group. (10)

2020
1. (1.5*10 = 15)
(a) State and Prove Demorgan's Law.
(b) What are quantifiers? Give Example.
(c) Define multisets and various operations on them.
(d) Define Cut point and Bridge in Graphs.
(e) Define Circular permutation.
(f) Let A={1 , 2, 3 , 4 ,5 , 6 , 7 , 8 , 9 } and let R be the relation on A × A defined as
( a , b ) R(c , d ) if a+ d=b+ c . Prove that R is an equivalence relation.
(g) What is Perfect Graph? Explain with example.
(h) Let f be a function from A to B, where A = B = set of real numbers R and
2 a−1
f ( a )= . Find f −1.
3
(i) In the different permutations of the word ‘EXAMINATION’ are listed as in a
dictionary. How many items are there in the list before the first word starting with
E.
(j) What are bijective functions? Explain with example.
2.
(a) Among 100 Students, 32 study Mathematics, 20 study Physics, 45 study Biology,
15 study Mathematics and Physics, 10 study Physics and Biology and 30 do not
study any of the three subjects. (6)
(i) Find the number of students studying all three subjects.
(ii) Find the number of students studying exactly one of the three subjects.
 DM QUESTION BANK
(b) Use mathematical induction to show that
2 n n
1+2+2 +… … … …+ 2 =2 −1 .
For all non-negative integers n. (5)
(c) Define Cantor’s Diagonal Argument. (4)
3.
(a) Show that the following implication is tautology, contradiction or contingency:
(i) ( p → q ¿ ∨r ↔[ ( p ∨ r ) → ( q ∨ r ) ]
(ii) ( p ∧q → r ¿ ↔( p→ r )∨(q →r ) (10)
(b) Find the validity of the following argument:
If I study then I will not fail in mathematics, if I do not play football then I will
study, But I failed in mathematics. Therefore, I must have played football. (5)
4. Explain the following (with proper Example):
(i) Bipartite graph
(ii) Euler formula
(iii) Partial Order Relation (15)
5.
(a) Construct the binary tree for following traversals of a tree:
Preorder : a b d e h c f g I j
Inorder : d b h e a f c i j g (5)
(b) Explain and prove Schroeder Bernstein theorem. (10)
6.
(a) Consider an algebraic system (G, *), where G is the set of all non-zero real
numbers and * is a binary operation defined by
ab
a∗b=
4
Show that (G, *) is an abelian group. (10)
(b) What is Field in algebraic systems? Explain with example. (5)
7.
(a) Find the shortest distance between A to Z using Dijkstra algorithm stepwise: (10)

(b) Draw the Minimum Spanning tree for following graph: (5)
DM QUESTION BANK