DISCRETE MATHEMATICS QUESTIONS:-

1. All defination with example.

2. Give an example of Equivalance Relation and explain it.
3. Difference between Equivalance Relation and Partial Relation.
4. Is symatric difference of three set associative?
5. Using ven-diagram prove de-morgan’s law?
6. Define partition of set?
7. Draw directed graph to represent given relation.
8. Define algebraic structure.
9. Prepare a composition table for a given set and a given binary
operation. With the help of composition table check
commutative law and closer property, also find out inverse(if
exit)identy (if exit).
10. Define group with an example?
11. Write down the necessary and sufficient condition for a semi
group which forms a group?
12. Prove that identity element of a group is unique?
13. The inverse of any element of a sub groub is the same as the
inverse of the same regarded as an element of the group?
14. State and prove the necessary and sufficient condition for a
non-empty sub set H of a group (G,0) to be a sub group?
15. Define index of a sub group with an example.
16. Write down the property of coset?
17. Define normal sub group with an example?
18. Prove that intersection of two normal sub group in G is normal
in G .
19. Define cyclic group?
20. Prove that every cyclic group is an abelian group.
21. Define Ring and give an example?
22. What is Mapping? Types and example?
23. State the difference between some rule and product rule.
Discuss with an example.
24. Did use the number of permutation of n different things taken
at a time are<=n.
25. If NP2=72, Find the value of n.
26. Prove that the number of ways in which n distinct object can be
arranged so that to particular objects are never together.
27. Find the number of ways in which n things may be arranged
among them selves taking all of them at a time. When P things are
alive of one kind and q of them alive of a second kind and r of then
alive of a third kind and rest of them are different.
28. Discuss circular permulation.
29. What is the difference between permulation and
communication discuss with example.
30. Prove ncr+ncr-1=n+1cr(0<=r<=n).
31. There are 50 students in each of senior and junior classes. Each
class has 25 male and 25 female students. In how many ways can
an 8 students community be front so that there are 4 female and 3
junior in community.
32. Find the number of ways in which p+q+r things can be divided
in to three groups containing p, q and r things respectively?
33. State and prove pegion hole principle?
34. So that if any five integers form 1 to 8 are chosen then at least
two of them will have a sum 9.
35. So that in any room of people who have been doing hand
shacking, there will always be atleast two people who have second
hands the same number of times?
36. Define recurrence relation with an example.
37. So that the sequence {2,3,4,5,…………..2+n,…….} for n>=0
satisfies the recurrence relation ak=2ak-1-ak-2, k>=2.
38. Solve the recurrence reletion-
an=an-1+2, n>=2 subject to initial condition a=3
39. Solve the recurrence relation of the fibonaccy sequence of
number fn=fn-1+fn-2 n>=2 with the initial condition f0=0 f1=1.
40. Solve an+2-5an+1+6an=2 with initial condition a0=1, a1=1.
41. A bag contains black, blue and white shocks. Find the minimum
no. of shocks one need to choose in order to get to paires of
shocks of the same colours?
42. Give a brief discussion on recurrence relation.
43. Establish recurrence relation on compound interest. Explain
with an example.
44. State and prove pegion hole principle discuss usefulness of this
principle.
45. Did use the number of permutation of n different object take an
r at a time, in which k particular object are always presents. Using
this formula generate a problem corresponding to the above
formula and solve it.
46. What do you mean by permutation of n symbols? Make the
composition table.
47. Prove that set of rational numbers always with usual addition
and usual multiplication form a commutative ring with unity.
48. What do you mean by cyclic group. (i, -I, 1,-1) So that the group
is cyclic find its generator.
49. In how many ways can commetiee of 5 teachers and 4 students
be choosen from 9 teachers and 15 students.
50. Combination of a number at a time.
51. There are five question in a question paper. In how many ways
one can solve one or more question?
52. In how many ways can selection be made out of three mangoes
5 oranges and 2 apple?
53. The question paper of mathematics contents 10 questions
devided into two groups of 5 question each. In how many ways
can an examine ans. 6 question taking atleast 2 question from
each group ?
54. Find the number of diagrams that can be drawn by joining the
angular points of hexagon.
55. In how many ways can a students choosen a 5 subject. If a sub
are available and two sub are compalsary for all the students.
56. There are 50 students. In each of the senior and junior classes. .
Each class has 25 male and 25 female students. In how many ways
can an 8 students community be front so that there are 4 female
and 3 junior in community.
57. To find the no. of ways in which p+q things can be devided in to
two groups containing p and q things respectively.
58. In how many ways 14 oranges can be devided equal in to two
groups?
59. In how many ways can 14 man be partision into 6 teams. where
1st items has three members, 2nd items has 2 members,and 3rd iten
has 3 members, and 4th, 5th ,6th each has 2 members?
60. What do you mean by trail?
61. The minimum no. of edges in a connected graph with n vertices
is n-1.
62. Eulerian and Hamiltonian graph.
63. A non-empty connected graph G is Eulerian if and only if it’s
vertices are all of even degree.
64. A connected graph contains an Euler trail, but not Euler circuit,
if and only if has exactly two vertices of odd degree.
65. Describe Hamiltonia graph.
66. A simple connected graph G with n>=3 vertices is Hamiltonian if
deg (v)>=n/2 for every vertex v in G.
67. Given an example of a graph which contains
i) an Eulerian circuit that is also a Hamiltonian cycle.
Ii) an Eulerian circuit and a Hamiltonian cycle that are distnict.
Iii) an Eulerian circuit, but not a Hamiltonium cycle.
Iv) a hamiltonium cycle but not an Eulerian circuit.

68. [Every tree with two or more vertices is 2 chromatic.

69. The chromatic no, of a non-null graph is 2 if and only if the
graph id bipartite.
 ]
70. The chromatic no, of a cycle with n vertices graph
colouring
71. Algebra of proposition.
72. What do you mean by conditional propositions?
73. Discuss the type of conditional proposition.
74. Truth table corresponding to given connectives.
75. What is totology and contradiction? Difference between them?
76. Normal form?
77. Basic defination:- simple, multy, pseudo graph, path, circuit,
cycle, walk, trail.
78. Degree of sequence with example.
79. Complete graph and regular graph?
80. Compare Complete graph and regular graph?
81. What do you mean by graph colouring?
82. Definition;- tree, spanning tree, binary tree.