SNJB's LS KBJ College of Engineering, Chandwad

Department of AI&DS
Question Bank
A.Y. 2023-24 Semester:I Class:SE Subject: Discrete Mathematics

QNo CO Unit BL Question Marks

unit 1: Sets and Propositions and logic
100 of them 120 engineering students in a college take partin at least one of the activity
group discussion, debate andquiz. 65 participate in group discussion, 45 participate in
1 1 1 3 6 1
debate,42 participate in quiz, 20 participate in debate and quiz. Findthe number of
students, who participate in :(i) All the three activities.(ii) Exactly one of the activity
2 1 1 3 It is claimed that at the university 60% of the professor playstennis, 50% of them plays 6 3
football.
Show that70%eachcricket,
of these20% playstennis
conditional and football,
statements is a 30% playsbytennis
tautology using &truth
cricket and: 40%
tables
3 1 1 playsfootball
3 1. (p^q) →p & cricket. If someone claimed that 20% of the professorplays tennis, football &
2. p→(pvq) 6 4
cricket, would you belive that claim? why?
4 1 1 3 There are 2504 computer science students at a school. Of these, 1876 have taken a course 6 5
5 1 1 in Java,
3 Out of a999 totalhave takenstudents,
of 130 a course60inareLinux, and hats,
wearing 345 have
51 are taken a course
wearing in C.
scarves, andFurther,
30 are 6 6
6 1 1 876
Provehave
3 wearing takenhats
byboth
inductioncourses
and in sum
that the bothof
scarves. Java
Out
theof and
54 Linux,
cubes three231
students
of whohaveare taken
consecutive courses
wearing
integers in both
sweaters,
is divisible26 Linux
are 9. and
by 6 7
C, and 290 have taken courses in bothand Java
l2 and C. If 189both of these students have taken
7 1 1 3 wearing
Prove byhats,
courses inneither
21 are
Mathematical
Linux, aJava,
wearing
Induction scarves,
2+5+8+…….+(3n-1)= are wearing
n( 3n+1)/2 hats and scarves. Everyone 6 8
wearing hat and
nor C,a how
scarfmany of thesegloves
is wearing 2504 students
: (a) How havemany
not taken
studentsa course in any
are wearing
8 1 1 3 In
of athese
gloves
groupthree
of 70programming
? (b) How
cars tested bylanguages
a garage in?a city, 15 had faulty tyres,20 had faulty brakes,18
many students not wearing a sweater are wearing hats but not scarves ? 6 9
exceeds
In a town the allowable ignition limits, Also them
5 cars60%
had read
faulty tyres and A.brakes, 6 failed on tyresB&
(c) How theremanyarestudents
2000 literate person.of
not wearing a sweater newspaper
are wearing 55%nor
neither hat reada newspaper
scarf
emission,
and 20 % read10 failed on newspaper
neither brakes and A emission
nor B. Howand 4many
cars were unsatisfactory
individuals read in all 3 aspects. How
9 1 1 3 many
a) Bothhadthenonewspapers
faults in these three
A and B?checks? 4 10
b) Only one newspaper?
Obtain CNF of the following
10 1 1 3 ~(pvq)<-->(p^q) 3 11

By using Mathematical Induction proove that:

11 1 1 3 13+23 +...........+n3 =n2 (n+1)2/2 6 12
12 1 1 3 Prove that 1^ 1 +2 ^2 + … +n^ 2= n(n+1)(2n+1)/6 for the positive integer n using mathematical 13
13 1 1 3 induction.
Show that ¬(p ↔ q) and P↔ ¬ q are logically equivalent. 6 14 .
Uni 2: Relations and Functions
Use Warshall’s algorithm to find transitive closure of the following relation on the set {1, 2, 3,
14 1 3 3 4}, 6 1
R = {(1, 2), (1, 3), (1, 4,), (2, 3), (2, 4), (3, 4)}
15 1 3 3 Solve the following recurrence relation : ar – 7ar – 1+ 10ar– 2 = 2r a1= 3, a2= 21. 6 2
Functions f, g and h are defined on the set X = {1, 2, 3} as :
f= {(1, 3), (2, 1), (3, 2)}; g = {(1, 2), (2, 3), (3, 1)}; h= {(1, 2), (2, 1), (3, 3)}
16 1 3 3 6 3
(i) Find fog and gof. Are the equals ?
(ii) Find fogoh and fohog.
17 1 3 3 Solve the following Recurrance relation ar-7ar-1+10 ar-2 =0, with a0=0 and a1=3 6 4
Let x={2,3,6,12,24,36}, X<Y iff X divides Y . Find
a) Maximal Element
b) Minimal Element
18 1 3 3 c) Chain 6 5
d) Antichain
e) Is poset Lattice?
Let A={a,b,c,d} and let R be a relation on A , R={(b,a),(c,b),(a,d),(b,d),(c,d)}. Find transitive
19 1 3 3 6 6
closure using Warshalls method.
.f f(x)= x+2, g(x)= x2 and h(x)=3x for x belongs to R, where R is a set of real nos. Find fog, gof,
20 1 3 3 3 7
fogoh
21 1 3 3 Solve the Recurrence relation ar=-3ar-1 -2ar-2 with initial conditions a1=-2 and a2=4 8 8
Find the transitive closure of the relation R on A = {1, 2,3, 4} defined by R = {(1, 2),
22 1 3 3 6 9
(1, 3), (1, 4), (2, 1), (2, 3), (3, 2), (3, 4),(4, 2), (4, 3)}.
23 1 3 3 Draw the graph and its equivalent Hasse diagram for divisibility on the set: {1,2,3,6,12,24,36,48} 6 10
24 1 3 3 Find inverse function of the function y = 1 -X ^2 . 6 11
LetA = {1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 18, 24}be ordered by the relation X divides Y (Y
25 1 3 3 6 12
divided by X).Show that the relation is a partial ordering and draw Hasse diagram.
Unit 3:Permutation Combination and Discrete Pobability
26 NO 1 3 Find the smallest number of people you need to choose at random so that the probability 6 1
27
need to define1 3 thatclub
A at least
has 25twomembers
of them:(i) were
How both bornways
many on April 1 exceeds
are there ½. Assume
to choose number of
four members of the
days 6 2
28 1 3 in year
club
Tickets as 366on
to numbered
serve Daysan executive
1 to 20 are committee
mixed up and ? then a ticket is drawn at random. What is 3 3
29 1 3 (ii)
In aHow
the box,many
probability ways
there that 8are
are the there
ticket
red, to choose
drawn
7 blue and a number
president,
has6 agreen vice is
which
balls. One president,
a multiple
ball secretary,
is picked orand
5 ?treasurer
ofup3 randomly. 3 4
of
What the isclub, where
theare no person
probability that itcan
is hold more
neither red ofthangreen
nor one office
? ?
30 1 3 Two cards drawn together from a pack 52 cards.Determine the probability that one 4 5
31 1 3 is
Threea spade and one
unbiased coinsis are
a heart.
tossed. What is the probability of getting at most two heads ? 2 6
32 1 3 Solve for the permutations can be made out of the letters 6 7
33 1 3 i) INDEPENDENCE
Out of 4 officers and 10 clerks, a committee of 2 officers and 3 clerks is to be formed. In how 6 8
ii) COMPUTER
many
What ways
is no ofcommittee can be done
ways of choosing if: 1)from
4 Cards Any officer and52any
a pack of clerk cards?
playing can be In
included,
how many 2) Aofparticular
these
iii)Four
clerk
a) INDIA
must be are
cards in committee,
of same suit3) A particular officer can not be in committee.
b) Four cards belongs to different suits
34 1 3 c) Are Faced cards 6 9
d) Two are red cards and two are Black cards
e) Cards are of Same colour

35 1 3 Suppose license plate contains 2 English letters followed by4 digits :(i) How many 6 10
different license plates can be manufactured if repetition of letters and digits are allowed ?
(ii) How many plates are possible if only the letters are repeated
 Suppose that a department contains 10 men and 15 women. How many ways are there to form a
36 1 3 committee with six members if it must have the same number of men and women? 6 11

Suppose that Gopal selects a ball by first picking one of two boxes at random and then selecting a
ball from this box at random.The first box contains two white balls and three blue balls, and the
37 1 3 second box contains four white balls and one blue ball. What is the probability that Gopal picked a 6 12
ball from the first box if he has selected a blue ball?

Out of 5 males and 6 females, a committee of 5 is to form.Find the number of ways in

38 1 3 which it can be formed so thatamong the person chosen in the committee there are :(i)
Exactly 3 male and 2 female.(ii) At least 2 male and one female.
Define Conditional Probability and solve the following example.
In a college 25% students failed in Maths, 15% failed in Physics and 10% students failed in both
39 1 3 Maths and Physics.A student is selected randomlythen what is the probability that 6 13
a) If he failed in physics, he also failed in Maths
b) He failed in Maths or Physics
Unit 4: Graphs
40 2 4 3 Draw the graph and its equivalent Hasse diagram for divisibility on the set :{1, 2, 3, 6, 12, 24, 6 1
36,
State48}
the theorems for presence of Euler path and circuit in a graph. Justify whether the
graphs contain the following properties. If yes, write the path and circuit :(i)Euler path (ii)
Euler circuit (iii) Hamiltonian path (iv) Hamiltonian circuit.

41 2 4 3 6 2

Find minimum cut set and value of vertex connectivity of the following graphs.

42 2 4 3 6 3

Find the shortest path from vertex a to z in the following graph :

43 2 4 3 6 4

Define Isomorphic Graphs. Show that the following graphs G1 and G2 are isomorphic.

44 2 4 3 6 5

How would you find shortest path from a to f

45 2 4 3 7 6

46 2 4 3 How would you draw K6 and K33 and find if they are isomorhic Graphs or not 7 7
47 2 4 3 Give the definition and Conditions for existance of Eulerian and hamiltonian path and circuit 6 8
2 3 Find the shortest path between a – z for the given graph using Dijkstra’s algorithm. 9

48 4 6
2 3 10
 Write a Short Note on Graph Colouring. Find the chromatic number of following graph

49 2 4 3 6 11

Unit 5: Trees
50 2 5 3 Suppose 1000 people enter a chess tournament. Use a rooted tree model of the tournament 7 1
51 2 5 3 to determine
How many edgeshow does
many agames must betree
full binary played
withto1000
determine a champion, if a player is eliminated
internal 6 2
52 2 5 3 after onehave
vertices
Represent loss
the?and games are(x played
expressions + xy)until only one
+ (x/y) and entrant
x+((xy has not lost.
+ x)/y) using(Assume there are
binary trees.Write 7 3
no ties.)
these expressions in : to
(i)prefix
53 2 5 3 Use Huffman coding encodenotation (ii)postfix
these symbols notation
with given (iii)infix
frequencies : notation. 6 4
a : 0.20,
Find the bminimum
: 0.10, c :spanning
0.15, d : tree
0.25,and
e : 0.30.What
weight of itis for
the the
average
given number of bits
graph using required to
Kruskal’s
encode a character ?
algorithm

54 2 5 3 7 5

Define optimal tree. For the following set of weights, construct optimal binary prefix code.
55 2 5 3 For each weight in the set, give corresponding prefix code : 1, 4, 8, 9, 15, 25, 31, 37. 6 6

Find the maximum flow for the following transport network.

56 2 5 3 7 7

Find the fundamental system of cut set for the graph G shown below with respect to the
spanning tree T

57 2 5 3 6 8

Determine the preorder and postorder traversal of the following tree

58 2 5 3 7 9

Construct the minimum spanning tree and weight of it for the given graph using kruskals
algorithm

59 2 5 3 6 10

What is optimal Binary Tree?Explain Huffman algorithm, construct optimal tree for weights
60 2 5 3 8,9,10,11,13,15,22. Also generate optimal prefix code. 7 11

For the following set of weight construct optimal binary prefixcode.A = 5, B = 6, C = 6,

61 2 5 3 D = 11, E = 20 7 12
Using Prim’s algorithm to find minimum spanning tree. Take a as staring vertex

62 2 5 3 6 13

Construct the labelled tree of the following algebraic expression :(((X + Y) * Z) / 3) + (19 +
63 2 5 3 (X * X)) 7 14
 Find the fundamental cutsets of the following graph with respectto given spanning graph

64 2 5 3 15

How many leaves does a full 3-ary tree with 40 vertices have? IIIustrate with suitable diagram.
65 2 5 3 6 16
What is prefix-free code? Which of these codes are prefix- free codes?
66 2 5 3 i) a:0, e: 1, t: 01, s: 001 ii) a : 101, e : 11, t : 001, s : 011, n :010 7 17
Determine the order in which preorder, inorder and postorder traversal visit the vertices in given
67 2 5 3 ordered tree. 6 18
Construct a Binary tree with the inorder traversal as 3,5,6,7,10,12,13,15,16,18,20,23 and preorder
68 2 5 3 traversal as 15,5,3,12,10,6,7,13,16,20,18,23 6 19
Unit 6:Algebric Structures (Groups and Rings)
69 NO 6 3 What is abelian group ? Show that (Z6, +) is an AbelianGroup ? 7 1
70
need to define6 3 Find the hamming distance between code words of : C = {(0000), (0101), (1011), (0111)} 6 2
Rewrite
Let R = the
{0º,message by 180º,
60º, 120º, adding240º,
even300º}
parityand
check
* =bitbinary
and odd parity check
operation,so that bit
for a and in R,
a * b is overall angular rotation corresponding to successive rotations by a and then by b.
71 6 3 7 3
Show that (R, *) is a Group.

Let G = {even, odd} and binary operation be defined as :

72 6 3 6 4
Show that (G, ©) is a group.

73 6 3 Let Q1 be the set of all rational numbers other than 1.Show that with operation * defined 7 5
74 6 3 on
Let the
I besettheQ1set
by of(a*all
b =integers.
a + b – ab)
Foriseach
an Abelian group
of the following 6 6
determine
Let Zn be whether
the set *of isintegers
an associative
{0, 1, 2,operation
......., n– or
1}.not
Let © be a binary operation on Zn
(1) athat
such * b = max(a, b)
(2) . abe* ab binary
Let = min(x + 2, b)on Zn such that :ab = the remainder of ab divided by n Show
operation
(3) a(Zn,
that * b© =, .a ) –is2bRing
75 6 3 (4) a * b = max(2a – b, 2b – a). 7 7

76 6 3 Consider the (2, 7) encoding function e 6 8

77 6 3 e(00)
Explain= : 0000000
i) Ring ii) Integral Domain iii) Field 6 9
78 6 3 e(01) = 1010101
Consider an Algebric System ( G ,*) where G is the set of all non zero real nos and * is a binay 6 10
e(10) = 0111110
operationGroup
defined by a*b= ab/4. Will youIsomorphism
recommend and
that Group
( G ,*)Automorphism
is an Abelian group.
79 6 3 Explain Homomorphism, Group 6 11
e(11) = 0110110
80 6 3 Find No ofthe
(a) Find codes generated
minimum by the given
distance of e check matrix H, also evaluate all the codewords 6 12
81 6 3 generated.
Define
(b) How themany
following
errors:(i) H=
will 1 1 0(ii)
Group
e detect 1 ?0Monoid(iii)
0 Abelian Group 6 13
82 6 3 0 1 1R0=1 0{0º, 60º, 120º, 180º, 240º, 300º}and * = binary operation, so that for a and b in
Let 7 14
1
R,0a1 *bis
0 0 1overall angular rotation corresponding to successive rotationsby a and then by b.
83 6 3 Show that (G, +8) is an abelian group where :G = {0, 1, 2, 3, 4, 5, 6, 7}. 6 15
84 6 3 Show that
Show that (F,
(R, +,*)*)isis aa Group.
field where F is set of all rational numbers and + and * are ordinary 7 16
addition and multiplication operators ?