Discrete Structures (CS

Indian Institute of
203)
End Semester Exam
Technology Dharwad
80 pointa
Time: 180 mins
November 17, 2023

Important Instructions
lucluding smartwatches, are not allowed.I you are orm, you will be
" disnissed
Any from
electronic items,
the course straight away. No excuse wl be entertained. caught cheating in any
before using, if necessary. Blindly using won' 't be consjdered as a
right answer.
. DEFNE all your notations
ONLY
notations
ElGHT full questions. the irst will be considered
for
e Answer exactly any eight answers
evaluation.
C=5
distribution: a = 2 points, b = 3 points, points.
" Points
election is decided and
the propositions "The The been counted," respectively.
1. (a) Let pand
Express each of these compound propositions as an English sentence. i)votesp have
q be

AN Dafne the term contingency in propositional loge. Vernty it(p-r)a(gr)= (pvg) +rusing truth table.
ildentify the error or errors in this argument that supposedly shows that if Vz(P(z) VQ(=) is true then
trP(z) VVQ(z) is true. Premise
1. Yz(P() vQ()) Universal instantiation from (1)
2. P(c) v Qc)
3. P(c)
Simplification from (2)
4. VP()
Universal generalization from (3)
Simplification from (2)
5. Q(c) Universal generalization from (5)
6. VrQz)
7. Vr(P(z) VYzQ(z) Conjunction from (4) and (6)
ii. Justify the rule of universal transitivity, which states that i Vz(P(z)’ ) ) and Vz(0(r)’R(z)) aAre
quantifers are the same.
true, then tz(P(z)’ R(z)) is true, where the domains of all
2. (a) The inbabitants of an island are knights and knaves. Knights always tell the truth and knaves alwravys lhe. You
encounter two people, A and B. Determine, if possible, what A and B are if they address you in the wavs
any conclusions?
described. If you cannot determine what these two people are, can you draw
says "A is a knave.
Asays "The two of us are both knights" and B
tautology using aseries
(b) Define the term satisfable in a compound proposition. Show that (p^g) ’ (pVg) is a
of logical equivalences.
(c) Use strong induction to show that every positive integer n can be written as a sum of distinct powers of two,
=2,2 = 4, and so on.
that is, as a sum of asubset of the integers 20 =1,2
ways as you can to show that two
3. (a) Explain what it means for two sets to be egual. Describe as nany of the
sets are equal.
functjon f(n) = 10-n from
(b) Define the inverse of a function. When does a function have an inverse? Does the
the set of integers to the set of integers have an inverse? If so, what is it?
(c) Show that the set of irational numbers is an uncounable set.
4. (a) Define what it means for a function from the set of psitive integers to the set of positive integers o be cnd
one-o-one
Give an eKAmple of a function from the set of positive integers to the set of positive integers that is
but not onto,

(b) Show in at least two diferent ways that the seth A- (BnC) and (A - B)U(A -C) are equal
(c) Show that a subset of an antisvnmetric relatio is also antisymmetric.
5. (a) Find n if P(n, 4) = 12P(n, 2)
circular if and
(b) Arelation Rs called circular if aRb and bRe mply that cRa, Show that Ris refexive and
only if it is an equivalence relation.
 Discrete Structures (CS 203)
Indian Institute of Technology Dharwad
80 points Time: 180 mins
End Semester Examn
November 17, 2023

will be
Important Instructions form, you
in any
not allowed. If you are caught cheating
are will be entertained.
" Any electronic items, including smartwatches,
Noexcuse right answer.
dismissed from the course straight away. considered as a
Blindly using notations won't be considered for
" DEFINE all your notations before using, if necessaly* will be
ONLY the first eight answers
" Answer exactly any EIGHT full questions.
evaluation.
c= 5 points.
" Points distribution: a = 2 points, b=3 points, counted,"
respectively.
aloction is decided" and "The votes have been
1. (a) Let pand qbe the propositions "The as an English sentence. i) p ai) -q
D
truthtable.
Express each of these compound propositions ’ r using
term contingency in propositional
logic. Verify if (p ’ r) ^(9 ’r)=(pVq) Q)) is true then
(b) Define the supposedly shows that if Yr(P(r) V
errors in this argument that
(C) 1. ldentify the error or
tP(z) v VQ() is true.
1. Ve(P() v Q(z)) Premise (1)
2. P(c) v Qc) Universal instantiation fron
Simplification from (2)
3. P(c) (3)
4. YtP() Universal generalization from
Simplification from (2)
5. Q(c) Universal generalization from (5)
6. VzQ() Conjunction from (4) and (6)
7. Ya(P(c) v YzQ(z)
that if Vr(P(z) ’ ( ) )and tz(Q(z) ’ R(z)) are
universal transitivity, which states same.
iü. Justify the rule of true, where the domains of all
quantifiers are the
true, then Vz(P() ’ R(t)) is You
tell the truth and knaves always lie. ways
(a) The inhabitants of an island are knights and knaves. Knights always are if they address you in the
2. if possible, what A and B
encounter two people, A and B. Determine, two people are, can you draw any conclusions?
what these
described. If you cannot determine
knights" and B says "A is a knave. "
A says "The two of us are both atautology using a serics
proposition. Show that (p^g)’ (pVg) is
(b) Define the term satisfiable in a compound
of logical equivalences. as a sum of distinct powers of two.
Use strong induction to show that every positive integer n can be written
(c) 2, 2 = 4, and so on.
subset of the integers 20 = 1,2'=
that is, as a sum of a
ways as you can show that two
to be equal. Describe as many of the
3. (a) Explain what it means for two sets
sets are equal. -n from
function have an inverse? Does the function f(n) = 10
(b) Define the inverse of a function. When does aan inverse? If so, what is it?
integers have
the set of integers to the set of
numbers is an uncounzable set.
(c) Show that the set of irrational
pTsitive integers to the set of positive integers to be onto.
A (o) Defne what it means for a function from the set of the set of positive integers that is one-to-one
Cive an example of a function from the set of positive integers to
but not onto.
and (A - B) U(A-C) are equal.
(b) Show in at least two diferent ways that the sets A - (BNC)
is also antisymmetric.
(c) Show that a subset of an antisymmetric relation
12P(n, 2)
5. (a) Find n if P(n, 4) = and
R is called circular if aRb and bRc imply that cRa. Show that R is refexive and circular if
Arelation
(b) only if it is an equivalence relation.

1
 using generating
Salve the reueuce relation a. = Ba, oke 1,2, 3, nd hiial condittan an = 2
functions.
cnpty?
many ways are nere to put nidentica) obnct8 into m distinct contaitere 8o that no container is
6. (a) How grcater than 1.
ib) Prove using matematical induction that n ci, 2)=(ntl,) whonever nis an integer = 8.
solution Or and az
(c) Find the the recurrencoe rolationa- 3dn-10n-2 T n-3+1 if as 2, a1= 4,
are scatcd
(a) How many ways are there to seat six bovs and oght girls in a row of chairs 80 that no two boys
7. other?
next to each
What is the will be at nnst 10 cnployccs in onc
(b) department minimun number
of employees in ACompany so unat there
and the departments are HR, Marketing, Tech, and Support?
(c) How many positive integers less than 1000
i. have an odd number of decimal digits?
ii have at least one decimal digit equal to 9?
backward)?
ii. aree palindromes (that is, read the same forward and
graph.
8. (a) Describe
three different
methods that can be used to represent a
(b) Determine whether two given graphs are isomorphic.

chessboard so that no two queens Can

(c) The n-queens problem asks how n oueens can be placed on an n x n
attack one another. How can backtracking be used to solve the 4-queens problem?
9. (a) What is a bipartite graph? Which of the granhs K..Ca, and W, are bipartite? Explain.
are distinct vertices in the graph, exactly one of
(b) A tournament is a simple directed granh such tbat if u and v tournaments are there with n vertices?
(., u) is an edge of the graph. How many different
(2, d) and
(c) Use Prim's algorithm to find a minimum spanning tree for the given weighted graph.
C

10. (a) Prove that there are at most m" leaves in an m - ary tree of height h.
adjacent regions have the same
(b) Find the chromatic number for graph G, then color the map so that no two
color.

pairs of towns are

(c) The roads represented by this graph are all unpaved. The lengths of the roads between
represented by edge weights. Which roads should be paved so that there is a path of paved roads between
each pair of towns so that a minimum road length is paved? Use Kruskal's algorithm.
Manhattan

55
Tonopàb Warrm SpYíngs

Dyer Silver Pea

Goldfield

Lida
Oasis 12 70

Deep Spríngs Gold

Point
Beaty