DISCRETE MATHEMATICS

UNIT-I
SHORT ANSWERS QUESTIONS
1. State De-Morgan’s law.
2. Prove that ¬ (P ˅ Q) ≡ (¬P ˄¬ Q)
3. Construct the truth table for the following formula: Ø(P Ú (Q Ù R)) «
((P Ú Q) Ù (P Ú R))
4. Construct the truth table of (PVQ) → P.
5. Write the rule of disjunctive amplification of predicates.
6. Write the rule of Modus Pones of predicates.
7. If p: A circle is a conic, q: 5 is a real number, r: Exponential series is
convergent.
Express the compound propositions p→(q⋁ r), p ∧ (∼ q) in words.
8. Write a short note on DNF and CNF
9. Express the statement in words: “Every student in class has studied
Calculus.” Using quantifiers.
10. Check the validity of the following argument
All integers are rational numbers.
Some integers are powers of 5.
Therefore, some rational numbers are powers of 5.

LONG ANSWERS
1. Show that ~r is a valid conclusion from the premises p→ ~ q, r→p , q
(a)With truth table (b) without truth table

2. Obtain PCNF for the propositional function

( ~Pv~Q)→(P↔ ~ Q)

3. Verify the validity off the following inference:

All integers are rational numbers
Some integers are powers of 3.
Therefore, some rational numbers are power of 3.
4. Find the PDNF of i) p ↔ q ii) p v (q ∩ r) without using truth table
5, Shows that the following statement are logically equivalent without using
truth table.
(P→Q)^(P→R)ó P→ (Q^R)
̴ (P v ( ~P^Q))ó ̴ P ^ ̴ Q

6. What do you mean by Well Formed Formula? Explain about Tautology with
example?
7. Write different rules of inferences?
8. Translate each of these statements into logical expressions using predicates,
quantifiers and logical connectives
Something is not in the correct place.
All tools are in the correct place and are in excellent condition.
Everything is in the correct place and in excellent condition.
Nothing is in the correct place and is in excellent condition.
One of your tools is not in the correct place, but it is in excellent condition.

9.Verify the validity of the following

All men are smokers. there are men. Therefore, they are smokers

UNIT-II
Short Answer Questions
1.Define the following terms
Onto Function
One-one Function
Bijective Function
2. Define the following terms:
Reflexive Relation
Symmetric Relation
Transitive Relation
3. Define the following terms:
Power set
Functions
Proper Subset
4. Let R be a binary relation on a set A. Prove that If R is reflexive, then R-1 is reflexive.
5. For all subsets A and B of a universal set U, prove that (A – B) ⋃ (A ⋂ B) = A
6. If A, B and C are three non-empty subsets, then prove that
A X (B Λ C)=(A X B) Λ (AXC)
7. Define Equivalence Relation and give an example
8. Define a relation R which is neither reflexive nor irreflexive but symmetric and transitive for
a set A={1,2,3,4}
LONG ANSWERS QUESTIONS
1. List and explain various operations performed on sets explain with example
2. Prove that A-(B∩C)= (A-B)V(A-C)
3. Let R and S be the following relations 𝐴 ={ 𝑎, 𝑏, 𝑐, 𝑑} defined 𝑅 = {(𝑎, 𝑎 ),( 𝑎, 𝑐) , (𝑐,
𝑏) , (𝑐, 𝑑) , (𝑑, 𝑏)} and 𝑆 ={( 𝑏, 𝑎) ,( 𝑐, 𝑐) , (𝑐, 𝑑) ,( 𝑑, 𝑎)}
Find i) 𝑅𝑜𝑆 ii) 𝑆𝑜𝑅 iii) 𝑅𝑜𝑅.

4. Explain different properties of relations in set with example

5. Let A and B be sets. Show that: i) 𝐴 ∩ 𝐵 ⊆ 𝐴 ii) 𝐴 ∩ 𝐵 − 𝐴 = ∅
6. Explain reflexive, symmetric, transitive, equivalence and partial ordering relations with
example.
7. Let X={1,2,3} and f,g,h,s be functions from X to X given by
f= {(1,2),(2,3),(3,1)} g={(1,2)(2,1)(3,3)} h={(1,1)(2,2)(3,1)} s={(1,1)(2,2)(3,3)}
find fog,gof,fos,gos,sos,fohog,hos
8. Let X={a,b,c} define f:X->X such that f={(a,b),(b,a),(c,c)} find i) f2 ii)f3 iii)f4
9. Let f:R->R and g:R->R where R is the set off real numbers . find fog and gof where
f(x)=x2-2 and g(x)=x+4. State whether these functions are injective, surjective, bijective
10. Determine whether each of these functions is a bijection from R to R
i) F(x)=-3x+4 ii) f(x)=-3x2+7 iii) f(x)= x5+1
 UNIT-III
SHORT ANSWER QUESTIONS
1.Define partially ordered sets.
2.Draw the Hasse diagram representing the positive divisor of 36.
3. Find the least and greatest element in the set (Z + , /) if they exist.
4. From the Hasse diagram 24 36
12
6
2 3
Find lub and glb of A={2,3,6}
5. Define Abelian group.
6, Let G= {1,-1,I,-i} be a multiplicative group. Find the order of every
element.
7.Simplify the following Boolean Expression X= (AB1+B) (AB+B1)
LONG ANSWER QUESTIONS

1. Draw the Hasse diagram for the poset (p(S), ⃀) where S={1,2,3,4}
2. If A= {1,2,3,5,30} and R is the divisibility relation, prove that (A, R)
is a lattice but not a distributive lattice.
3. Show that the set of all positive rational numbers forms an abelian
group under the composition defined by a*b=(ab)/2.
4. Prove a non-empty subset H of a group G is a subgroup of G if and
only if
a ∈H, b∈H→ a*b∈ H
a∈H→ a-1 ∈H, where a-1 is the inverse of a in G.

5.Prove that a group G is abelian if and only if (ab)2 b= a2b2,∀ a,b ∈G.
6.a) Find the dual of the following Boolean Expressions. xy (y+y1z) + x1z
B) Find the complement of the following Boolean Expressions. x (y1z1+yz)
C) Convert the Boolean function
f (x,y,z)= (x1+y+z1). (x1+y+z). (x+y1+z) in disjunctive normal form.

7.Use Karnaugh map to simplify the following expressions.

X = A1BC1D1+ ABC1D1+A1BCD1+ABCD1
F( A,B,C,D)= Ʃ( 0,2,6,8,10,12,14,15)
 UNIT-IV
Short answer questions
S.N Questions
O
1. What are the two elementary principles of counting ?
2. What is permutation?
3. What is the difference between permutation and combination?
4. What is multimonial coefficients?
5. How many different 5 digit numbers can be formed from the
digits 0,1,2,3& 4?
6. In how many ways can the letters of the word ‘MATRIX’ be
arranged so that the vowels occupy only the even positions?
7. What is restricted permutations?
8. Obtain the number of permutations of all the letters of the
words:

i) COMMITTEE ii)ACCOUNTANT.
9. What is circular permutation?
10. In how many ways can a party of 4 boys and 4 girls be seated
at a circular table so that no 2 boys are adjacent?
LONG QUESTIONS
S.N QUESTIONS
O
1. Find the number of permutations that can be had from the
letters of the ‘DAUGHTER’

a) Taking all the letters together

b) beginning with D

C) beginning with D and ending with R

d) vowels being always together

e) not all vowels together

f) not even two vowels together

g) vowels occupying even places.

2. In a group of 50 students,24 like cool drinks and 36 like hot
drinks and each student likes at least one of the two drinks.
how many like both cool drinks and hot drinks?
3. How many integers between 1 and 300 (inclusive) are
divisible by at least one of 5,6 and 8?
4. What is the coefficient of x2y4 in (x + y)6 ?
5. State and prove multinomial theorem ?
6. Determine the number of integers between 1 and
10,000,000 and have the sum of digits equal to 18?
7. A Women has 20 close relatives and she wishes to invite 7
of them to dinner. In how many ways she can invite them in
the following situations:

a) There is no restrictions on the choice

b) Two particular persons will not attend separately
c) Two particular persons will not attend together

8. In a sample of 200 logic chips, 46 have a defect D1, 52 have

a defect D2, 60 have a defect D3, 14 have defects D1 and D2,
16 have a defects D1 and D3, 20 have defects D2 and D3, and
3 have all the three defects. Find the number of chips
having

a) at least one defect

b) no defect

9. Explain about combinatorial identities?

10. If 2n+1pn-1:2n-1pn=3:5,find the value of n.
 UNIT – V

Short answer Questions

1.consider the graph shown.Find all paths from vertex A to vertex R also indicate their length.

2. Find all the spanning tree of the graph given below

3.Find the chromatic number of each of the following

4. Show that the following graph contain an Euler circuit

5.Explain planar and non- planar graphs.

6. Explain Euler circuit and Hamilton path and give one example for each?

7.Define Incident matrix ? Write the incident matrix representation for the below graph?

8.What is connected graph and Disconnected graph with example for each graph?
9.What is graph coloring ? Explain with example.
10.What is Bipartite Graph? Explain with example.
Long Answer Questions

1. a) State and prove fundamental theorem of graphs.

b) Verify the Handshaking property for the below Graph.

2.Explain the Rules of isomorphism. Show that following two graphs are isomorphic.

3. What is spanning tree? What is minimum cost spanning tree? what are the different algorithms
to compute minimum cost spanning tree? Explain with suitable example.

4. Explain Breadth- first search (BFS).

Use breadth-first search to find a spanning tree for the graph given below
5.What is minimum cost spanning tree? Explain Prims Algorithm.
Use Prims Algorithm to find spanning tree for the graph given below.

6. Show, step by step kruskal’s algorithm on the following connected weighted graph and also
calculate sum of the weights of the minimal spanning tree?

7.Explain types of graphs with suitable example for each graph?

8.a) Prove that the maximum number of edges in a graph with n vertices is
n(n-1)/2.
c) Prove that the number of vertices of odd degree in a graph is always even.
9. State and prove BFS and DFS algorithms with an example.

10.Using kruskal’s algorithem ,find minimal spanning tree of the weighted graph given below