SRI INDU COLLEGE OF ENGG & TECH

Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

UNIT I-MATHEMATICL LOGIC :Statements and Notation, Connectives, Normal Forms, Theory of
Inference for the Statement Calculs, The Predicate Calculus, Inference Theory of the Predicate Calculus.
MultiplechoiceQuestions Course
BTLevel Outcome
1C-1 Whichofthefollowingstatementisa proposition? ( )
1 CO1
a)Getmeaglassof milkshake b)Godbless you!

c)Whatisthetimenow? d)Theonlyoddprimenumberis2

1C-2 Whichofthefollowingbitsisthenegationofthebits“010110”? ( )
1 CO1
a)111001 b) 001001

c)101001 d)111111

1C-3 If P→qislogicallyequivalent to ( )
2 CO1
a)¬p∨¬q b)p∨¬q

c)¬p∨q d)¬p∧q

1C-4 The statement, “At least one of your friends is perfect”. Let P (x) be “x is
2 CO1
perfect” and let F(x) be“xisyour friend”andletthedomainbeallpeople. ( )
a)∀x(F(x)→P(x)) b)∀x (F(x) ∧P(x))

c)∃x(F(x)∧P(x)) d)∃x(F(x)→ P(x))

 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

p↔qislogicallyequivalent to ( ) 2 CO1
1C-5
a)(p → q)→(q →p) b)(p→ q)∨(q →p)

c)(p → q)∨(q→p) d)(p∧q)→(q∧p)

1C-6 “The product of two negative real numbers is not negative.” Is given by? 2 CO1
( )
a) ∃x ∀y((x<0) ∧ (y < 0) → (x y >0) )b) ∃x ∃y ((x < 0) ∧ (y < 0) ∧ (x y > 0))
c) ∀x ∃y((x<0) ∧ (y < 0) ∧ (x y >0))d) ∀x ∀y ((x < 0) ∧ (y < 0) → (x y > 0))

1C-7 Which of the following is correct with respect to precedence of logical 5 CO1
operators ( )?

a) ↔, →, ^, v, ~ b) v, ^, ↔, →,
~
c) ~, ^, v, →, ↔ d) →, ^ ~, ↔,
v
1C-8 A compound proposition that is always tautology ( ) 2 CO1
a) True b) False
c) Both d) None

1C-9
2 CO1
p ∧ q is logically equivalent to ( )
a) (p →¬ q) b) (¬p → ¬q)

c) ¬ (p →¬q) d) (¬p → q)
1C-10 Let P (x) denote the statement “x >7.” Which of these have truth value true? 3 CO1
( )

a) P (0) b) P (4)
c) P (6) d) P (9)
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

1C-11 Thecompoundpropositionspandqarecalledlogicallyequivalentthenitisa tautology ( 2 CO1

)
a) p↔ q b) p→ q
c) ¬(p∨ q) d) ¬p∨ ¬q

1C-12 State rule of inference 1 CO1

~q p
—>q

~p 2

a)Modusponens b)ModusTollens

c)Addition d)None

1C-13 Thepremises(p∧q)∨randr→simplywhichoftheconclusion? ( ) 1 CO1

a)p∨r b)p∨s

c)p∨q d)q∨r

1C-14 Thecontrapositiveofp→qisthepropositionof ( ) 2 CO1

a)¬p→¬q b)¬q→¬p
c)q→p d)¬q→p

1C-15 Let P: We should be honest., Q: We should be dedicated., R: We should be

1 CO1
overconfident.Then‘Weshouldbehonestordedicatedbutnotoverconfident.’isbest
represented by ( )

a)~P V ~QVR b) P∧~Q∧R

c) PVQ∧R d) PVQ∧~R

Fillintheblanks
1F-1 isthe proposition“if pthenq”
2 CO1
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

1F-2 The Proposition q -> pis called ofp->q 2 CO1

1F-3 Acompoundpropositionthatisneitheratautologynoracontradictioniscalled 1 CO1

1F-4 AnOccurrenceofavariablethatisnotboundbyaquantifierorsetequaltoaparticularvalue is 1 CO1

said to be

1F-5 The part of the logical expression to which a quantifier is applied is called the of CO1
4
quantifier
1F-6 isasequenceofstatementsthat endwithaconclusion 3 CO1
1F-7
A isastatementthatisbeingproposedtobeatruestatementusuallyonthe 2 CO1
basis of some partial evidence

1F-8 Commonformsof incorrectreasoningiscalled

2 CO1
1F-9 The converse ofp → qis the proposition of CO1
3

1F-10 ∀x p(x)is the same as 2 CO1

1F-11 isdefiningtheobjectinstatement
1 CO1
1F-12 The symbol of rule UG is 2 CO1
1F-13 Formulaofdistributive lawis 2 CO1
1F-14 FullformofPDNFis 2 CO1
1F-15 The logic basedonthe analysisof predicateiscalled 1 CO1

Matchthefollowing
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

1M-1 Matchthe following

2 CO1
a) Conjunction ( ) i) Itisalways false
b) Disjunction ( ) ii) CombinationofbothT&F
c) Tautology ( ) iii) P∧Q
d) Contradiction ( ) iv) PVQ
e) Contingency ( ) V)Itisalways true
1M -2 Matchthe following
2 CO1
)Commutativelaw ( ) i) pV(q∧r)⟺(pVq)∧(pV r)
b) Demorganslaw ( ) ii) p∧(q∧r)⟺(p ∧q)∧r
c) Associativelaw ( ) iii) [pV(p∧q)]⟺p
a) Distributive law ( ) iv) (pVq)⟺ (qVp)
b) Absorptionlaw ( ) v) ~(p∧q)⟺~pV ~q

1M -3 Matchthe following
3 CO1
a) DNF ( ) i) Premises
b) CNF ( ) ii) ∃
c) Universal quantifier ( ) iii) ∀
d) Existential quantifier ( ) iv) Sum ofelementaryproduct
(p1∧p2∧p3∧…………∧pn)→C ( ) v) Productofelementarysum
1M -4 Matchthe following
2 CO1
a) Modusponens ( ) i)[~p∧(p→q)]→~p
b) Modustollens ( ) ii) (p∧q)→p
c) Disjunctivesyllogism ( ) iii) [p∧(p→q)]→q
d) Simplification ( ) iv) [(p→q)
e) Hypotheticalsyllogism ( ) ∧(q→r)]→(p→r) V)
[(pVq)∧~q]→q
1M -5 Matchthe following
1 CO1
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

1M.1 a) Rule-p( ) i)P(t)forall t ∀(x)[p(x)] 1

1M.2 b) Rule-ES ( ) ii)R→S

c) Rule-US ( ) iii)IntroduceatanystepinDerivation
1M.3
d) Rule-CP ( ) iv)∃(x)[p(x)] p(t) forsomet
1M.4 e) Rule-UG ( ) v)∀(x)[p(x)]
P(t)forallt
1M.5

UNIT I-MATHEMATICL LOGIC : Statements and Notation, Connectives, Normal Forms, Theory of
Inference for the Statement Calculs, The Predicate Calculus, Inference Theory of the Predicate Calculus.
PART-A
Bloom’s Course
Q No Question Taxonomy Outcomes
s Level
1. Construct the truth table for the compound proposition 1 CO1,
(𝑝→𝑞)↔(¬𝑝→¬𝑞). (remembering) CO6
2. Construct the truth table for the compound proposition (𝑝→𝑞)→(𝑞→𝑝). 2 CO1,
(understanding) CO6
What are the contra positive, the converse and the inverse of the CO1,
3. 2
conditional statement “If you work hard then you will be rewarded”. CO6
(understanding)
4. Find the truth table for the statement 𝑝→¬𝑞. (remembering) 1 CO1,CO6
Write the symbolic representation and give its contra positive statement CO1,CO6
6. 2
of “If it rains today, then I buy an umbrella”. (understanding)
7. When do you say that two compound propositions are equivalent ? 1 CO1,CO6
(remembering)
8. Show that (~𝑟)ᴧ(𝑞→𝑟), (𝑝∨ 𝑞)→𝑟are logically equivalent. (remembering) 1 CO1,CO6
9. Gi ve an indirect proof of the theorem “If3𝑛+2 is odd, then n is odd. 6 CO1,CO6
(creating)
10. Prove that 𝑝, 𝑝 → 𝑞, 𝑞 → 𝑟⟹𝑟 (Applying) 3 CO1,CO6
PART–B
1.(a) 𝑝𝑟𝑜𝑣𝑒 𝑡ℎ𝑎𝑡 [(𝑝 ∨ 𝑞) ∧∼ (∼ 𝑝 ∧ (∼ 𝑞 ∨∼ 𝑟))] ∨ (∼ 𝑝 ∧∼ 𝑞)
2 CO1
∨ (∼ 𝑝 ∧∼ 𝑟)
𝑖𝑠 𝑎 𝑡𝑎𝑢𝑡𝑜𝑙𝑜𝑔𝑦
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

1. (b) 𝑠ℎ𝑜𝑤 𝑡ℎ𝑎𝑡 (𝑝 → 𝑞), (𝑟 → 𝑠), (𝑞 → 𝑡), (𝑠 → 𝑢), ∼ (𝑡 ∧ 𝑢), (𝑝 → 𝑟) ⇒ ∼ 2 CO1

𝑝
Define Tautology. Draw the truth table for tautology. CO1,CO6
2(a) 2
2(b) State the Laws of Logic. 2 CO1,CO6

3. (a) Find the DNF of the following p→{( p→ q) ^ ~( ~q v ~p)} 6 CO1,CO6

3.(b) Find CNF of the following [~(pvq) ↔(p^q) ] 2 CO1,CO6

4.(a) Show that (~𝑃ᴧ (~𝑄ᴧ𝑅)) ∨ (𝑄ᴧ𝑅) ∨ (𝑃ᴧ𝑅) ⇔ 𝑅 without using truth table. 1 CO1,CO6
(remembering)
4.(b) Show that ∀𝑥𝑃(𝑥)ᴧ∃𝑥𝑄(𝑥) is equivalent to ∀𝑥∃𝑦(𝑃(𝑥)ᴧ𝑄(𝑦)) 1 CO1,CO6
(remembering)
5. 𝑆𝑡𝑎𝑡𝑒 𝑡ℎ𝑒 𝑐𝑜𝑛𝑣𝑒𝑟𝑠𝑒, 𝑖𝑛𝑣𝑒𝑟𝑠𝑒 𝑎𝑛𝑑 𝑐𝑜𝑛𝑡𝑟𝑎𝑝𝑜𝑠𝑖𝑡𝑖𝑣𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 2 CO1,CO6
𝑐𝑜𝑛𝑑𝑖𝑡𝑖𝑜𝑛𝑎𝑙:
(1)
𝑖𝑓 𝑎 𝑞𝑢𝑎𝑑𝑟𝑖𝑙𝑎𝑡𝑒𝑟𝑎𝑙 𝑖𝑠 𝑎 𝑝𝑎𝑟𝑎𝑙𝑙𝑒𝑙𝑜𝑔𝑟𝑎𝑚, 𝑡ℎ𝑒𝑛 𝑖𝑡𝑠 𝑑𝑖𝑎𝑔𝑜𝑛𝑎𝑙𝑠 𝑏𝑖𝑠𝑒𝑐𝑡 𝑒
𝑜𝑡ℎ𝑒𝑟
(2)
𝑖𝑓 𝑎 𝑟𝑒𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑥2 𝑖𝑠 𝑔𝑟𝑒𝑎𝑡𝑒𝑟 𝑡ℎ𝑎𝑛 𝑧𝑒𝑟𝑜, 𝑡ℎ𝑒𝑛 𝑥 𝑖𝑠 𝑛𝑜𝑡 𝑒𝑞𝑢𝑎𝑙 𝑡𝑜 𝑧
(3)
𝑖𝑓 𝑎 𝑡𝑟𝑖𝑎𝑛𝑔𝑙𝑒 𝑖𝑠 𝑛𝑜𝑡 𝑖𝑠𝑜𝑠𝑐𝑒𝑙𝑒𝑠, 𝑡ℎ𝑒𝑛 𝑖𝑡 𝑖𝑠 𝑛𝑜𝑡 𝑒𝑞𝑢𝑖𝑙𝑎𝑡𝑒𝑟𝑎𝑙.

6. (a) Prove the argument is valid ∀𝑥,[𝑃(𝑥){q(x)∧r(x)}] 5 CO1,CO6

∀𝑥,[𝑃(𝑥)∧s(x)]

‫𝑥∀ ؞‬,[r(𝑥)∧s(x)] (creating)

6.(b) Prove that (𝑃⟶𝑄) ᴧ(𝑅⟶𝑄)⇔(𝑃∨𝑅)⟶𝑄) (creating) 6 CO1,CO6
7 𝑐𝑜𝑛𝑠𝑖𝑑𝑒𝑟 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑝𝑟𝑜𝑝𝑜𝑠𝑖𝑡𝑖𝑜𝑛𝑠 𝑐𝑜𝑛𝑐𝑒𝑟𝑛𝑒𝑑 𝑤𝑖𝑡ℎ 𝑎 𝑐𝑒𝑟𝑡𝑎𝑖𝑛 𝑡𝑟𝑖𝑎𝑛 1 CO1,CO6
𝐴𝐵𝐶
𝑝: 𝐴𝐵𝐶 𝑖𝑠 𝑖𝑠𝑜𝑠𝑐𝑒𝑙𝑒𝑠. 𝑞: 𝐴𝐵𝐶 𝑖𝑠 𝑒𝑞𝑢𝑖𝑙𝑎𝑡𝑒𝑟𝑎𝑙. 𝑟: 𝐴𝐵𝐶 𝑖𝑠 𝑒𝑞𝑢𝑖𝑎𝑛𝑔𝑢𝑙𝑎𝑟.
𝑤𝑟𝑖𝑡𝑒 𝑑𝑜𝑤𝑛 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑐𝑜𝑚𝑝𝑜𝑢𝑛𝑑 𝑝𝑟𝑜𝑝𝑜𝑠𝑖𝑡𝑖𝑜𝑛𝑠 𝑖𝑛 𝑤𝑜𝑟𝑑𝑠.
(1) 𝑝 ∧ (∼ 𝑞) (2) (∼ 𝑝) ∨ 𝑞 (3) 𝑝 → 𝑞 (4)𝑞 → 𝑝 (5) (∼ 𝑟) → (∼ 𝑞)
8.(a) Prove that the premises p∨q,(p∨q)r,~r are inconsistent. (creating) CO1,CO6
6
8.(b) Without using truth table find PCNF and PDNF of (Applying) 3 CO1,CO6
[𝑃⟶ (𝑄ᴧ𝑅)] ᴧ [¬𝑃 → (¬𝑄ᴧ ¬𝑅)].
9.(a) 𝑠ℎ𝑜𝑤 𝑡ℎ𝑎𝑡 𝑝 𝑓𝑟𝑜𝑚 𝑡ℎ𝑒𝑠𝑒 𝑝𝑟𝑒𝑚𝑖𝑠𝑒𝑠 (∼ 𝑝 ∨ 𝑞) → 𝑟, 𝑟 1 CO1,CO6
→ (𝑠 ∨ 𝑡), (∼ 𝑠 ∧∼ 𝑢),
(∼ 𝑢 →∼ 𝑡) (remembering)
9.(b) Show that the premises “One student in this class knows how to write 1 CO1,CO6
program in JAVA”, and “Everyone who knows how to write the program
in JAVA can get a high paying job imply a conclusion “someone in this
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

class can get a high paying job”. (remembering)

10.(a Show that (¬𝑃⟶𝑅) ^ (𝑄 ↔ 𝑃) ⟺ (𝑃∨𝑄∨𝑅) ^ (𝑃∨ ¬𝑄∨𝑅) ^ (𝑃∨¬𝑄∨ ¬𝑅) ^ 1 CO1,CO6
) (¬𝑃∨𝑄∨𝑅) ^ (¬𝑃∨𝑄∨ ¬𝑅). (remembering)
10.(b Use the quantifiers to express following statements. (Applying) 3 CO1,CO6
) 1. There is a student in the class who can speak Hindi.
2. Every student in this class knows how to drive a car.
3. Some student in this class knows has visited Alaska but not
visited Hawaii.
4. All students in this class have learned at least one
programming language.

UNIT II - SET THEORY: Basic Concepts of Set Theory,Representation of Discrete Structures,

Relations and Ordering, Functions.
MultiplechoiceQuestions
2C-1 Anorderedcollectionofobjects
is ( 2 CO2
)
a)relation b)function
c)set d)proposition
2C-2 Thesubsetofpower
setofemptysethasexactly ( 2 CO2
)
a)one b) two
c)zero d)three

2C-3 Subsetoftheset
A={}is ( 2 CO2
)
a)A b){}
c)∅ d)All ofthementioned
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

2C-4 Ifxisasetandthesetcontainsanintegerwhichisneitherpositivenornegative, then

1 CO2
the set x is ( )
a)Setis Empty b)SetisNon -empty

c)SetisFinite. d)SetisbothNon-
emptyandFinite

2C-5 If x∈Nandxis prime,thenx is ()

3 CO2
a)Infiniteset b)Finiteset

c)Emptyset d)Nota set

2C-6 Whichof thefollowingisasubsetofset{1,2,3,4}? ()

1 CO2
a){1,2} b){1,2,3}

c){1} d) Allofthementioned

2C-7 Whichofthefollowingfunctionisnot amathematics function?

1 CO2
() a)manytoone

b)one-to-many

c)oneto one d)Allofthe mentioned

2C-8 Whichofthe followingfunctionisalsoreferredtoasaninjective function?()
1 CO2
a)Many-to-one b) Onto

c)One-to-One d)Noneofthementioned
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

2C-9 Thefunction(g-1Of-1)isif thefunction 1 CO2

fandgare

( )

a)Intofunction b)oneto one

function

c)ontofunction d)one-to-
manyfunction

2C-10
LetU={1,2,3,4,5}andA={1,3,5}thenAcis() 1 CO2
a){1,2} b){3,4}
c) {4,5} d){2,4}

2C-11 HowmanyrelationsexistfromsetXtosetYifthesetXandsetYhas7and8
elements ( 2 CO2
)

a)256 b)272

c)356 d)56
2C-12 Thenumberofreflexiveclosureoftherelation{(0,1),(1,1),(1,3),(2,1),(2,2),(3, 0)}
onthe set {0, 1,2,3} 2 CO2
is (
)

a)36 b)8

c)6 d)26
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

2C-13 ThenumberoftransitiveclosureexistsintherelationR={(0,1),(1,2),(2,2),( 3,4),

(5,3), (5,4)} where {1, 2, 3, 4, 5} ∈ A is 2 CO2

( ) a){(0,1),(0,2),(1,2),(2,2),(3,4),(5,3),

(5,4)}
b) {(0,0),(4,4),(5,5),(1,1),
(2,2),
(3,3)}

c) {(0,1),(1,2),(2,2),(3,4)}
d) {(0,1),(5,3),(5,4),(1,1),
(2,2)
}
2C-14 ArelationR onasetP issaidtobepartialorderingrelationifandonlyifR (
3 CO2
) a)Reflexive b)Transitive
c)Anti-Symmetric d)Alltheabove

2C-15 Accordingtothesymmetricmatrix,which ofthefollowingstatementis correct?

2 CO2
()

a)A=AT b)AllthediagonalelementsofasymmetricmatrixareOne.

c)A=-AT d)AllthediagonalelementsofasymmetricmatrixareZero

Fillinthe blanks
2F-1
{x: x∈Nand xisprime}then itis 1 CO2
2F-2 Twosetsarecalleddisjointifthere istheemptyset. 2 CO2

2F-3 Powersetofemptysethasexactly subset 2 CO2

2F-4 TherelationbetweensetsA,B,Casshownbyvenuediagramis 1 CO2
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

2F-5 LetthesetsbeA, B,C,Dthen(A∩B)X(C∩D)isequivalentto 1 CO2

2F-6
Thesetcontainingallthecollectionofsubsetsisknownas 2 CO2
2F-7 1
A function is said to be ifandonlyiff(a)=f(b)impliesthata= b
for all a and b in thedomain of f.
2F-8 3
Foraninversetoexistitisnecessarythatafunctionshouldbe

2F-9 Considertherelation:R’(x,y)ifandonlyifx,y>0overthesetofnon-zero 2 CO2

rational numbers, then R’ is
2F-10 LetsetA={1,2}andB={3,4}thenAXB(CartesianproductofsetAandB) is
1 CO2

2F-11 Ifasetcontains3elementsthen thenumberofsubsetsis

2 CO2

2F-12
Iff(x)=ythenf-1(y)isequalto 4 CO2
2F-13
Theinverseoffunctionf(x)=x3+2is 1 CO2
2F-14 If n(A)=20andn(B)=30andn(AUB)=40thenn(A∩B)is
5 CO2
2F-15 ThecardinalityofthesetA={1,2,3,4,6}is
2 CO2

Matchthefollowing
2M-1
1) Null set ( ) a)A⊆B 1 CO2
C
b) rU-A 2
2) single toneset ( ) A o
2
3)Subset ( ) c){a}
1
4)Universalset ( ) d) U
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

3
5) Complement set ( ) e){∅}

2M-2 1)Union ( ) a)A-B 1 CO2

2)Intersection ( ) b)AU B 2
3)Disjoint ( ) c) A∩B 1

4)Setdifference ( ) d)AXB 1

5) ( ) e)A∩B=∅ 3
Cartesianproduct
2M-3 1) Complement ( ) a) (Ac)c=A 1 CO2
2) Idempotent ( ) b) AUU=U&A∩ ∅=∅ 2
3)Domination ( ) c)A UAc =U 1
4)Identity ( ) d)AUA=A∩ A=A 2
5)Involution ( ) e)AU∅ =A 2
2M-4 1)Reflexive ( ) a) a, b∈Aand(a,b)∈Rthen(b, 2 CO2
2)Symmetric ( ) a)∈R b)a∈A&(a, a)∉R 3
3)Transitive ( ) c) (a, b)∈A&(a,b) ∈Rthen(b,a)∉R 2
4)Asymmetric ( ) d)a∈A& (a, a)∈R 1
5)Irreflexive ( ) e) (a,b)∈R&(b,c)∈RThen(a,c)∈R 1
2M-5 1)Identity ( ) a) f(x)=c 1 CO2
2)constant ( ) b) B
2
preimageofA c)
3)One-One ( ) 1
f(x)=x
4)Ontofunction ( ) 3
d) one-one&Onto
5)bijective ( ) 2
e) AimageinB
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

UNIT II - SET THEORY: Basic Concepts of Set Theory, Representation of Discrete Structures,
Relations and Ordering, Functions.
PART-A
1. What is Binary Relation? (understanding) 2 CO2
2. Define Equivalence Relation? (remembering) 1 CO2
3. Define Compatibility Relation? (remembering) 1 CO2
4. Write Partial Ordering Relation with example. (evaluating) 5 CO2
5. Define Function and types of Function (remembering) 1 CO2
6. Define Inverse Function (remembering) 1 CO2
7. Define set, subset, proper subset (remembering) 5 CO2
8. What is Unary, Binary, N-ary Structures ? (understanding) 2 CO2
9. Define Symmetric, Asymmetric, Anti Symmetric Relation. 1 CO2
(remembering)
10. What is Cartesian Product of a set? (understanding) 2 CO2
PART-B
1 Let A= {1,2,3,4,5,6,12,24,27,30}. On A, define the relation R by aRb if 6 CO2
and only if a divides b, prove that R is a partial order on A. Draw the Hasse
diagram for this relation.(creating)
2. Explain the properties of Equivalence relation with example. 2 CO2
(understanding)
3. Define and explain Hasse diagram pictorially with an 1 CO2
example.(remembering)
4. Explain Compatibility relation with example. (understanding) 2 CO2
5. Explain the properties of Partial ordering relation and give two examples. 2 CO2
(understanding)
6. Let A= {1, 2, 3, 4} and let R be the relation on A defined by xRy if and 6 CO2
only if “x divides y”, written X | y.
i) Write down R as a set of ordered pairs.
ii) Draw the diagraph of R.
iii) Determine in-degree and out-degrees of the each vertex.
(creating)
7 Consider the following relations on the set A = {1,2,3 } 1 CO2
R1 = { (1 ,1 ), (1 ,2 ), (1 ,3 ), (3 ,3 ) }R2 = { (1 ,1 ), (1 ,2 ), (2 ,1 ), (2 ,2 ),
(3
,3 ) } and R3 = { ( 1,1), (1 ,2 ), (2 ,2 ), (2 ,3 ) }. Which of these are
i) reflexive, ii) symmetric, iii) transitive, iv) anti symmetric?
(remembering)
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA
CHANDAR, ASST PROF

8 Let A ={ {1, 2, 3, 4 }, and R = { ( 1,1 ), (1 ,2 ), (2 ,1 ), (2 ,2 ), (3 ,1 ), (3 ,3 4 CO2

), (1 ,3 ), (4 ,1 ), (4 ,4 ) } be a relation on A. Is R an
equivalence relation?(analyzing)
9. Let A = {1,2,3,4,5,6} and B = {6,7,8,9,10}. If a function f:A->B is defined 3 CO2
by f= {(1 ,7 ), (2 ,7 ), (3 ,8 ), (4 ,6 ), (5 ,9 ), (6 ,9 ) } determine f-1(6) and
f-1(9). If B1 = {7,8 } and B2 = {8,9,10}, f-1(B1) and f-1(B2).(applying)
10 Draw the Hasse diagram for the poset (p(S),⸦) where 6 CO2
s={1,2,3,4}.(creating)
11 What is function and explain different types of functions with examples 2
( understanding)
12 Let f(x)=x+5 and g(x)=x2+1 then find out f-1og-1 and g-1of-1 5 CO2
(evaluating)
13 𝑙𝑒𝑡 𝐴 = {1,2,3}𝑎𝑛𝑑 𝐵 = {2,4,5}. 𝐷𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑒 𝑡ℎ𝑒 𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔: 5 CO2
(1)
|𝐴 × 𝐵 |
(2)
𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛𝑠 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵.
(3)
𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑏𝑖𝑛𝑎𝑟𝑦 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛𝑠 𝑜𝑛 𝐴.
(4)
𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛𝑠 𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵 𝑡ℎ𝑎𝑡 𝑐𝑜𝑛𝑡𝑎𝑖𝑛 (1,2) 𝑎𝑛𝑑 (1,5).
(5)
𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛𝑠 𝑓𝑟𝑜𝑚 𝐴, 𝐵 𝑡ℎ𝑎𝑡 𝑐𝑜𝑛𝑡𝑎𝑖𝑛 𝑒𝑥𝑎𝑐𝑡𝑙𝑦 𝑓𝑖𝑣𝑒 𝑜𝑟𝑑𝑒𝑟𝑒
𝑝𝑎𝑖𝑟𝑠
(evaluating)
14 𝐶𝑜𝑛𝑠𝑖𝑑𝑒𝑟 𝑡ℎ𝑒 𝑠𝑒𝑡𝑠 𝐴 = {𝑎, 𝑏, 𝑐} 𝑎𝑛𝑑 𝐵 = {1,2,3} 𝑎𝑛𝑑 𝑡ℎ𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛𝑠. 3 CO2
𝑅 = {(𝑎, 1), (𝑏, 1), (𝑐, 2), (𝑐, 3)} 𝑎𝑛𝑑 𝑆 = {(𝑎, 1), (𝑎, 2), (𝑏, 1), (𝑏, 2)}
𝑓𝑟𝑜𝑚 𝐴 𝑡𝑜 𝐵. 𝐷𝑒𝑡𝑒𝑟𝑚𝑖𝑛𝑒 𝑅̅ , 𝑆̅, 𝑅 ∪ 𝑆, 𝑅 ∩ 𝑆, 𝑅𝑐 𝑎𝑛𝑑 𝑆𝑐. (applying)
15 𝑖𝑓 𝐴 = {1,2,3,4}𝑎𝑛𝑑 𝑅, 𝑆 𝑎𝑟𝑒 𝑟𝑒𝑙𝑎𝑡𝑖𝑜𝑛𝑠 𝑜𝑛 𝐴 𝑑𝑒𝑓𝑖𝑛𝑒𝑑 𝑏𝑦 6 CO2
𝑅 = {(1,2), (1,3), (2,4), (4,4)} 𝑆 = {(1,1), (1,2), (1,3), (1,4), (2,3),
(2,4)}
𝑓𝑖𝑛𝑑 𝑅𝑜𝑆, 𝑆𝑜𝑅, 𝑅2, 𝑆2, 𝑤𝑟𝑖𝑡𝑒 𝑑𝑜𝑤𝑛 𝑡ℎ𝑒𝑖𝑟 𝑚𝑎𝑡𝑟𝑖𝑐𝑒𝑠. ( creating)
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

UNIT-III- ALGEBRAIC STRUCTURES: introduction, Algebaic Systems,

Semi groups and Monoids,
Lattices as Partially Ordered Sets, Boolean Algebra.

MultiplechoiceQuestions Course
BTLev Outcome
el
3C.1 Which of the following is NOT an algebraic structure? ( ) 1
a) Group CO3
b) Ring
c) Set
d) Field

3C.2 In a group, which property is NOT required to hold? ( )

2 CO3
a) Closure
b) Commutativity
c) Associativity
d) Identity element

3C.3 Which of the following structures is commutative? ( ) 1 CO3

a) Group
b) Ring
c) Field
d) Monoid

3C.4 For any set S if a*b=b*a, ∀a, b ∈S then * is said to be ( )

2 CO3
(a) Closed c) distributive
(b) Associative d) commutative
3C.5 A ring is a set equipped with two binary operations, addition and: ( ) 2
a) Multiplication CO3
b) Subtraction
c) Division
d) Exponentiation
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

3C.6 Which of the following is NOT a requirement for a ring to be a field? ( )

a) Commutativity under multiplication 2 CO3
b) Existence of additive inverses
c) Existence of multiplicative inverses
d) Closure under addition

3C.7 Which property does NOT necessarily hold in a ring? ( )

a) Associativity of multiplication 1 CO3
b) Distributive property
c) Closure under addition
d) Existence of identity element

3C.8 A group is Abelian if: ( )

a) It has a commutative binary operation
b) It has no identity element 1 CO3
c) It has no inverse elements
d) It is finite

3C.9 Which of the following is a non-example of a group? ( )

a) Integers under addition
b) Non-zero rational numbers under multiplication 1 CO3
c) Real numbers under addition
d) Positive integers under multiplication

3C.10 A monoid differs from a group in that: ( )

a) It has no identity element
b) It has no inverse elements 1 CO3
c) It is not associative
d) It does not have closure property

3C.11 Which of the following structures is NOT necessarily commutative? ( )

a) Group
b) Ring 1 CO3
c) Field
d) Monoid
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

3C.12 Which algebraic structure is defined by having one binary operation that is
both associative and commutative? ( )
a) Group 1 CO3
b) Ring
c) Monoid
d) Commutative ring

3C.13 Which of the following is a requirement for a group to be considered Abelian? ( )

a) Existence of identity element
b) Existence of inverses for all elements 1 CO3
c) Closure under the operation
d) Commutativity of the operation
3C.14 Which property does NOT necessarily hold in a monoid? ( )
a) Associativity
b) Commutativity 1 CO3
c) Existence of identity element
d) Closure

3C.15 The set of even integers under addition forms a(n): ( )

a) Abelian group
b) Cyclic group 1 CO3
c) Monoid
d) Ring

Fill In the Blanks Course

BTLevel Outcome
1 CO3
3F.1 In a group, every element must have a(n) .

A ring is a set equipped with two binary operations, addition and . 2 CO3
3F.2

3F.3 The set of integers under addition forms a(n) . 2 CO3

 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

3F.4 A monoid is a set with a binary operation that is and has an . 2 CO3

3F.5 In a field, every non-zero element must have a(n) . 1 CO3

3F.6 4 CO3
A commutative ring is also called a(n) ring.
3F.7 2 CO3
A group is said to be Abelian if its operation is .

3F.8 The set of rational numbers excluding zero under multiplication forms a(n) . 2 CO3

3F.9 A ring in which every non-zero element has a multiplicative inverse is called a(n) 2 CO3
.

3F.10 An algebraic structure that satisfies the properties of closure, associativity, 1 CO3
identity element, and inverses is called a(n) .

3F.11 In a ring, the property of holds for both addition and multiplication. 1 CO3

3F.12 A field is a set equipped with two binary operations where every non-zero element has II CO3
a(n) .

3F.13 A group is said to be if the operation is the same regardless of the order in 1 CO3
which elements are combined.

3F.14 The set of integers under multiplication does not form a group because it lacks the 2 CO3
property of .

3F.15 An algebraic structure that is a commutative ring with multiplicative inverses is 1 CO3
called a(n) .

MATCH THE FOLLOWING BT Level Course

Outcome
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

3M-1 II CO3
a) Least upper bound ( ) a) 4
b) properties of lattices ( ) b) ” a” joint “b”
c) (a ^b)’ ( ) c) a*a=a
d) Idempotent ( ) d) Algebraic structure
e) <S,*1,*2,……*k> ( ) e)𝑎′ ∨ 𝑏′
3M-2 a) A cyclic group is always ( ) a) associative property II CO3
b) Matrix multiplication is ( ) b) abelian group
c) A monoid is called a group ( ) c) For designing of the digital computers
d) Boolean algebra can be used ( ) d) Arithmetic logic
e) Algebra of logic is termed as ( ) e) (ac)=(ca)=e

3M-3 A) Meet semi lattice ( ) A) A*B=A*C=>B=C I CO3

B) Join semi lattice ( ) B)LUB
C)Cancellation property ( )
C)GLB
D)POSET ( ) D) partially ordered set
3M-4 A) LUB ( ) a)OR I CO3
B) GLB ( ) b)AND
C) POS ( ) c)SUM OF PRODUCT
D) SOP ( ) d)PRODUCT OF SUM
3M-5 I CO3
a) Commutative law ( ) A) (a*b)’=a’+b’
b) Distributive law ( ) B) a*a’=0
c) Identity law ( ) C) a*1=a
d) Complement law ( ) D) a*(b+c)=(a*b)+(a*c)
e) Demorgan law ( ) E)a+b=b+a
3M-6 a) Group ( ) a) A set equipped with two binary operations, addition
and multiplication, satisfying certain properties.
1 CO3
b) Ring ( ) b) A set with a single binary operation that is
associative and has an identity element.

c) Field ( ) c) A set with a single binary operation that is

associative, has an identity element, and every element has an
inverse.

d) Monoid ( ) d) A set with two binary operations, addition and

multiplication, where addition is commutative, and both operations satisfy certain
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

properties.

3M-7 a) Group ( ) a) Integers under addition

1 CO3
b) Ring ( ) b) Rational numbers under multiplication

c) Field ( ) c) Real numbers under addition

d) Monoid ( ) d) Non-zero rational numbers under multiplication

3M-7 A) Group ( ) a) Existence of additive inverses

1 CO3
B) Ring ( ) b) Closure under addition and multiplication

C) Field ( ) c) Existence of multiplicative inverses for non-zero

elements

D) Monoid ( ) d) Associativity of the operation

3M-8 a) Semi group ( ) a) <G,*>

b) Group ( ) b)<S,+>
1 CO3
c) Monoid ( ) c) <R,+>
d) Ring ( ) d) <S,*>

3M-9 a) binary operation ( ) a) S×S×S×S×….×S to S

1 CO3
b) Algebraic structures ( ) b) S×S to S

c) n-ary operation ( ) c) <z,+>

d) commutative property ( ) d) < 𝑷(𝑺),∪,∩>

 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

3M-10 a) Intersection of 2 sub monoids of a monoid ( ) a)𝒂 ∗ 𝒙𝒓 = 𝒆

b) E is the set of all integers, < 𝑬, +,×> ( ) b) monoid
1 CO3
c) Left invertable ( ) C) commutative ring without unity
d) Right invertable ( ) d) 𝒙𝒍 ∗ 𝒂 = 𝒆

UNIT-III- ALGEBRAIC STRUCTURES: introduction, Algebaic Systems, Semi groups and

Monoids,
Lattices as Partially Ordered Sets, Boolean Algebra.

PART-A
1. 𝑤ℎ𝑎𝑡 𝑖𝑠 𝑏𝑖𝑛𝑎𝑟𝑦 𝑜𝑝𝑒𝑟𝑎𝑡𝑖𝑜𝑛? (understanding) 2 CO3
2. 𝑤ℎ𝑎𝑡 𝑖𝑠 𝒏 − 𝒂𝒓𝒚 𝒐𝒑𝒆𝒓𝒂𝒕𝒊𝒐𝒏 ? ( understanding) 2 CO3
3 𝑑𝑒𝑓𝑖𝑛𝑒 𝑠𝑒𝑚𝑖𝑔𝑟𝑜𝑢𝑝 𝑎𝑛𝑑 𝑎𝑏𝑒𝑙𝑖𝑎𝑛 𝑠𝑒𝑚𝑖𝑔𝑟𝑜𝑢𝑝? (evaluating) 5 CO3
4 𝑤ℎ𝑎𝑡 𝑖𝑠 𝑀𝑜𝑛𝑜𝑖𝑑? (understanding) 2 CO3
5 𝑑𝑒𝑓𝑖𝑛𝑒 𝐶𝑜𝑚𝑚𝑢𝑡𝑎𝑡𝑖𝑣𝑒 𝑅𝑖𝑛𝑔 (evaluating) 5 CO3
6 Define Lattice and Sub Lattice. (evaluating) 5 CO3
7 Define Total order. (evaluating) 5 CO3
8 Define Group. (evaluating) 5 CO3
9 Define Integral domain. (evaluating) 5 CO3
10 Define Commutative Ring. (evaluating) 5 CO3
11 Define Algebraic system with examples. (evaluating) 5 CO3
PART-B
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

1. Consider the set A = {1,2,3,4,5,6,7,8}and a partial order on A whose Hasse 3 CO3

diagram is as shown below. Consider the subsets B1= {1,2} and B2 =
{3,4,5} of A as shown in the figure below. Find LUB & GLB for B1, B2 ?

Fig 1 Fig 2 Fig 3

(applying)
2 On the set A={a,b,c,d}, a binary operation * defined as described in the 3 CO3
following table:

Is * commutative? Associative?
(applying)
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

3. On the set Q of all rational numbers, the operation * is defined by 4 CO3

a*b= a + b - ab. Show that, under this operation, Q forms a commutative
monoid.(analyizing)
4 3 CO3

(applying)

5. If N denotes the set of all natural numbers,and + and × are the usual 4 CO3
addition and multiplication operations, show that< 𝑁, +,× > 𝑖𝑠 𝑛𝑜𝑡 𝑎 𝑟𝑖𝑛𝑔.
(analyizing)
6 Explain Some Standard Algebraic Structures with example. (evaluating) 5 CO3
7. What is binary operation and write the properties of binary operations? 2 CO3
(understanding)
8.a Define group and abelian group (evaluating) 5 CO3
8.b 𝐿𝑒𝑡 𝐺 𝑏𝑒 𝑡ℎ𝑒 𝑠𝑒𝑡 𝑜𝑓 𝑎𝑙𝑙 𝑛𝑜𝑛 − 𝑧𝑒𝑟𝑜 𝑟𝑒𝑎𝑙 𝑛𝑢𝑏𝑒𝑟𝑠 𝑎𝑛𝑑 𝑙𝑒𝑡 𝑎 ∗ 𝑏 4 CO3
1
= 𝑎𝑏. 𝑠ℎ𝑜𝑤
2
< 𝐺,∗> 𝑖𝑠 𝑎𝑏𝑒𝑙𝑖𝑎𝑛 𝑔𝑟𝑜𝑢𝑝. (analyzing)

9. Write the properties of Lattices and explain special types of Lattices with 1 CO3
example. (remembering)

UNIT-IV: Elementary combinatorics: Basics of Counting, Combinations and permutations, Enumeration of

Combinations and Permutations, Enumerating Combinations and Permutations with Repetitions,
Enumerating Permutation with Constrained Repetitions, Binomial Coefficient, The Binomial and
Multinomial Theorems, The Principle of Exclusion.

Objective Questions Course

BT Outcome
Level
4C-1 Let H and T denotes head and tail side of an unbiased coin. Ankit tossed this coin III CO4
three times and wants at least two heads. How many such outcomes are possible?
a) 2
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

b) 3
c) 4
d) 5
4C-2 Determine the coefficient of the x5y7 term in the polynomial expansion of III CO4
12
(m+n) .
a) 792
b) 439
c) 382
d) 630
4C-3 In how many ways 5 students can be arranged to sit in an examination center with I CO4
9 seats?

a) 9P5

b) 5C5

c) 5!

d) 5P4

4C-4 A basket contains 5 oranges 8 apples and 7 guavas, in how many ways can 3 III CO4
fruits be chosen such that all the fruits are of different families?
a) 240
b) 20
c) 280
d) 28
4C-5 In how many ways the word can ‘CHAMPION’ be arranged such that the letter III CO4
‘P’ always comes to the left of ‘H’?
a) 5040
b) 40320
c) 10080
d) 20160
4C-6 In how many ways 6 boys and 11 girls can be seated at a round table if two boys III CO4
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

are not allowed to sit together?

a) 11P6

b) 11!

c) 11!×11P6

d) 10!×11P6

4C-7 In the Deep Learning examination, you are given 30 questions divided into two II CO4
parts, Section A and Section B. Each part consists of 15 questions. You are asked
to answer any 15 questions in total but it is mandatory to answer at least 6
questions from each section. In how many ways can the student select questions?

a) 15C6×15C9+15C7×15C8+15C8×15C7+15C9×15C6

b) 15C8×15C9+15C7×15C8+15C9×15C8

c) 15C7×15C8+15C8×15C7+15C9×15C6

d) 15C5×15C10+15C6×15C9+15C7×15C8+15C8×15C7+15C9×15C6+15C
5×15C10

4C-8 What is the coefficient of the5th term in the expression (6x411−x43)5 ? III CO4

a) −720106920

b) −525106920
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

c) −72021384

d) −52521384

4C-9 . Who invented the concept of inclusion-exclusion principle? III CO4

a) Abraham de Moivre
b) Daniel Silva
c) J.J. Sylvester
d) Sieve
4C-10 Using the inclusion-exclusion principle, find the number of integers from a set II CO4
of 1-100 that are not divisible by 2, 3 and 5.
a) 22
b) 25
c) 26
d) 33
4C-11 Using the inclusion-exclusion principle, find the number of integers from a set II CO4
of 1-100 that are not divisible by 2, 3 and 5.
a) 22
b) 25
c) 26
d) 33
4C-12 . Determine the independent term of x7 in the expansion of (3x2 + 4)12. I CO4
a) 220 * 46
b) 230
c) 548* 3!
d) 220 * 36 * 46
4C-13 How many 4-digit numbers can be formed by using 2, 4, 6, 8, 10, 12 without II CO4
repetition of digits?
a) 15
b) 42
c) 70
d) 127
4C-14 Calculate the value of 8C5. I CO4
a) 79
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

b) 43
c) 120
d) 56
4C-15 Find the number of permutations of word DEPENDENT. I CO4
a) 132400
b) 1512500
c) 1663200
d) 1723400
FILL IN THE BLANK QUESTIONS Course
BT Outcome
Level
4F-1 Determine n if 2nC3: nC3 = 9:1. I CO4
4F-2 If 14Cr = 14 and 15Cr = 15. Find the value of 14Cr-1. II CO4

4F-3 10010!=18!+x9!. Find x. = I CO4

4F-4 If an event can occur in ‘m’ different ways, following which another II CO4
event can occur in ‘n’ different ways, then the total numbers of
occurrence of the events in the given order is
4F-5 The number of permutations of n different objects taken r at a time, CO4
where repetition is allowed is II
4F-6 Find the number of 5 letter words that can be formed from CO4
word IMAGE using permutations if repetition is allowed. = II

4F-7 Set which contains all possible outcomes is I CO4

4F-8 Which symbol denote impossible event? II CO4

4F-9 If an event has only one sample point then it is called CO4
I
6 6
4F-10 If C2 = CX then find possible values of x. II CO4
n
4F-11 Pr = nCr * I CO4
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

4F-12 What are the coefficients of the first and the last term of (a + b)n? = II CO4

4F-13 What is the expansion of the series (xy + 2)2? = I CO4

4F-14 is one of the most useful principles of enumeration in II CO4
combinationatorics and discrete probability.
4F-15 Who invented the concept of inclusion-exclusion principle? = II CO4

MATCH THE FOLLOWING

4M-1 a) nP0 ( ) a) n!(n−r)! II CO4

b) nPn ( ) b)n=6
c) nPr ( ) c) n!
d) 6! ( ) d) 1
e) nP3 = 4*nP2. ( ) e)720
𝑛!
4M-2 a) Binomial theorm ( ) a) (𝑥1 + 𝑥2 + 𝑥3 + ⋯ + 𝑥𝑘 )𝑛 = ∑ 𝑛1.𝑛2…𝑛𝑘 III CO4
𝑛1!×𝑛2!×…×𝑛𝑘!
𝑛
b) Multinomial theorem ( ) b) (𝑥 + 𝑦)𝑛 = ∑ (𝑛𝑟)𝑥𝑟𝑦𝑛−𝑟
𝑟=0
𝑛!
c) Combination with repetition ( ) c) P=
𝑝!𝑞!𝑟!
(𝑛+𝑟−1)!
d) Permutation with repetition ( ) d) C( n+r-1,r) ≡
𝑟!(𝑛−1)!

4M-3 a)
8C5 ( ) a) 792 II CO4
b)
12C5 ( ) b) 252
c)
10C5 ( ) c) 1287
d)
13C5 ( ) d) 56
4M-4 a) sum rule ( ) a) 𝑛1 ∗ 𝑛2
b) product rule ( ) b) ) nPr
c) permutations( ) c) ) nCr
d) combinations ( ) d)𝑛1 + 𝑛2
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

4M-5 a) Principle of inclusion nd exclusion for 2 sets () a)(−1)𝑛−1 ∑ 𝐴1 ∩

𝐴2 ∩ … … ∩ 𝐴𝑛
b) Principle of inclusion nd exclusion for n sets ( ) b) n!
c) Principle of disjunctive counting for 2 sets ( ) c)|A|+|B|
d) No.of permutations of n distinct object ( ) d) |A|+|B|-|A∩B|

UNIT-IV: Elementary combinatorics: Basics of Counting, Combinations and permutations, Enumeration of

Combinations and Permutations, Enumerating Combinations and Permutations with Repetitions,
Enumerating Permutation with Constrained Repetitions, Binomial Coefficient, The Binomial and
Multinomial Theorems, The Principle of Exclusion.
PART-A
1 Mention the types of counting principles. (remembering) 1 CO4
.
2 Define Permutations with an example. (understanding) 2 CO4
.
3 What is the formula for restricted permutations? (remembering) 1 CO4
.
4 Write the formula for principle of Inclusion-Exclusion for two sets. (understanding) 2 CO4
.
5 Mention the formula for Binomial theorem. (remembering) 1 CO4
.
6 Mention the formula for Multinomial theorem. (remembering) 1 CO4
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

.
7 Write about sum and product rule. (remembering) 1 CO4
.
8 Define Combinations with an example. (understanding) 2 CO4
9 Mention the formula for Combinations with Repetitions?(understanding) 2 CO4
10 How many 4 digit number can be formed from six digit (1,2,3,5,7,8) when repetation is 6 CO4
not allowed (creating)
PART-B
1. Give a formula for the number of elements in the union of four sets. (Remembering) 1 CO4

2. How many integers between 1 & 300 (inclusive) are 1 CO4

i)divisible by at least one of 5,6,8?
ii) divisible by none of 5,6,8? (Remembering) (dsc - pno- 407)
3. How many positive integers n such that 1 ≤ n ≤ 100 and n is not divisible by 2,3 or 2 CO4
5. (understanding) (dsc – pno- 407)
4. Find the number of distinguishable permutation of the letters in the following words: 4 CO4
(analyzing) (dsc-pno-369)
i)DISCRETE
ii)MATHEMATICS
iii)ENGINEERING
iv)CALCULUS
v)STRUCTURES
vi)PASCAL

5. In how many ways can 6 men and 6 women be seated in a row ( applying) 3 CO4
i) If any person may sit next to any other?
ii) If men and women must occupy alternate seats?(dsc.pno-367)

6. Determine the coefficient of (remembering) 1 CO4

i) xyz2 in the expansion of (2x-y-z)4 , and
ii) a2b3c2d5 in the expansion of (a+2b-3c+2d+5)16.(dsc.pno-383)
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

7. A woman has 11 close relatives and she wishes to invite 5 of them to dinner . In how 4 CO4
many ways can she invite them in following situations: (analyzing) (dsc.pno-374)
i) There is no restriction on the choice.
ii) Two particular persons will not attend separately.
iii) Two particular persons will not attend together.

8. 𝐹𝑖𝑛𝑑 𝑡ℎ𝑒 𝑐𝑜𝑒𝑓𝑓𝑖𝑐𝑖𝑒𝑛𝑡 𝑜𝑓 6 CO4

𝑖) 𝑥9𝑦3 𝑖𝑛 𝑡ℎ𝑒 𝑒𝑥𝑝𝑎𝑛𝑠𝑖𝑜𝑛 𝑜𝑓 (𝑥 + 2𝑦)12.
𝑖𝑖) 𝑥5𝑦2 𝑖𝑛 𝑡ℎ𝑒 𝑒𝑥𝑝𝑎𝑛𝑠𝑖𝑜𝑛 𝑜𝑓 (2𝑥 − 3𝑦)7. (creating)
9. Explain Binomial and Multinomial Theorems CO4
2
10. 𝐴 𝑠𝑢𝑟𝑣𝑒𝑦 𝑜𝑓 500 𝑡𝑒𝑙𝑒𝑣𝑖𝑠𝑖𝑜𝑛 𝑣𝑖𝑒𝑤𝑒𝑟𝑠 𝑜𝑓 𝑎 𝑠𝑝𝑜𝑟𝑡𝑠 𝑐ℎ𝑎𝑛𝑛𝑒𝑙 𝑝𝑟𝑜𝑑𝑢𝑐𝑒𝑑 𝑡ℎ𝑒 2 CO4
𝑓𝑜𝑙𝑙𝑜𝑤𝑖𝑛𝑔 𝑖𝑛𝑓𝑜𝑟𝑚𝑎𝑡𝑖𝑜𝑛: 285 𝑤𝑎𝑡𝑐ℎ 𝑐𝑟𝑖𝑐𝑘𝑒𝑡, 195 𝑤𝑎𝑡𝑐ℎ ℎ𝑜𝑐𝑘𝑒𝑦, 115 𝑤𝑎𝑡𝑐ℎ
𝑓𝑜𝑜𝑡𝑏𝑎𝑙𝑙, 45 𝑤𝑎𝑡𝑐ℎ 𝑐𝑟𝑖𝑐𝑘𝑒𝑡 𝑎𝑛𝑑 𝑓𝑜𝑜𝑡𝑏𝑎𝑙𝑙, 70 𝑤𝑎𝑡𝑐ℎ 𝑐𝑟𝑖𝑐𝑘𝑒𝑡 𝑎𝑛𝑑 ℎ𝑜𝑐𝑘𝑒𝑦,
50 𝑤𝑎𝑡𝑐ℎ ℎ𝑜𝑐𝑘𝑒𝑦 𝑎𝑛𝑑 𝑓𝑜𝑜𝑡𝑏𝑎𝑙𝑙 𝑎𝑛𝑑 50 𝑑𝑜 𝑛𝑜𝑡 𝑤𝑎𝑡𝑐ℎ 𝑎𝑛𝑦 𝑜𝑓 𝑡ℎ𝑒 𝑡ℎ𝑟𝑒𝑒
𝑘𝑖𝑛𝑑𝑠 𝑜𝑓 𝑔𝑎𝑚𝑒𝑠.
(𝑎) ℎ𝑜𝑤 𝑚𝑎𝑛𝑦 𝑣𝑖𝑒𝑤𝑒𝑟𝑠 𝑖𝑛 𝑡ℎ𝑒 𝑠𝑢𝑟𝑣𝑒𝑦 𝑤𝑎𝑡𝑐ℎ 𝑎𝑙𝑙 𝑡ℎ𝑟𝑒𝑒 𝑘𝑖𝑛𝑑𝑠 𝑜𝑓 𝑔𝑎𝑚𝑒𝑠?
(𝑏)ℎ𝑜𝑤 𝑚𝑎𝑛𝑦 𝑣𝑖𝑒𝑤𝑒𝑟𝑠 𝑤𝑎𝑡𝑐ℎ 𝑒𝑥𝑎𝑐𝑡𝑙𝑦 𝑜𝑛𝑒 𝑜𝑓 𝑡ℎ𝑒 𝑠𝑝𝑜𝑟𝑡𝑠? (D.S.C399)

UNIT-V: Graph Theory: Basic Concepts, Isomorphism and Subgraphs, Trees and their Properties,Spanning
Trees, Binary Trees, Planar Graphs,Euler’s Formula,Multi-graphs and Euler Circuits,Hamiltonian
Graphs,Chromatic Numbers, The Four-Color Problem.
Objective Course
Questions BT Outcome
Level
5C-1 Which of the following graphs are not complete graphs?
III CO5
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

5C-2 What is the degree sequence of the given graph?

I CO5

a) ⟨4,3,2,2,2,2⟩
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

b) ⟨5,4,3,3,3,2⟩

c) ⟨4,3,2,2,2,2⟩

d) ⟨5,4,3,3,2,1⟩

5C-3 Which of the following sequences is not a graphic sequence?

I CO5
a) ⟨7,6,6,4,4,3,2,2⟩

b) ⟨5,5,3,3,2,1,1⟩

c) ⟨7,6,5,4,4,3,2,1⟩

d) ⟨8,7,7,6,4,2,1,1⟩

5C-4 Which of the following statement is False?

II CO5
a) A path is a walk with no repeated vertex
b) Circuit with no repeated vertex is called a cycle.
c) The sum of the degrees of all the vertices of a graph is thrice the
number of edges in the graph
d) Circuits refer to the closed trails

5C-5 Observe the following graph. (MSQ)

II CO5
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

Choose the correct option(s) from below.

a) {D−E−F−G−C−D} is a cycle

b) {A−B−D−A} is not a cycle

c) {A−B−D−C−G−F−D−A} is a circuit

d) {A−B−D−C−D−F} is a trail

e) {H−B−D−C−G−F−D−A} is a trail

5C-6 Let T be a tree having n vertices. How many distinct paths are there from vertex
I CO5
v1
to vertex v2 ?

a) n(n−1)2

b) n−1

c) n

d) 1
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

5C-7 For a simple graph with vertices, how many subgraphs can be constructed, such
I CO5
that the subgraph is an induced subgraph as well as a spanning subgraph?

a) 0

b) N

c) 1

d) n−1

5C-8 Which of the following statements is/are true?

I CO5
I If there is a walk from P to Q then, there must be a path from P to Q.
II A graph can have an odd number of odd–degree vertices.
III The number of edges in a tree is equal to one less than the number of
vertices.

a) Only I
b) Only II
c) Only III
d) I and II
e) I and III
f) I, II and III

5C-9 Which of the following graph has a cut vertex? IV CO5

a) Cn
b) Kn
c) Regular graph
d) Tree
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

5C-10 Arrange the following elements in ascending order using Bubble sort. And no III CO5
of iterations required ------------------
12, 40, 3, 13, 47,55, 10.
a) 6 b) 7 c) 5 d)4
5C-11 An n-vertex graph has edges. III CO5
a) n2
b) n-1
c) n*n
d) n*(n+1)/2
5C-12 The tree elements are called III CO5
a) vertices
b) nodes
c) points
d) edge
5C-13 An undirected graph G which is connected and acyclic is called II CO5

a) bipartite graph
b) cyclic graph
c) tree
d) forest

5C-14 A linear graph consists of vertices arranged in a line. II CO5

a) false
b) true
c) either true or false
d) cannot determined
5C-15 What is a bipartite graph? III CO5
a) a graph which contains only one cycle
b) a graph which consists of more than 3 number of vertices
c) a graph which has odd number of vertices and even number of edges
d) a graph which contains no cycles of odd length
FILL IN THE BLANKS Course
BT Outcome
Level
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

5F-1 The travelling salesman problem can be solved using CO5

I
5F-2 is the maximum number of edges in an acyclic undirected graph with CO5
I
k vertices.
5F-3 Consider a complete graph G with 4 vertices. The graph G has CO5
II
spanning trees.
5F-4 Dijkstra’s Algorithm is used to solve problems. CO5
II
5F-5 The minimum number of edges in a connected cyclic graph on n vertices is CO5
II
5F-6 The maximum number of times the decrease key operation performed in I CO5
Dijkstra’s algorithm will be equal to
5F-7 Any subset of edges that connects all the vertices and has minimum total weight, if CO5
II
all the edge weights of an undirected graph are positive is called

5F-8 I CO5
the definition of graph according to graph theory
5F-9 the chromatic number for an empty graph having n vertices I CO5
5F-10 I CO5
the correct technique for finding a maximum matching in a graph

5F-11 II CO5
A node is said to be if it has a possibility of reaching a
complete solution.
5F-12 I CO5
G is a simple undirected graph and some vertices of G are of odd degree. Add a
node n to G and make it adjacent to each odd degree vertex of G. The resultant
graph is
5F-13 II CO5
A graph is found to be 2 colorable. What can be said about that graph

5F-14 I CO5
Which term defines all the complete bipartite graph that are trees

5-15 II CO5
The Data structure used in standard implementation of Breadth First Search is

MATCH THE FOLLOWING CO5

 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

5M-1 CO5
a) Simple Graph ( ) a) every edge of E joins a vertex in V1 to a v2 I

b) Regular Graph ( ) b) A graph with no cycles

c) Cyclic Graph ( ) c) A graph with no loops andno paralleledges

d) Acyclic Graph ( ) d) if all its vertices have the same degree.

e) Bipartite Graph ( ) e) A graph with at least one

5M-2 a) star tree ( ) a) directed acyclic graph CO5

b) polytree ( )b) An undirected graph G which is connected and acyclic II
c) Spanning tree ( ) c) A tree having a single internal vertex and n-1 leaves
d) simple graph ( ) d) representing universal relation
e) complete digraph ( ) e) no multiple edges, self-loops and parallel edges
5M-3 CO5
a) Time complexity of Prim’s algorithm ( ) a) priority queue data structure
II
b) time complexity of Kruskal’s algorithm ( )b)O(ElogV)
c) Prim’s algorithm can be implemented ( ) c) O((V+E) logV)
d) AVL ( ) d)∑(deg(v))=2×E
e) Hand shaking ( ) e)every node need to follow balance factor
5M-4 III CO5
A. Directed graph ( ) a)some edges are directed and un directed
B. Undirected graph ( ) b) some parallel edges and loops
C. Isolated graph ( ) c)edges have a specific direction.
D. Mixed graph ( ) d) no concept of a “parent” or “child”
E. Multi graph ( ) e) no edges
5M-5 A. Connected graph ( ) a)depends of edges ,number of vertices III CO5
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

B. Disconnected graph ( ) b) At latest one edge b/w every pair of

vertices
C. Planar graph ( ) c) Any path doesn’t exist b/w every pair of
vertices
D. Regular graph ( ) d) Drawn in separate plane without any
edge crossings
E. Graph ( ) e) Same degree

UNIT-V: Graph Theory: Basic Concepts, Isomorphism and Subgraphs, Trees and their
Properties,Spanning Trees, Binary Trees, Planar Graphs,Euler’s Formula,Multi-graphs and Euler
Circuits,Hamiltonian Graphs,Chromatic Numbers, The Four-Color Problem.
PART-A
1. 1. Define a Graph.(understanding) 2 CO5
2. Define a Sub graph with examples. (understanding)
2. What are the various types of graph? (remembering) 1 CO5
3. Define a Bipartite and complete bipartite graph with one 3 CO5
example.( applying)
4. What is connected graph and disconnected graph? (analyzing) 4 CO5
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

5. What is a Spanning tree? (remembering) 1 CO5

6. a. Define a Sub graph with examples. (understanding) 1 CO5
b. Define graph Isomorphism.(understanding)
7. a. Define graph Isomorphism.(understanding) 5 CO5
b. Distinguish between Euler path and Euler circuit? (evaluating)
8. a. Define Hamiltonian cycle and Hamilton path.(understanding) 2 CO5
b. How chromatic number help in map coloring?( applying)
9. a. What is Graph coloring. 2 CO5
b. Define Rooted tree.(understanding)
10. What is Spanning trees. .(understanding) 2 CO5
PART-B
1. 2 CO5
a) Explain about Kruskal’s algorithm.(understanding)
b) Find the minimal spanning tree by using Kruskal’s algorithm
for the following given graph.
(creating)

2. a. Explain about Prim’s algorithm. ( applying) 3 CO5

b. Find the minimal spanning tree by using prim’s algorithm
for the following given graph. (creating)

3 1
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

f 3 4 b
1
3 4 2

e 5 c
4 2

3. What is a planar graph? Mention the properties of a planar graph. 4 CO5

(analyzing)
4. a) Explain DFS algorithm. (understanding) CO5
b) Apply a BFS algorithm to find a spanning tree. (applying)
V1 V4 V6

V7

v5 V2 V3
5. a) Draw a complete binary tree with 19 vertices. (creating) 6 CO5
b) A complete binary tree has 25 leaves. How many vertices
does it have? (creating)
6. Show that the maximum number of edges in a complete CO5
biparticle graph with ‘n’ vertices is n2/4. (creating).
7. Find an Eulerian cycle in the graph. (creating) 6 CO5
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

8. a) Explain about Isomorphism. (understanding) 2 CO5

b) Show that following graphs are Isomorphic or not. (creating)

A B P Q

S C D R

9. How many paths of length four are there from 𝑎 to 𝑑 in the 6 CO5
simple graph 𝐺 given below. (creating)
 SRI INDU COLLEGE OF ENGG & TECH
Prepared
QUESTION BANK
onRev1:
(Regulation :R22)
Page:1of9
DEPARTMENTOFCOMPUTER SCIENCE
ENGINEERING
Sub.Code&Title R22CSE2111 & DISCRETE MATHEMATICS
AcademicYear:2023-24 Year/Sem./Section II/II/A/B/C/D
Faculty Name&Designation K.KRISHNA,ASSTPROF & P.PRAVALLIKA CHANDAR,
ASST PROF

10. Draw the complete graph 𝐾5 with vertices A, B, C, D, E. Draw 4 CO5

all complete sub graph of 𝐾5 with 4 vertices. (analyzing)