GITA AUTONOMOUS COLLEGE, BBSR

(Affiliated to BPUT, Odisha)

4TH Semester 2022 – 23
Subject : DISCRETE MATHEMATICS , Subject Code : ________________
Part – I MODULE BL CO PO
01 Short Answer Type Questions
a) Define a proposition. And give an example of a proposition. 1 1 1 1,2,3
Using indirect proof, prove that :
b) 1 1 1 1, 4
If 3n+2 is odd then n is odd.
c) Define universal quantifier and give an example of universal quantifier. 1 1 1 1,2
d) Define equivalent propositions. 1 1 1 1,2,3,4
e) Define a tautology. And give one example of a tautology. 1 1 1 1,3,4
f) Let the predicate be Q(x,y):x=y+3 . Then what is the truth value of 1 1 1 1,2,3,4
Q(1,2) .
Translate to logical expression:
g) 1 1 1 1,3,4
There is a person in your class who can not swim.
Write the negation of :
h) 1 1 1 1,2,3
All Indians eat rice.
i) Write the rule of modus tollens. 1 1 1 1, 3
Write the Demorgan’s laws. 1 1,2,3,4
j) 1

02
State the anti-symmetric property of a relation R. 1 2 1, 3,4
a) 2

Define the reflexive closure of a relation R. 1 2 1,3,4

b) 2

Define POSET. Give an example of a POSET. 1 2 1,3,4

c) 2

Write the characteristic of a Hasse-diagram. 1 2 1,2,4

d) 2

Determine the greatest and least element of the POSET [ P{a, b, c}, ] . 1 2 1,2,3,4
e) 2

Draw the Hasse diagram of [{1.2,3,4}, ] . 1 2 1,2,3,4

f) 2

Define ceiling function. 1 2 1,2,3

g) 2

Is the function f ( x)  x 2 , x  I  injective? 1 2 1,2,3

h) 2

i) Define upper bound and lower bound of any two elements in a POSET. 2 1 2 1,2
j) Let R be a relation from A to B. A={1,2,3}, B={1,2} and R: is greater 1 2 1,4
2
than. Represent the relation R using zero-one matrix .
03
If the roots of the characteristic equation for a linear homogeneous 1 3 1,2,3,4
a) recurrence relation are 2,5,5,5,7,7,11, then write the general solution. 3

b) Write the generating function that generates the sequence {ak}, where 3 1 3 2,3
 ak=k+1

If the generating function for the infinite sequence {ak} is (1/(1-x)) , then 1 3 1,3
c) find ak. 3

Construct the recurrence relation for the sequence 1, 1, 2, 3, 5, 8, 13, … 1 3 1,2,3

d) 3
Write the characteristic equation of the recurrence relation − 1 3 2,3
e) 3
5 +6 =0
Write he generating function that generates the sequence 1,2,3,4,.. ... 1 3 1,2,3,4
f) 3
Construct the recurrence relation that suggests that “the sum of the first n 1 3 1,2,3,
g) natural numbers is n(n+1)/2”. 3

Write the choice for anp , in the solution of the recurrence relation 1 3 1,2,3,4
h) an  6an1  9an2  3n . 3

Define a linear non homogeneous recurrence relation and give an 1 3 1,3,4

i) example of that. 3

Write the generating function that generates the infinite sequence {ak}, 1 3 1,2
j) where ak=7. 3

Define a semigroup and give an example of semigroup. 1 4 1,2

04 a) 4
(I+,+) is not a monoid. Justify. 1 4 1,2,3
b) 4
State Lagrange theorem for groups. 1 4 2,3,4
c) 4
Briefly discuss about error correction. 1 4 1,3
d) 4
Evaluate d(101001,100110) 1 4 1,2,3
e) 4
Define abelian group. 1 4 1,2,3
f) 4
g) Define a distributive lattice with a suitable example. 4 1 4 1,2,3
h) Define a complemented lattice with a suitable example. 4 1 4 2,4
In a lattice (A,≤) with universal upper and lower bounds 1 and 0 1 4 2,4
respectively, determine the value of
i) a  1 and a  1 . 4

In a lattice (A,≤), determine the value of 1 4 2,3

j) a  (a  b) and a  (a  b) . 4

05 a) Define a regular graph and draw a regular graph. 5 1 5 1,2,3,4

b) Define a complete graph and determine the number of edges in K5 . 5 1 5 1,3
Define degree of a vertex and find the sum of the degrees of a graph with 1 5 1,2,4
c) 5
26 edges.
What is the maximum number of edges in a simple graph with 14 1 5 2,3,4
d) 5
vertices 3 components?
 e) How many Hamilton circuits consisting of seven edges are there in K7 ? 5 1 5 2,3,4
Write Euler’s formula to find the regions in a planar graph. 1 5 2,3,4
f) 5

g) What is the relation between number of edges and the number of regions 5 1 5 1,2,3,3
in any simple, connected planar graph.
h) Define Euler graph and draw an Euler graph. 5 1 5 1,3
i) What is the minimum value of n for which Kn has a Hamilton circuit? 5 1 5 1,3
If the sum of the in-degree of all vertices in a directed graph G is 24, 1 5 1,2,4
j) then determine the sum of the out-degree of all vertices in G. 5

Part – II MODULE BL CO PO
1 Focussed – Short answer type Questions
Define the connectives
i) Conjunction,
a) ii) Disjunction 1 2 1 1,2,3,4
And construct their truth table.

Using truth table show that p  (q  r )  ( p  q)  ( p  r ) .

b) 1 2 1 1,2,3

Find the number of positive integers not exceeding 100, that are not divisible
c) by 5 or 7. 1 2 1 1,2,3

Write the negation of the statements:

d) i) ”∀x (x2 > x)” 1 2 1 1,2,3
ii) ”∃x (x2= 2)”.
Determine the truth value of
e) i) ∃x P(x), where P(x) : x2 =-5, D = R 1 2 1 1,2,3
ii) ∀x P(x), where P(x) : x + 1 > x, D = R
Define predicates and quantifiers with suitable examples. 2 1 1,2,3
f) 1
2
a) Let R = {(1, 1),(2, 1),(3, 2),(4, 3)}. Find R2 and R3 2 2 2 1,2,4
Let R = {(1, 1),(1, 2),(2, 2),(2, 3),(3, 1),(3, 2)} be a relation on A = {1, 2, 3} .Find 2 3 1,2,4
b) 2
symmetric closure of R.
Draw the Hasse-diagram of 2 2 1,2,4
c) i) [{2, 3, 5, 30, 60, 120, 180}; |], 2
ii) [P{a, b, c}; ⊆].
If K is a positive integer and K + 1 or more objects are placed into K boxes, then 2 2 1,2
d) 2
Prove that there is at least one box containing two or more of the objectives.
1 0 1  0 1 0  2 2 1,2,4
Let M R  1 1 0 , M S  0 0 1 .
 
   
0 0 0 1 0 1
e) 2
Then find M R S , M S  R , M S R .

Let R = {(1, 1),(1, 2),(2, 1),(3, 2)} be a relation on A = {1, 2, 3}. Find reflexive 2 2 1,2,4
f) 2
closure of R.
3
Solve the recurrence relation 2 3 1,2
a) an  6an1  4an2 3

Define 2 3 1,3
i) Linear homogeneous recurrence relation ,
ii) Linear non homogeneous recurrence relation
b) for the sequence {an} with suitable examples. 3
And briefly discuss the method of solution for linear homogeneous
recurrence relation.

Define generating function for sequence of finite real numbers and 2 3 1,2
infinite real numbers. Find the generating functions for the following
sequence of real numbers
c) i) {ak}, ak=1/k!, 3
ii) {2,4,6,8,…}

Solve the recurrence relation using generating function 2 3 2,4

d) a n  3a n1 , n  1, a0  2 3

Solve the recurrence relation 2 3 1,3

e) a n  6a n1  11a n 2  6a n3 3

Solve the recurrence relation 2 3 1,3

f) an  3an1  3an2  an3 3

4
Show that cube root of unity under binary operation ‘X’ forms a group . 2 4 1,3
a) 4

The algebraic system (I,+) is a monoid, but the algebraic system (I+,+) is 2 4 1,2,3
b) not a monoid. Why ? Discuss . 4

Define principle of duality and show that the meet and join are 2 4 1,2,3,4
c) commutative operations. 4

For any a and b in a lattice, show that 2 4 1,3

a  a  b,
d) 4
a  b  a.

Determine whether the algebraic system ({2,4,6,...},+)is a semigroup or 2 4 1,3

e) not. 4

Discuss all the necessary conditions for which (B,*’) will be 2 4 1,3
i) isomorphic,
f) ii) homomorphic 4
to the algebraic systems (A,*).

5
Define 2 5 1,2,3
i) Graph,
ii) Finite graph,
a) 5
iii) Directed graph,
iv) Bipartite graph.

b) Determine whether the graphs G and H are isomorphic or not, 5 2 5 1,2,3

 c) Prove that Kuratowski’s first graph is non planar. 5 2 5 1,2,3
State and prove Handshaking theorem. 2 5 1,3
d) 5
If G is a connected simple planar graph with number of vertices | | 3, 2 5 1,4
e) then | | 3| | − 6 5

Define Hamiltonian path. Show a Hamilton path in the following graph . 2 5 1,3

f) 5

PART-III MODULE BL CO PO
LONG ANSWER TYPE QUESTIONS
Use logical equivalences to show that
1 a) ( p  (p  q))  p  q are logically equivalent. 1 3 3 1,2,3

b) Prove that 10n + 3 × 4n+2 + 5 is a multiple of 9,n ≥ 0. 1 3 2 1,2,3

Show that the hypotheses: ”Monika is skiing or it is not snowing” and ”It is 1 1,2,3
c) snowing or Dev is playing hockey” lead to the conclusion: ”Monika is skiing or 1
Dev is playing hockey”.
507,292,312 and 344 students took calculus, discrete mathematics, data 3
structure and C-programming respectively. 14 in calculus and data structure,
213 in calculus and C-programming, 211 in discrete mathematics and data
d) structure, 43 in discrete mathematics and C-programming. No student in both 1 2 1,3
calculus and discrete mathematics or data structure and C-programming. So
how many students took admission, considering that only two papers can be
taken by a

2 a) Show that congruence modulo relation is equivalence. 2 3 2 1,2,3,4

If N objects are placed into K boxes, then prove that there is at least one box
b) 2 3 1,3
containing at least N / K  objects.

Find R∗ from the given R using Warshall’s algorithm. 3

c) 2 1 1,2,3
R = {(1, 2),(2, 1),(2, 3),(3, 4),(4, 1)}
Define injective and surjective function. Determine whether the functions 3
d) 2 1 1,2,3
i) f(x) =x2+ 1,
 ii) f(x) =x3
are bijective functions or not.

Solve the recurrence relation using generating function

3 a) 3 3 1,2,3
an  8an1  10 n1 , a1  9.
Solve the recurrence relation 3
b) an  4an1  5n, a1  11. 3 3 1,2,3

Using recurrence relation, prove that 3 3 1,2,4

n
n(n  1)
c) 1 k  2 3

Solve the recurrence relation using generating function 3 3 1,2,3

d) 3
an  5an1  6a n 2 , a0  6, a1  30.
For any , , , ! (#, ) if then show that ˅ 3 4 1,3
˅ and ˄ ˄
4 a) 4

Prove that the order of any subgroup of a finite group divides the order of the 3 4 1,3
b) 4
group.
Let G = {0000, 0011, 1101, 1110} G is a group with identity element e = 0000, 3 4 1,2,3
a-1 = a. If the received words are
c) i) 1010, 4
ii) 0111
then find the corresponding transmitted words.
In a distributive ! (#, ) , if an element has a complement, then that 3 4 1,2,3,4
d) complement is unique. 4

Prove that in an undirected graph G there are even number of vertices 3 5 1,2,3
5 a) 5
with odd degrees.
b) In a directed graph G=(V,E), sum of the in-degrees of all vertices is equal 5 3 5 1,3,4
to the sum of the out-degrees of all vertices .
A simple graph with n vertices and k components can have at most (n- 3 5 1,2,3
c) k)(n-k+1)/2 edges. 5

Prove that in a complete graph with n vertices, there are (n-1)/2 edge 3 5 1,3
disjoint Hamilton circuits if n is odd and number and greater than or
d) 5
equal to 3.

NB : BL – Blooms Level 1, 2, 3, CO – Course Outcome, PO – Program Outcome