Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–IV (NEW) EXAMINATION – WINTER 2023
Subject Code:3140708 Date: 06-02-2024
Subject Name: Discrete Mathematics
Time: 10:30 AM TO 01:00 PM Total Marks:70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.
Marks
Q.1 (a) A function 𝑓: ℝ+ → ℝ is defined by 𝑓(𝑥) = 𝑥 2 − 8. Check whether 𝑓 is 03
one-one and onto.
(b) Determine the relation ∥ (parallel) on the set L of lines in the plane are 04
reflexive, symmetric, anti-symmetric, transitive, irreflexive.
(c) (i) Show that the functions 𝑓(𝑥) = 𝑥 3 and 𝑔(𝑥) = 𝑥 13 for 𝑥 ∈ ℝ are 03
inverses of one another.
(ii) Check whether the following graphs are isomorphic. 04

Q.2 (a) Identify the statement (𝑝⋀𝑞) ⋀ ¬(𝑝⋁ 𝑞) is tautology or contradiction. 03

(b) (i) Show that in a group (𝐺,∗), for any 𝑎, 𝑏 ∈ 𝐺 if (𝑎 ∗ 𝑏)2 = 𝑎2 ∗ 𝑏 2 then 04
(𝐺,∗) must be abelian.
(ii) If (𝐺,∗) be a group then for any two elements 𝑎 and 𝑏 of (𝐺,∗), prove
that (𝑎 ∗ 𝑏)−1 = 𝑏 −1 ∗ 𝑎 −1.
(c) Use a truth table to determine whether the following argument form is 07
valid.
𝑝→𝑞
𝑞→𝑟
∴𝑝→𝑟
OR
(c) Express the following using predicate, quantifier and logical connectives. 07
Also verify the validity of the consequence.
(i) Every computer science major takes discrete mathematics. Natasha is
taking discrete mathematics. Therefore, Natasha is a computer science
major.
(ii) All parrots like fruit. My pet bird is not a parrot. Therefore, my pet bird
does not like fruit.
Q.3 (a) Show that (ℤ∗5 ,×6 ) is cyclic group, where ℤ5∗ = ℤ5 \{0}. 03

1
 (b) Given A = {x ∶ x is an integer and 1 ≤ x ≤ 5}, 04
𝐵 = {3, 4, 5, 17}, and 𝐶 = {1, 2, 3, . . . }, find 𝐴 ∩ 𝐵, 𝐴 ∪ 𝐵, 𝐴 ∩ 𝐵 ∩ 𝐶
and 𝐴 ∪ 𝐶.
(c) (i) Show that every subgroup of a cyclic group is normal 03

(ii) The subset 𝐻 = {0,2} is a subgroup of (ℤ4 , +4 ). Find all left and right 04
cosets of 𝐻 in (ℤ4 , +4 ). Is 𝐻 a normal subgroup?
OR
Q.3 (a) Define 𝑓: (ℕ × ℕ,∗) → (ℚ,×) by 𝑓(𝑎, 𝑏) = 𝑎. Show that 𝑓 is a 03
𝑏
homomorphism.
(b) In a class of 50 students, 12 enrolled for both Mathematics and Science, 32 04
enrolled for Science. If the students of the class enrolled for at least one of
the two subjects, then how many students enrolled for only Mathematics but
not Science?
(c) Consider the ring ℤ10 = {0, 1, 2, … ,9} of integers modulo 10. 07
(a) Find the units of ℤ10 .
(b) Find −3, −8 and 3−1 .
(c) Let 𝑓 (𝑥) = 2𝑥 2 + 4𝑥 + 4. Find the roots of 𝑓 (𝑥) over ℤ10 .

Q.4 (a) Let 𝑋 = {1, 2, 3, 4} and 𝑅 = {〈𝑥, 𝑦〉/ 𝑥 > 𝑦} . Draw the graph of 𝑅 and 03
also give its matrix.

(b) Find out maximal compatibility blocks of following simplified graph of 04

digraph and write its relation matrix.

(c) Prove that 〈𝑆30 , 𝐷〉 is a Boolean algebra. 07

OR
Q.4 (a) Define equivalence relation. Let 𝑋 = {1, 2, 3, 4,5}, 03
𝑅 = {〈𝑥, 𝑦〉/ 𝑥 is divisible by 𝑦}. Check whether the relation an
equivalence relation?
(b) Let 𝐴 = {𝑎, 𝑏, 𝑐, 𝑑} and 𝜌(𝐴) its power set. Let ⊆ be the inclusion relation 04
on the elements of 𝜌(𝐴). Draw the Hasse diagram of 〈𝜌(𝐴), ⊆〉.

(c) Solve 07
𝑎𝑛 = 11𝑎𝑛−1 − 39𝑎𝑛−2 + 45𝑎𝑛−3, 𝑎0 = 5, 𝑎1 = 11, 𝑎2 = 25.

Q.5 (a) A tree 𝑇 has 3 vertices of degree 4, 3 vertices of degree 3. Find the number 03
of pendant vertices in tree 𝑇.

2
 (b) Find reachable set of each node of the given digraph. Also find 04
𝑑(𝑉1 , 𝑉3 ), 𝑑(𝑉3 , 𝑉1 ).

(c) Define Strong, unilateral, week component. Also Find strong, unilateral, 07
week component from the given digraph.

OR
Q.5 (a) Define null graph, centre of a graph and complete graph. 03
(b) Find the path matrix using adjacency matrix of the following graph. 04

(c) Define tree. In which order does a pre-order, in-order and post-order 07
traversal visit the vertices of the ordered rooted tree shown in figure?

*****

3
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER– IV(NEW) EXAMINATION – SUMMER 2023
Subject Code:3140708 Date:17-07-2023
Subject Name:Discrete Mathematics
Time:10:30 AM TO 01:00 PM Total Marks:70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

Q.1    
(a) If A = x x = 3n , n  6, n  N B = x x = 9n , n  4, n  N then find 03

A B , A B and A − B .
(b) Check whether the relation R defined in the 1, 2,3, 4,5,6 as 04

R = ( a, b ) : b = a + 1 is reflexive, symmetric or transitive.

(c) (I) Prove that p → q and ( p  q) are logically equivalent. 03

 
(II) Let Y = n2 : n  N and f : N → Y defined as f (n) = n2 . Show 04

that f is invertible and find the inverse of f .

Q.2 (a) In a survey of 400 students in a school, 100 were found as drinking apple 03
juice, 150 as drinking orange juice and 75 drinking both apple and
orange juice. Find how many students drink neither apple nor orange
juice.
(b) Let f : R → R be function defined by f ( x) = ax + b . Find values of a 04
and b for which f f = IR
(c) If R = ( a, b ) : a − b = 1 and S = ( a, b ) : a − b is even be two relations 07

on A = {1,2,3,4} . Then (I) Find matrices of R and S , (II) Find digraph

of R and S (III) Find the relation RS
OR
(c) (I) Find n if nC3 + n+2C3 = n P3 03
(II) From 4 professors and 6 students, a committee of 3 is to be formed. 04
In how many ways, this can be done, if the committee contains (1) at
most 1 professor (2) at least 2 professors.
Q.3 (a) Find reachable set of all the vertices and node base of following graph. 03

1
 (b) Show that in a lattice if a  b  c , then 04
(I) a b = b  c and (II) (a  b) (b  c) = b = (a b)  (a c)

(c) Solve the recurrence relation which represents the Fibonacci sequence 07
Fn = Fn−1 + Fn−2 with F0 = F1 = 1 .
OR
Q.3 (a) The Indian cricket team consist of 16 players. It includes 2 wicket 03
keepers and 5 bowlers. In how many ways eleven player can be selected
if we have to select on wicket keeper and at-least 4 bowlers?
(b) Prove that any graph has even number of odd vertices. 04
(c) Find the generating function of an+2 = an+1 + an , where a0 = a1 = 1 for 07
n1
Q.4 (a) If G is an abelian group with n elements g1, g2 ,....., gn then show that 03

( g1g2.....gn ) = e , where e is the identity element of G

2

(b) Draw a binary tree whose post-order produced the string 04

d − g − e − b − i − j − h − f − c − a and pre-order produces the string
j −b −a −c −d −i −h −e − g − f
(c) Define Lattice. And draw the Hasse diagram representing the partial 07
ordering ( A, B) : A  B on the power set P ( S ) where S = {1,2,3} . Find
the maximal, minimal, greatest and least elements of the poset.
OR
Q.4 (a) Define Isolated vertex, Pendent vertex and Size of a graph 03
(b) Let G be a graph with n vertices and m edges such that vertices have 04
degree k or k + 1 . Prove that if G has Nk vertices of degree k and Nk +1
vertices of degree k + 1 then Nk = (k + 1)n − 2m
(c) Show that G is an abelian group under usual matrix addition, where 07
 a b 
  a, b, c, d  R
G =  
  c d  
 
Q.5 (a) Show that the only right coset of a subgroup H in a group G that is also 03
subgroup of G is H itself.
(b) Dose there exists a 4- regular graph with 6 vertices? If so, construct the 04
graphs.

(c) Show that ( R, +,  ) is an integral domain, where R = a + b 5 a, b  I
 07

OR
Q.5 (a) Define cycle, walk and tree. 03
(b) Find transitive closure by Warshall’s Algorithm if A = {1,2,3,4,5} and 04
R = {(1, 2 ) , ( 3, 4 ) , ( 4,5 ) , ( 4,1) , (1,1)}
(c) Define Isomorphic Graphs. Determine whether the following graphs are 07
isomorphic or not.

2
3
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER– IV EXAMINATION – SUMMER 2020
Subject Code: 3140708 Date:29/10/2020
Subject Name: Discrete Mathematics
Time: 10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Marks

Q.1 (a) If A = {a, b} and B = {c, d} and C = {e, f} then find (i) ( A  B )U ( B  C ) 03
(ii ) A  ( BUC ).
(b) Define even and odd functions. Determine whether the function 04
f : I  R  defined by f ( x0  2 x  7 is one-to-one or bijective.
(c) (i) Show that the relation x  y (mod m) defined on the set of integers I is 03
an equivalence relation.
(ii) Draw the Hasse diagram for the partial ordering {( A, B ) / A  B} on 04
the power set P (S ) , where S  {a, b, c}.
Q.2 (a) Define equivalence class. Let R be the relation on the set of integers I 03
defined by ( x – y ) is an even integer, find the disjoint equivalence classes
(b) A committee of 5 persons is to be formed from 6 men and 4 women. In 04
how many ways can this be done when (i) at least 2 women are included
(ii) at most 2 women are included ?
(c) Solve the recurrence relation an  5an1  6an2  3n 2 using the method 07
of undetermined coefficients.
OR
(c) Solve the recurrence relation using the method of generating function 07
an  5an1  6an2  3n , n  2; a0  0, a1  2.

Q.3 (a) Define simple graph, degree of a vertex and complete graph. 03
(b) Define tree. Prove that there is one and only one path between every pair 04
of vertices in a tree T.
(c) (i) A graph G has 15 edges, 3 vertices of degree 4 and other vertices of 03
degree 3. Find the number of vertices in G.
(ii) Define vertex disjoint and edge disjoint subgraphs by drawing the 04
relevant graphs.
OR
Q.3 (a) Show that (G, 5 ) is a cyclic group, where G={ 0, 1, 2, 3, 4 }. 03
(b) Define the following by drawing graphs (i) weak component (ii) 04
unilateral component (iii) strong component.
(c) (i) Construct the composite tables for (i) addition modulo 4 and (ii) 03
multiplication modulo 4 for Z 4  {0,1,2,3} . Check whether they have
identity and inverse element.
  a 0  04
(ii) Define ring. Show that the set M    / a, b  R  is not a ring
 b 0 
under the operations of matrix addition and multiplication.

1
Q.4 (a) Define algebraic structure, semi group and monoid. Also give related 03
examples.
(b) Use Warshall’s algorithm to obtain path matrix from the adjacency matrix 04
of

v1 v4
v5

v2 v3
(c) (i) Is the algebraic system ( Q, * ) a group? Where Q is the set of 03
rational numbers and * is a binary operation defined by
a * b  a  b  ab , a, b  Q.
(ii) Let ( Z, + ) be a group, where Z is the set of integers and + is an 04
operation of addition. Let H be a subgroup of Z consisting of elements
multiple of 5. Find the left cosets of H in Z.
OR
Q.4 (a) Prove that there are always an even number of vertices of odd degree in a 03
graph.
(b) Prove that every subgroup H of an abelian group is normal. 04
(c) (i) Find the number of edges in a r – regular graph with n – vertices. 03
(ii) A tree T has 4 vertices of degree 2, 4 vertices of degree 3, 2 vertices 04
of degree 4. Find the number of pendant vertices in T.

Q.5 (a) Show that the operation * defined by x * y  x y on the set N of natural 03
numbers is neither commutative nor associative.
(b) Prove that an algebraic structure ( G, * ) is an abelian group, where G is 04
the set of non-zero real numbers and * is a binary operation defined by
ab
a *b  .
2
(c) (i) Find out using truth table, whether ( p  r )  p is a tautology. 03
(ii) Obtain the dnf of the form ( p  (q  r )). 04
OR
Q.5 (a) If f : x  2 x , g : x  x 2
and h : x  ( x  1), then show that 03
( fog )oh  fo( goh ).
(b) Define lattice. Determine whether the POSET ({1,2,3,4,5};1) is lattice. 04
(c) (i) If p: product is good, q: service is good, r: company is public limited, 03
write the following in symbolic notations (i) either product is good or the
service is good or both, (ii) either the product is good or service is good
but not both, (iii) it is not the case that both product is good and company
is public limited.
(ii) For the universe of integers, let p(x), q(x), r(x), s(x) and t(x) be the 04
following open statements: p(x): x > 0; q(x): x is even; r(x): x is a perfect
square; s(x): x is divisible by 4; t(x): x is divisible by 5. Write the
following statements in symbolic form: (i) At least one integer is even,
(ii) There exists a positive integer that is even, (iii) If x is even then x is
not divisible by 5, (iv) No even integer is divisible by 5, (v) There exists
an even integer divisible by 5.

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–IV (NEW) EXAMINATION – SUMMER 2021
Subject Code:3140708 Date:07/09/2021
Subject Name:Discrete Mathematics
Time:02:30 PM TO 05:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.
MARKS
Q.1 (a) Among 100 people at least how many of them were born in the same 03
month?
(b) Prove that: (𝐴 ∪ 𝐵)′ ≡ 𝐴′ ∩ 𝐵 ′ . 04
(c) Define the following: 07
1) Composition of functions
2) Monoid
3) Existential Quantifier
4) Partially Ordered Set
5) Boolean Algebra
6) Tree
7) Complete Graph

Q.2 (a) Explain types of a Relation with a suitable example. 03

(b) Rewrite the following statements using quantifier variables and 04
predicate symbols:
1) All birds can fly.
2) Some women are genius.
3) There is a student who likes Discrete Mathematics but not Probability
and Statistics.
4) Each integer is either even or odd.
(c) Determine the validity of the argument given: 07
If I study, then I will not fail in Discrete Mathematics.
If I do not play cricket, then I will study.
But I failed in Discrete Mathematics.
----------------------------------------------------------
Therefore I must have played cricket.
OR
(c) Find if the following is a tautology, contradiction or contingency. 07
(𝑝 → (𝑞 → 𝑟)) → ((𝑝 → 𝑞) → (𝑝 → 𝑟))
Q.3 (a) Define: Bounded, Distributive and Complemented Lattices. 03
(b) Find the transitive closure of 04
𝑅 = {(1,2), (3,4), (4,5), (4,1), (1,1)}. Where, 𝐴 = {1,2,3,4,5}.
(c) Let 𝐴 be a set of factors of positive integer 𝑚 and relation is divisibility 07
on 𝐴.
For 𝑚 = 45, show that POSET (𝐴, ≤) is a Lattice.
OR
Q.3 (a) Draw the Hasse diagram of the set {1,3,9,18} under partial order relation 03
‘divides’ and indicate those which are chains.
(b) Let 𝑋 = {1,2,3, … ,7} and 𝑅 = {(𝑥, 𝑦): 𝑥 − 𝑦 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑏𝑙𝑒 𝑏𝑦 3}. Show 04
that 𝑅 is an equivalence relation. Draw the graph of 𝑅.

1
 (c) Solve the recurrence relation: 07
𝑎𝑛+2 − 5𝑎𝑛+1 + 6𝑎𝑛 = 2.
Q.4 (a) Define group with example. Give an example of a non-abelian group. 03
(b) Let 𝐻 = {[0], [3]} in 𝑍6 under addition. Find left and right cosets in < 04
𝑍6 , +6 >.
(c) Prove that 𝐺 = {1,2,3,4,5,6} is a finite abelian group of order 6 with 07
respect to multiplication modulo 7.
OR
Q.4 (a) Define subgroup and group Homomorphism. 03
(b) Is addition a binary operation on {-1,0,1}? Justify. 04
(c) Explain Cosets and Lagrange’s theorem. 07
Q.5 (a) How many nodes are necessary to construct a graph with exactly 8 edges 03
in which each node is of degree 2.
(b) Find the shortest path between each pair of vertices for a simple digraph 04
using Warshall’s Algorithm.

(c) Define Isomorphic Graphs. Verify the following graphs are Isomorphic 07
or not (Justify).

OR
Q.5 (a) Define Cyclic graph, Null graph and Strongly connected graph. 03
(b) Draw a graph which is regular but not bipartite. 04
(c) For the following set of weights construct an optimal binary prefix code. 07
For each weight in the set, give corresponding code word.
5, 7, 8, 15, 35, 40

*************

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–IV (NEW) EXAMINATION – SUMMER 2022
Subject Code:3140708 Date:02-07-2022
Subject Name:Discrete Mathematics
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

Marks
Q.1 (a) Determine whether each of these statements is true or false. 03
1)0 ∈ ∅ 2)∅ ⊂ {0} 3){0} ∈ {0}
4) ∅ ∈ {∅} 5){∅} ∈ {{∅}} 6) {{∅}} ⊂ {∅, {∅}}

(b) Determine whether f is a function from the set of all bit strings to the set 04
of integers if
1) 𝑓(𝑠) is the position of a 0 bit in S.
2) 𝑓(𝑠) is the number of a 1 bits in S.
Find the range of each of the following functions that assigns:
3) to a bit string the number of one bits in the string
4) to each bit string twice the number of zeros in that string.
(c) 1) Find the bitwise OR, and bitwise XOR of the bit string 1111 0000, 07
1010 1010
2) Show that the function 𝑓: 𝑅 → 𝑅 + ∪ {0} defined by 𝑓(𝑥) = |𝑥| is
not invertible. Modify the domain or codomain of 𝑓 so that it
becomes invertible.
3) Let 𝑆 be subset of a universal set ∪. The characteristic function 𝑓𝑆
: ∪→ {0,1} , 𝑓𝑆 (𝑥) = 1, 𝑖𝑓 𝑥 ∈ 𝑆 𝑎𝑛𝑑 0 𝑖𝑠 𝑥 ∉ 𝑆.
Let A and B be sets. Then show that 𝑓𝐴∩𝐵 (𝑥) = 𝑓𝐴 (𝑥). 𝑓𝐵 (𝑥)

Q.2 (a) Let P(x) be the statement “x = x2 “. If the domain consists of the integers, 03
what are the truth values of the following?
1) ∃𝑥 𝑃(𝑥) 2) ∀𝑥 ¬𝑃(𝑥) 3) ∃𝑥 ¬𝑃(𝑥)
(b) Identify the error or errors in this argument that supposedly shows that if 04
∃x P(x) ∧ ∃x Q(x) is true then ∃x (P(x) ∧ Q(x)) is true.
1. ∃x P(x) ∧ ∃x Q(x) Premise
2. ∃x P(x) Simplification from (1)
3. P(c) Existential instantiation from (2)
4. ∃x Q(x) Simplification from (1)
5. Q(c) Existential instantiation from (2)
6. 𝑃(c) ∧ 𝑄(𝑐) Conjunction from (3) and (5)
7. ∃𝑥 (𝑃(𝑥) ∧ 𝑄(𝑥)) Existential generalization

(c) 1) Use a truth table to verify the De Morgan’s law 07

¬(𝑝 ∨ 𝑞) ≡ ¬𝑝 ∧ ¬𝑞
2) Show that (𝑝 → 𝑞) ∧ (𝑞 → 𝑟) → (𝑝 → 𝑟) is a tautology.

OR
1
 (c) 1) Suppose that the domain of Q(x, y, z) consists of triples x, y, z, 07
where x = 0, 1, or 2, y = 0 or 1, and z = 0 or 1. Write out following
propositions using disjunctions and conjunctions.
i) ∃𝑧¬𝑄(0,0, 𝑧) ii). ∀𝑦𝑄(0, 𝑦, 0)
2)
i) Show that ∃𝑥 𝑃(𝑥) ∧ ∃𝑥 𝑄(𝑥) and ∃𝑥(𝑃(𝑥) ∧ 𝑄(𝑥)) are
not logically equivalent.
ii) Show that ∃𝑥(𝑃(𝑥) ∨ 𝑄(𝑥)) and ∃𝑥 𝑃(𝑥) ∨ ∃𝑥 𝑄(𝑥) are
logically equivalent.

Q.3 (a) For the relation {(2, 2), (2, 3), (2, 4), (3, 2), (3, 3), (3, 4)} on the set 03
{1,2,3,4}, decide whether it is reflexive, whether it is symmetric, whether
it is antisymmetric, and whether it is transitive..(Justify your answer if the
property is not satisfied)

(b) For the following relations on the set of real numbers, 04

𝑅1 = {(𝑎, 𝑏) ∈ 𝑅 2 |𝑎 ≥ 𝑏}, 𝑅2 = {(𝑎, 𝑏) ∈ 𝑅 2 |𝑎 ≤ 𝑏}
2
𝑅3 = {(𝑎, 𝑏) ∈ 𝑅 |𝑎 ≠ 𝑏} find
1) 𝑅1 ⨁𝑅3 2) 𝑅2 𝑜 𝑅3

(c) 1) Draw the Hasse diagram for the poset ({2, 4, 6, 9, 12, 18, 27, 36, 48, 07
60, 72}, |). Hence find 𝑔𝑙𝑏({60,72}) and all maximal elements.
2) Determine whether the relation with the directed graph shown is
an equivalence relation.

OR
Q.3 (a) Suppose that the relations 𝑅1 and 𝑅2 on a set A are represented by the 03
matrices
1 0 1 1 0 1
M𝑅1 = [1 0 0] and M𝑅2 = [0 1 1]
0 1 0 1 0 0
What are the matrices representing 𝑅1 ∪ 𝑅2 and 𝑅1 ∩ 𝑅2 ?

(b) Use Warshall’s algorithm to find the transitive closures of the relation 04
𝑅 = {(1,4), (2, 1), (2,3), (3,1), (3,4), (4,3)} on {1, 2, 3, 4}

(c) 1) Draw the Hasse diagram for the poset({2, 4, 5, 10, 12, 20, 25}, |). 07
Hence, find the are maximal and minimal elements.
2) Which of these collections of subsets are partitions of
{1, 2, 3, 4, 5, 6}? Justify your answer if it is not a partition.
i) {1, 2}, {2, 3, 4}, {4, 5, 6}
ii) {1, 4, 5}, {2, 6}

Q.4 (a) Explain Path and Circuit of a graph. 03

2
 (b) 1) Define Isomorphic Graphs 04
2) Verify the following graphs are Isomorphic or not (Justify).

Graph -1 Graph-2

(c) 1) Define Subtree and Degree of a Node 07

2) Determine degree of the each node for the following tree.

OR
Q.4 (a) 1) Define: i) Isolated vertex ii) Null graph 03
2) Identify Isolated vertex/vertices from the following graph

(b) 1) Define incidence Matrix of a Graph 04

2) Find incidence matrix for the following graph

(c) 1) Define: M-ary Tree and Binary Tree. 07

2) Represent the following directed tree as Binary tree

3
Q.5 (a) 1) Define: SemiGroups. 03
2) Let S = {a, b, c, d}. The following multiplication table, define
operations ∙ on S. Is 〈S, ∙〉semigroup? Justify

(b) Let 𝐻 = {1, – 1} and 𝐺 = {1, – 1, 𝑖, – 𝑖} . (𝐻,×) is a sub-group (𝐺,×). 04

Then find all left cosets and right cosets of 𝐻 in 𝐺.

(c) 1) Define:Ring. 07
2) Write elements of the ring 〈𝑧10 , +10 , ×10 〉. And find −3, −8 , 3−1 , 4−1
OR
Q.5 (a) Consider the set Q of a rational numbers. Let ∗ be the operation on Q 03
defined by a∗ 𝑏 = 𝑎 + 𝑏 − 𝑎𝑏. Find
1) 3 ∗ 4 2) the identity element for ∗.

(b) Write the equivalence classes for congruence modulo 4 i.e.. z4 04

Let the subset H={[0],[2]} is a subgroup of 𝐺 = 〈𝑧4 , +4 〉. Then determine
all left cosets of H in G.

(c) We are given the ring 〈{𝑎, 𝑏, 𝑐, 𝑑}, +,∙〉 the operations + and ∙ on 𝑅 are as 07
shown in the following table.

+ a b c d ∙ a b c d
a a b c d a a a a a
b b c d a b a c a c
c c d a b c a a a a
d d a b c d a c a a
1) Does it have an identity?
2) What is the zero of this ring?
3) Find the additive inverse of each of its elements

********

4
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE- SEMESTER–IV (NEW) EXAMINATION – WINTER 2020
Subject Code:3140708 Date:17/02/2021
Subject Name:Discrete Mathematics
Time:02:30 PM TO 04:30 PM Total Marks:56
Instructions:
1. Attempt any FOUR questions out of EIGHT questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Marks
Q.1 (a) Find the power sets of (i)a , (ii)a, b, c. 03
(b) If f ( x)  2 x, g ( x)  x 2 , h( x)  x  1 then find (fog)oh and fo(goh). 04
(c) (i) Let N be the set of natural numbers. Let R be a relation in N defined 03
by xRy if and only if x  3 y  12 . Examine the relation for (i) reflexive
(ii) symmetric (iii) transitive.
(ii) Draw the Hasse diagram representing the partial ordering {(a,b)/ a 04
divides b} on {1,2,3,4,6,8,12}.

Q.2 (a) Let R be a relation defined in A={1,2,3,5,7,9} as R={(1,1), (1,3), (1,5), 03

(1,7), (2,2), (3,1), (3,3), (3,5), (3,7), (5,1), (5,3), (5,5), (5,7), (7,1), (7,3),
(7,5), (7,7), (9,9)}. Find the partitions of A based on the equivalence
relation R.
(b) In a box there are 5 black pens, 3 white pens and 4 red pens. In how 04
many ways can 2 black pens, 2 white pens and 2 red pens can be
chosen?
(c) Solve the recurrence relation a n  4a n1  4an2  n  3n using 07
undetermined coefficient method.

Q.3 (a) Define self-loop, adjacent vertices and a pendant vertax. 03

(b) Define tree. Prove that if a graph G has one and only one path between 04
every pair of vertices then G is a tree.
(c) (i) Find the number of edges in G if it has 5 vertices each of degree 2. 03
(ii) Define complement of a subgraph by drawing the graphs. 04

Q.4 (a) Show that the algebraic structure (G,*) is a group, where 03
G  {(a, b) / a, b  R, a  0} and * is a binary operation defined by
(a, b) * (c, d )  (ac , bc  d ) for all (a, b), (c, d )  G.
(b) Define path and circuit of a graph by drawing the graphs. 04
(c) (i) Show that the operation * defined by x * y  x y on the set N of 03
natural numbers is neither commutative nor associative.
(ii) Define ring. Show that the algebraic system (Z 9 , 9 ,9 ) , where 04
Z 9  {0,1,2,3,...,8} under the operations of addition and multiplication
of congruence modulo 9, form a ring.

1
Q.5 (a) Define subgraph. Let H be a subgroup of (Z,+), where H is the set of 03
even integers and Z is the set of all integers and + is the operation of
addition. Find all right cosets of H in Z.
(b) Define adjacency matrix and find the same for 04

(c) (i) Draw the composite table for the operation * defined by x*y=x, 03
x, y  S  {a, b, c, d }.
(ii) Show that an algebraic structure (G ,) is an abelian group, where 04
1 0   1 0 1 0 
G={A,B,C,D}, A    ,B    ,C   ,
0 1  0 1 0  1
 1 0 
D  and  is the binary operation of matrix multiplication.
 0  1

Q.6 (a) Define indegree and outdegree of a graph with example. 03

(b) Prove that the inverse of an element is unique in a group (G,*). 04
(c) (i) Does a 3-regular graph with 5 vertices exist? 03

(ii) Define centre of a graph and radius of a tree. 04

Q.7 (a) Check the properties of commutative and associative for the operation 03
* defined by x*y=x+y-2 on the set Z of integers.
(b) Define group permutation. Find the inverse of the permutation 04
1 2 3 4
  .
3 1 4 2 
(c) (i) Show that  p  q   p  q is a tautology. 03
(ii) Obtain the d.n.f. of the form ( p  q)  (p  q). 04

Q.8 (a) Find the domain of the function f ( x )  16  x 2 . 03

(b) Define lattice. Determine whether POSET 1,2,3,4,5;| is a lattice. 04
(c) Show that the propositions ( p  q ) and p  q are logically 07
equivalent.

********

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–IV (NEW) EXAMINATION – WINTER 2021
Subject Code:3140708 Date:24/12/2021
Subject Name:Discrete Mathematics
Time:10:30 AM TO 01:00 PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

Q.1 (a) Show that for any two sets 𝐴 and 𝐵, 𝐴 − (𝐴 ∩ 𝐵) = 𝐴 − 𝐵. 03

(b) If 𝑆 = {𝑎, 𝑏, 𝑐}, find nonempty disjoint sets 𝐴1 and 𝐴2 such that 𝐴1 ∪ 𝐴2 = 𝑆. 04
Find the other solutions to this problem.
(c) Using truth table state whether each of the following implication is tautology. 07
a) (𝑝⋀𝑟) → 𝑝
b) (𝑝⋀𝑞) → (𝑝 → 𝑞)
c) 𝑝 → (𝑝⋁𝑞)
Q-2 (a) Given 𝑆 = {1, 2, 3, − − − − ,10} and a relation 𝑅 on 𝑆. Where, 03
𝑅 = {〈𝑥, 𝑦〉|𝑥 + 𝑦 = 10} . What are the properties of relation 𝑅?
(b) Let 𝐿 denotes the relation “less than or equal to” and 𝐷 denotes the relation 04
“divides”. Where 𝑥𝐷𝑦 means “x divides y”. Both 𝐿 and 𝐷 are defined on the set
{1, 2, 3, 6}. Write 𝐿 and 𝐷 as sets, find 𝐿 ∩ 𝐷.
(c) Let 𝑋 = {1, 2, 3, 4, 5, 6, 7} and 𝑅 = {〈𝑥, 𝑦〉|𝑥 − 𝑦 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3}. Show that 𝑅 07
is an equivalence relation on. Draw the graph of 𝑅.
OR
(b) Define equivalence class generated by an element 𝑥 ∈ 𝑋. Let Z be the set of 07
integers and let 𝑅 be the relation called “congruence modulo 3” defined by
𝑅 = {〈𝑥, 𝑦〉|𝑥 ∈ 𝑍⋀𝑦 ∈ 𝑍⋀(𝑥 − 𝑦) 𝑖𝑠 𝑑𝑖𝑣𝑖𝑠𝑖𝑏𝑙𝑒 𝑏𝑦 3}
Determine the equivalences classes generated by the element of 𝑍.
Q.3 (a) Let 𝑓(𝑥) be any real valued function. Show that 𝑔(𝑥) = 𝑓(𝑥)+𝑓(−𝑥) is always an 03
2
𝑓(𝑥)−𝑓(−𝑥)
even function where as ℎ(𝑥) = is always an odd function.
2
(b) The Indian cricket team consist of 16 players. It includes 2 wicket keepers and 5 04
bowlers. In how many ways can cricket eleven be selected if we have select 1
wicket keeper and at least 4 bowlers?
(c) Let 𝐴 be the set of factors of particular positive integer 𝑚 and ≤ be the relation 07
divides, that is
≤= {〈𝑥, 𝑦〉|𝑥 ∈ 𝐴⋀𝑦 ∈𝐴⋀(𝑥 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑦)} Draw the Hasse diagrams for
a) 𝑚 = 45
b) 𝑚 = 210.
OR
Q-3 (a) Find the composition of two functions 𝑓(𝑥) = 𝑒 𝑥 and 𝑔(𝑥) = 𝑥 3 , (𝑓 ∘ 𝑔)(𝑥) and 07
(𝑔 ∘ 𝑓)(𝑥). Hence, show that (𝑓 ∘ 𝑔)(𝑥) ≠ (𝑔 ∘ 𝑓)(𝑥).
(b) In a box, there are 5 black pens, 3 white pens and 4 red pens. In how many ways 04
can 2 black pens, 2 white pens and 2 red pens can be chosen?
(c) Let 𝐴 be a given finite set and 𝜌(𝐴) its power set. Let ⊆ be the inclusion relation 07
on the elements of 𝜌(𝐴). Draw Hass diagram for 〈𝜌(𝐴), ⊆〉 for
a) 𝐴 = {𝑎, 𝑏, 𝑐}
b) 𝐴 = {𝑎, 𝑏, 𝑐, 𝑑}

1
Q.4 (a) Let 〈𝐿, ≤〉 be a lattice. Show that for 𝑎, 𝑏, 𝑐 ∈ 𝐿, following inequalities holds. 07
𝑎 ⊕ (𝑏 ⋆ 𝑐) = (𝑎⨁𝑏) ⋆ (𝑎⨁𝑐)
𝑎 ∗ (𝑏⨁𝑐) = (𝑎 ∗ 𝑏)⨁(𝑎 ∗ 𝑐)
(b) Let 𝐺 = {(𝑎, 𝑏)|𝑎, 𝑏 ∈ 𝑅}. Define binary operation (∗) on 𝐺 as 07
(𝑎, 𝑏), (𝑐, 𝑑) ∈ 𝐺, (𝑎, 𝑏) ∗ (𝑐, 𝑑) = (𝑎𝑐, 𝑏𝑐 + 𝑑). Show that an algebraic structure
(𝐺,∗) is a group.
OR
Q-4 (a) Let 𝐺 be the set of non-zero real numbers. Define binary operation (∗) on 𝐺 as 07
𝑎𝑏
𝑎 ∗ 𝑏 = 2 . Show that an algebraic structure (𝐺,∗) is an abelian group.
(b) Explain the following terms with proper illustrations. 07
a) Directed graphs
b) Simple and elementary path
c) Reachability of a vertex
d) Connected graph.
Q-5 (a) Show that sum of in-degrees of all the nodes of simple digraph is equal to the sum 07
of out-degrees of all the nodes and this sum equal to the number of edges in it.
(b) Let = {1, 2, 3, 4} . For the relation 𝑅 whose matrix is given, find the matrix of the 07
transitive closure by using Warshall’s algorithm.
1 0 0 1
1 1 0 0
𝑀𝑅 = [ ]
0 0 1 0
0 0 0 1
OR
Q-5 (a) Define tree and root. Also prove that tree with 𝑛 vertices has 𝑛 − 1 edges. 07
(b) Define in-degree and out-degree of a vertex and matrix of a relation. Let 𝐴 = 07
{𝑎, 𝑏, 𝑐, 𝑑} and let 𝑅 be the relation on 𝐴 that has the matrix
1 0 0 0
0 1 0 0
𝑀𝑅 = [ ]
1 1 1 0
0 1 0 1
*************

2
Seat No.: ________ Enrolment No.___________

GUJARAT TECHNOLOGICAL UNIVERSITY

BE - SEMESTER–IV(NEW) EXAMINATION – WINTER 2022
Subject Code:3140708 Date:16-12-2022
Subject Name:Discrete Mathematics
Time:10:30 AM TO 01:00 PM Total Marks:70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
4. Simple and non-programmable scientific calculators are allowed.

Marks
Q.1 (a) A committee 5 persons, is to be formed from 6 men and 4 women. In how 03
many ways this can be done when (i) at least 2 women are included, (ii) at
most 2 women are included.
(b) If A  4,5, 7,8,10 , B  4,5,9 and C  1, 4, 6,9 , then verify that 04
A   B  C    A  B   A  C  .
(c) Define Functionally complete set of connectives, Principal Disjunctive 07
Normal Form (PDNF). Obtain PDNF for the expression
   p  q    p  q    q  r  

Q.2 (a) Define Partial Order Relation. Illustrate with an example. 03

(b) Define one – one function. Show that the function f : R  R , 04
f  x   3x  7 is one – one and onto both. Also find its inverse.
(c) Solve the recurrence relation an2  5an1  6an  2 with initial condition 07
a0  1 and a1  1 using method of undetermined coefficients.
OR
(c) Use generating function to solve a recurrence relation an  3an1  2 with 07
a0  1 .

Q.3 (a) Define Partition of a Set. Let A  1, 2,3, 4,5 and 03
R  1, 2  , 1,1 ,  2,1 ,  2, 2  ,  3,3 ,  4, 4  ,  5,5  be an equivalence
relation on A . Determine the partition for R 1 , if it an equivalence
relation.
(b) Draw Hasse Diagram for the lattice  S30 , D  where S30 is the set of 04
divisors of 30 and D is the relation divides.
(c)  a b 07
Show that the set S of all matrices of the form   where a, b  R is
 b a 
a field with respect to matrix addition and matrix multiplication.
OR
Q.3 (a) Define Semi Group, Monoid. Give an example of an algebraic structure 03
which is semi group but not monoid.

1
 (b) Consider the a relation R defined on A  1, 2,3 whose matrix 04
representation is given below. Determine its inverse R 1 and complement
R' .
1 0 0 
M R  1 1 1 
0 0 1 
(c) Define free variable and bound variable. 07
Rewrite the following argument using quantifiers, variables and predicate
symbols. Prove the validity of the argument.

“All healthy people eat an apple a day.

Ram does not eat apple a day.
Ram is not a healthy person.”

Q.4 (a) Define Abelian group and prove that the set 0,1, 2,3, 4 is a finite abelian 03
group under addition modulo 5 as binary operation.
(b) Define even permutation. Show that the permutation 04
1 2 3 4 5 6 1 2 3 4 5 6
  is odd and   is even.
5 6 2 4 1 3 6 3 4 5 2 1
(c) Define Principal Ideal. Find all the principal Ideal of the ring 07
0,1, 2,3, 4,5 , 6 , 6  .
OR
Q.4 (a) Define cut vertex. List out all the cut vertices of the graph given in Figure 03
1.
(b) Define adjacency matrix and path matrix of a graph. Find out adjacency 04
matrix for the graph given in Figure 1.
(c) Define the terms: Simple Graph, Multi – Graph, Weighted Graph, Degree 07
of a vertex, in degree and out degree of a vertex. Illustrate each with an
example.

Q.5 (a) State Lagrange’s theorem and find out all possible subgroups of group 03
1, 1, i, i ,  .
(b) Define Eulerian graph, Planar Graph. 04
Justify whether the graph given in Figure 1 is Planer or not using Euler’s
formula.
(c) Define Binary tree, Spanning tree, Minimal Spanning tree, Find the 07
minimal spanning tree for the weighted graph given in Figure 2.
OR
Q.5 (a) Define Cyclic group, Normal subgroup. Illustrate with an example. 03
(b) Form a binary search tree for the data 16,24,7,5,8,20,40,3. 04
(c) Explain Post order traversal. Given the postorder and inorder traversal of 07
a binary tree, draw the unique binary tree.
Postorder: d e c f b h i g a
Inorder: d c e b f a h g i.

2
Figure 1 Figure 2

***************