3. booklet 1.

The 2. Instructions Name of Roll (To

3g94i5(3iot )Roll Booklet
Series
mmediately Answer-Sheet
replaced.having marks.
evaluated.
proceed. Examine
missing question
attempts
attempted
first
65provided
Sheet
Examinee
65 asked Do No. No. be OMRAnswer
SheetNo.
questions not filled
to Exámination
Centre (in (in A
any open to
maining or do the words) figures) by
Faulty the booklet.
other
duplicate questionsAll more is so. Examinee the
required the
very
Booklet questions.
contains75 Candidate
question in b0oklet
discrepancy
tructions than Graph (Sem.
B.Sc.V)
Inand the
pages/questions carefully questionswibe
l :
and case
65 OMR to
booklet not unless /
carry answer Theory
before Questions,
Examinee
onshould OMRthe
last Answer
in you gfdei
due equal Mathematics
page) the any
be or toyou are qterei &Paper II:
Discrete
Examination, 5055
2. ai
WA-gttro
Mathematics
)
2023-24 Question
Number
Booklet
75
gTI Invigilator
Signatureof [ [Time
| |H44:
Maximum
3rfoa4
2 :2
arei 36 : :
00
MarkS 00
s : Hours
q 3428141
fi 75
:
75
65
 Rough
Work

\A\2023 3
4. 2. 1
(D)10 (C)11 (B)25 (A)32
binary The
simple
(D)45 (C) 9 (B)90 (A)55 The 2-connected
(C) 1-regular
(D) 2-regular
(B) (A) Every
Unicursal Euler(C)
graph(D) graph (B) Simple
graph(A) ces A
maximum connected
maximumn
1-Connected are
tree Hamiltonian Hamiltonian
graph
graph
of
of even
heightnumber with graph
number
degree
10 graph
5 G
of vertices whose
of is
leaves edges is -
- all
is
in - in verti
a a
[3)

4. 3 2 1

(D)10 (C)11 (8)25 (A)32 (D)45 (C) 9 (B)90 (A)55 101-ST(D) T2-g3T(C)2-ufa
T (B)1-Fuft(A) CfrA
) (BIE
) RG
(A)N5
qbtt(DI5
) YcR(I5
9t¢

aIct

HTeTRUT

YI5

oRÌ
P.T.O.
 8 7. 6. 5.
2023
5055 A
(D) Zero(C) Odd(B) Even(A) number In
Simpie path(C) Open
path(D) Trivial path(B) Closed
path(A) same A (D) NodePendent
(C) Vertex(B) A
- digraph
Symmetric Cyciic(Bdigraph
(D)digraph(C)digraph
(A) called Asymmetric ) Acylic(A) cuit is- A
path Vertex digraph
Infinity a None Isolated
Vertex
Non-directed point
of that
odd of whose G
is
called starts the having
degree
above degree
graph - and no
vertices
end directed
is
the unity,
at
are total the
is cir
[4)
8 7 6 5

34i(D) (C) q faye(B) (AH4

) (Bqu
)g (A)qU
G (C) u Cá
(Asrt) 3RHf
fBUr5(D) Hea
f3Ur5(C) fByrs
au
(BeRIgfes
) fsurs(A)

10. 9
V2023 12. 11.

None(DPendent NodeInternal
) Vertex(C)Branch (B) Node(A) called ASame(D) Zero(C) (B) (A) the Vertices
Even(D) (C) (B) (A) has -Every path(C)
None(D) Simple path(A) edge
(B) Euler's If
Vertex Regular A a
4k 2k 3k path
Less Greater degree Harmilton's
path exactly
or or
orself-complementary in
of than graph 4k+1 2k+1 3k+1
degree of
than once, graph a
2 each
with VerticesVerticesVertices
unity
2Vertex then G
4 includes
every
Vertices, it
in will is
a called
tree be graph
then
is -
[5]
9

(5À HHG(D=o
) 3fua(A) (DH4
) H (C)4k
YI 2k+1(B2k
) (A) 1A
(B) 3rR(A) I
Y (A)
D) (C)ÎÉ YET(B) 3:ya (C) (B) DH
3k
UT
4k+1 3k+1

P.T.O.
5A\2023 16. 15. 13.
Skew-symmetric
Hermitian(D) Symmetric(B)
(C) Orthogonal
(A) is The has
m.(Dh) Im/!h(C) (Bm'
) (Aheighest
)h InOrder
(0) treeNumber
Rank(C) Nullity(8) Sibling(A) caliec is nedges(D)
edges(C)2n(n+1) IfGis
edges(B) edges
(n-1)(A)
Adjacency an
of a
number m-ary tree
branches
Matrix Tree withn
of
lea in
of vertices,
of ves any
height
are spanning
graph a then
-
'h',
G it
[6]
16. 15. 13.
(C) HufT(B3TetH
ztferaa(DHE-HufHd
) ) (A) fo m.(Dh) !m/!h(C) (B)mh (A)hm ) (B) l H0E(A)
fî (D) o (Cui (D) n (C)2n(n+1)(B) (n-1)(A) n
efi
G
UIE m-t ar

HATA , faGb
31YE
fH

fbH aats
fRT
'h' RN
#IR ,

5055\A2023 20. 19. 18. 17.

(B) (A) and G, In (D) (C) Intersects

(B) (A) two A (D) 0 (C) (B) are
(A) 1Matrix
diagonal n-m+1(D)
If m+n(C) (m+1)(B) (m-1)(A) Rank
(D) eesv (C) Graph a
e e-edges
e with simple a All Do Do of 1 1 graph of
s 2 its or and
of not not 'G' a
3u-6 3u-6 r-regions -1 entries Cut
the edges 0 has
IntersectsParallel is
(e>1), connected above said rmatrix
no
to of self
u-vertices
the is
be the loop
Planar equal
relation planar Adjacency
then
to
(v3) Graph if -
no the

20.
(D) 0 T-1(C) 1 (B) (A) 1 n-m+1(D) m+n(C) (m+1)(B) (m-1)(A)
(D) e (Ces
) (B) 3u-6(A) e U- 34T (D) I(CG) HH|
B -R(BTT
) (A)CA
e HH4 1
s (u23) 3r
3u-6 0
HFdg
FT
e-fo-t T4
I5
(e>1)
G
P.T.O.
d, HÀ
t
5055A\2023 24. 23. 22. 21.
n(n-1)(B) (A) asymmetric
nbe...will The (D) ia-1y(C) (-1'(B)(2-1f(A) having The (D) (n-1)(Cn(n-1)m
) n (B) Then-hromatic
complette0-Chromatic (C) iS-Every
n(n-1)(D) (c) (A) (D) 2-Chromatic
1-Chromatic
(B) (A)
number ii-1 chromatic None
n(n-1) chromatic tree
four
(n) of Graph
graph (,-2) vertices with
(n of these(n-2).....1-m+
+1) edges, polynomial with twO
(.-3) polynomial
with
is 'm' or
'n' in given more
vertices
-
complete a of
vertices by... vertices
a 1)
tree of
is
- a
(8]
24. 22.
(A) n vo (D) A.(0-1(C) (a-1(B) 2(a-1(A) (n-2).....(1-m+1)
(n-1);n(n-1)m
(C)nm(B)n(n-1)(A) m-tei 0-oft(D) n-oAf(C) 2-Pfs(B) 1-sf(A)
n(n-1)(D) ()n(n-1)(B) q°t
a-1)
34Hf4G aic
(o)(n+1) (0-2) to
Y5, quf
(a-3)
fSo urs
n-gît fe
i,
bAfc

28. whatFor27. 26. 25.

55AI2023
(C)n>m (B)nSm (A) graph (C) (B) (A) simple The
Hermitian Symmetric
(D) Scalar (B)
(C) Orthogonal
(A) cy
edges, If
is- The
(D) 8 (C) 14 (B)11 (A) 7 W, (D) (D)
Matrix G
n maximum
number None n(n-1) is
2 Kn +1)n(n then
m is 2graph a
values wil digraph
of a corresponding
ofthese subgraph of be
number
edges n
of vertices
without
n of
in of the
the Km?
complete isedges Adjacen
- paralel
graph in
a
(9)
28. 27.

(D) 8 (C)14 (B)11 (A) 7 YI 5(D7À) (C) (B) HG-YI5?

(A) Km
i n (D) (C) (B) zfA (D) AE
eR
(C) -f(B) 3Tf-a(A)
o n(-1)(A)
W, n n n fo
> S 2 n(n+1) 2
m m m
41t 2
oRt
fE
HE: qut
y5
Kn,
PT.O. qot
YI5
 50 2

31. 30.
29.
055\A2023 32.
(D) (C) (B) (A) in How (D) a (B) vertices is in The
Petersen
(D) graph(C) (A) K, Which
(B) K,Eulerian? ) (A) 11graph is The
(D)17 (C)15 (B13 a
(C) (A) a
number compiete maximum
complete
None n!(n-1)! n(n 1) many
of 2
of the Hamiltonian
these of graph
bipartite
following edges number
ofn
circuits graph
in vertices? of
graphs Petersen
edges
exist of
n
is
[10]
29.
)
(D)17 (C)15 (B13 (A11
) (D) (A) 4 HHd ? (D) 9 (C) n (8) (A) n n
eHTUI(C5) (B) K, (A) K, (-1)(B) aA
n 3 4
2 a
qot
teacts
yr5

35. 34. 33.

5055\A\2023 36.

The A (D) (C) (B) (A) The (D) Hamiltonian Path(A)

(C)Kn Path(B) Simple of A
(D) (C) Two(B) One(A) (D) )
(C)K, (BW, (A)C,
complete a path
number None graph None graph
None One None
which
of or of graph
of
X of of exactly
these Two of these these the these contains
centres complement
which once

in is every
is called
a wheel
tree vertex
of
is C,
is is
11
](
35. 34.
vo (C) (B) (A) C,I (C)Kn
(B) a (A) (D) 54
0 (C)K, (B)W, (A)C,
qut
yRo
yIs
XYI5:
t
ygt:

P.T.0.
055\A12023 Choose,40. 39. 38. 37.
(D) (C) Pa(-p)
~(p-P)) (A)
(B) Tautology (D~p
) (C) p (B) f (A) t On (172D) 213(C) The )13 is:
(D)23 (C)21 (B)15 (Avertices The
~(pva)(wpra) 150(B) 131(A)
(pA simplification nulity nullity
(p
q) which
q) of of
» any
(pvq) ^p] a
the complete
= one of tree
result
4 the
is:
statement
wili araph
not
be..
of
a
[12] 7

38. 37.
(D) (B)
(C) pa(-p)~(p-p))
(A) (D)~P (C) p (B) f (A) t 172(D) 213(C) 150(B) 131(A) fabet (D)23 (C)21 (8)15 (A)13 7
+
(pAq) [(p q
art
qof
(pvq)
’ ^p] 4) ATI as
» :
q
aI
:

055\A\2023 43. 42. 41.

44.
(D) (C) . (B) (A) is Thea-b>0
aRbif(D) aRbif(la|>|b| )
C) aRbif(B) (Arelation set Which (D) (C) (B) (A) Choose Which
(D) (C) (B) (A)
of
None ReflexiveReflexive
Symmetric relation real
All ~qp
pq, p p
aRbif of - --
p-- p- p- ~(p one
of a
the q= q=(qAr)
of numbers the q,pq q, valid - is
given la|<|b| la| following ~qF q)wrong
these and and above (~p) (p-
= argument
and |b| p = =
pa(~q)
Symmetric
Transitive by is vq q) (p
Transitive directed an
relation -
equivalence -
(qv q)
p)
- a
(p
graph in
the
--r)
13] [

HOTHO
HHta(CHoareG
) (B)Ld (D) (C) lal=|b|
(B) aRbif(A) ~gtp
pq,(C) (B) p (A) (D) (C) (B) (A)

aRbif |a|<|b|aRbla|lbl
ifaRbif p p
p-q p- ~(p
-q,pq - -
4,~q~p q (qAr) --
=(~p) = q)
a-b> (p-
HOTHG = =
0 vq q)(p- p
v (~g)
(q q)
--
(p-r)
p)
P.T.O.
 5055\A\2023 48.
47. 46. 45.
(D)16 (C10
) (B) 84-variables
(A) 4 willbe Total
Y=(A+B)(D) Y=AB )
+AB(CY=(A.B)
(B) Y=A+B(A) Gate (0) (C)
The +AB=A+B
(8)AB (AAB
) which (x+y'
(x++z)
If +(x+y+z) (C)
z)(x+y+z)
(0) (x+y'+z)(x+y
(6) +z)(A) pieteCNE.Express
A,8
(XOR-Gate) output A.(A A8 (X+y+z)
number one
+AB
+AB=A+8 are
+B) is E=(xy+xz)'+N
funtion variables
Boolean
Faise then
=A.B =B
of (x+y'
is
-
Minterms - of +z)
Exclusive
as
a
with
OR com
14] (
47. 46.
(D)16 (C)10 (B) 8 (A) 4 Y=(A+B)'Y=AB'+A'B
(D) (C)
Y=(A.B)' ) A.(A'AB'+A'B'=B'
(B) Y=A+B(AXOR-Gate (C)
+=A.B)(BDAB'+A'B=A+B
) AB'+A'B=A+B
(B) (A) (x+y+z)(D)
afe(x+y'+z) (x'+y+z)
((x+y'+z)
C) (x'(x+y'
(B) +y'+z)(A)
A (x'ty+z')
T
B
atru
341G
(x'+y'
biH ar
a, +z')
oH
zT
I

55\A\2023 52. 51. 50. 49.

7 The (D) the

(C) 4 (B) 3 (A) 2 children In!7x!8(D) 7x!8(C) 8x!7(B) totalpapersranged 94170(D) 3750(C) 14400(B) 13120(A) willbe- row Boys The
None(D) 4.7=28(C) 7
(B) 4 (A)boxes, 7x8(A) Examination
letters same a
total At group number so Total
and
will least are so that
cannumber month will number
3
be of never that noGirls
2 be 13 ways of-
- be papers, tw o
-children,
there, the can
posted of together, girls of
ways best beways
who are are
in and seated
how to together, in
by then which
4 born
many worst be
letter which in
the
in ar a 5
15] (
52. 51. 50.
(D)4.7=28(C) (8) 4 (A) 7 7 (D) (C) 4 (B) 3 (A) 2 !7x!8(D) 7x!8(C) 8x!7(B) 7x8(A)
13 94170(D) 3750(C) 14400(B) 13120(A)
qat TgH4t
aa
4
o
4 T
4-iH 3&
2H odt AOR
Àodt adu
T
yoR zt,
P.T.O. t
3I as
055\A12023 The56. 55. 54. 53.

1|(1+x*)(B) (A) givenby ing

(C) 1|(1-x*) 677(D) 766(C) 867(B) 768(A) and If(1-x)(2x|D)(1+2x)(C) x\(1+x)(B) x|
(1-2x)(A) 2|given by to The
1|(1+x)(D)1|(1-x) (A) withrelation The
(D) (C) (B) a,=8.,+10n-1 A, the
to
generating
function A,=i,
=2A,,+3; generating
the a, a, a, a,a,=1, Solution sequence
=(2" = = =
sequence (6° (8 (6° is then
given function
of A, n21
+ wil (0,1,-2,4,-8,...)
the
+4") 10") +10") + 8)
by
(1,0,1,0,....) - be coresponding
correspond recurrence

is is
(16)
56. HGI55. d 54. 53.
1|(1+x*)
1|(1+x)(D) 1|(1-x)
(C) (B) (A) 341bH (A) a,=1 677(D) 766(C) 867(B) 768(A) (D2x|) (1+2x)(C) x|(1+x)(B) x|(1-2x)(A) 2|
utaA, (1-x) 45H
(D)
(c) (B) a,=8a,+10^-,
1|(1-x*) an =2A,,
(1,0,1,0, a, a, a, (0,1,-2,4,-8,....,
=(6°+
= =(8° =(6°
(2" +3;
...) n1
+ + 8") +
* 4") 10") 10")
HIA
a

beT T

055\A\2023 60. 59. 58. 57.

(DAg
) p (CAq
~p
) (Bvq
~P
) pvq(A) p-q ) set(A)
If (D) Emptyset(C) Finiteset(BInfinite set. If (D) (C) (A) (B) made be- a The
Garland
be Two(20!-19!)
None(D) (c)
p xeN (191)(Bs(20!)
) (4)
and Not
equivalent, finite
None Same Same Input Same total
is and
equal q a state numbers
of
are set x output input
is output 20
to two prime, if
machines different
for they
with of
statements different
then withproduce ways
same
are flowers
x in
is different
Input output said which
then can
to
(17]
60. 59. 57.

paq(D) (C~P
Aq
) v9.(B~p
) pvq(A) ufdp Gt
(C) Ha4
qRIHa(B) HHy344(A) qt (DTi U5
(20!1-19!)
) 1 (C(19!)
) (B(201)
) (A)
pot
3R xeN
3R ot
g HHau
X HTTI
T,E 3HJJ,
20
p fafa
-g
x
P.T.0. sIER pi
i
:
055\A12023 62 61
6
(D) Universal C) Law(B)
Law(Involution (A) bra For (8) injective(A)
(D) BijectiveSurnective then (pa)8)
-F (Dc)(A) T The
(C) O) (Dc) <F
C
fx-Y
None Convolution
Law B, any None None dua
(a)=a gof.
element of
of of x and of
- (D-a)
these these Z these
is is g:y
known a -
ina - Tis
2
Booiean are
as
bijective,
aige

18] (
63. 62. 61.
HIdfH6
fAH(C) rcmfruu(B) (a')'=a
IGI:
S1MI 3TEsI¦
toó(CI) 3T291a(B) eos(A) aiz (pva)F(C) (pg)aF(8) (pva)T(A) (p^q)
irs a.
dId f:x-y
gof:x vT
5
- TUT da
B* z
: g:y
-z
d Uoot
a
à 3Td
fee,

A\2023 66. 65. 64.

(C) (B) The (D) (C)y' (B)xy x+y(A) output Ifx (D) a'+b=2(C) axb=b(B) (A)
axb'=0equivalent to In
(D) (A) -
NOT and None a
None None
given Boolean
gate y
of of are of
these by these
is these two
represented AND algebra
inputs,
gate

is a+b=b
then
by
the
is
19] [
66. 65.
(D) 3 (c) (8) (A) - NOT (C) y' (B)xy x+y(A) ufa a'+b=2(C) a*b=b(B) a*b'=(0A)
(D5À
)
x
3tR
AH y
t
544t3.
RI
VaA
TG
AND
P.T.O. GI Z
R
A2023 67.
69. 68.
(A)AB (A+B) (D) x+y(C) (B) x y+y(A) f(x,v) The
escendants(D) Nullity(C) Rank(B) Sibling(A) treeis: Number of (D) 1 (C) 0 (BAB
)
None
(A' = minimal
»B') Xy
of +
branchesany in DN
= these xy'
form
is
of

spanning

(20]
(A+B)68. 67.
(D) 1 (C) 0 (AB'B) (AAB
) x+y'(C) (B) X y+y'(A) f(x,y)
a9I(D) qud(C) (B) frafcT(A)
(A'*B') = =Xy
+xy'

3fq

DN
FY:

5\A\2023 71. 70.

72.
230(C) 184(B) 347(A) graph The (D) 2 (C) 4 (B) 1 even is
(A) 3 length The (D) (C) 2n (B) (A) 4n planar if A
(186D) complete
number chromatic n n
of s s
degree 2 4
of graph
number
46 edges
and of
8 of n
in vertices
vertices a
a
regular cycle

is: of is
(21]
72.
186(D) 230(C) 184(B) 347(A) 46 (D) 2 (C) 4 (B) 1 (A) 3 (Ds2
) n (C) n2 (S4
B) n (A) 4n
fst
stt
8
it
at
g
AufHT
P.T.0.
I5
5\A\2023 75. 74. 73.
q-P(D) - q-p(C) (B) p-q (A) - (D) (C) (B) (A) the Choose with Q: Delhi.
more
than 0,1,1,3,5,8,
13,........
P: (D) (C) 12,16,20,24,
1,3,5,7,9,.
(B) (A) erating The
proposition of The
truth Last The
- contrapositive Q- 31 0,4,8, sequence
(P P-Q
q the days year, population function
--p (P- (P- - value
Q) correct 12,
is are the 16,
Q) Q) -Q True of generated
is 7.
number . (1-x)?
is is statement: option of 4x
of true False False
p Hyderabad by
-q based of :
months the
is
the on gen
is
(22]
75. 74. RIDTT73.T

(D) q-P(C) (B) p-q (A) - (P-Q)(DHA

) (C) (B) P-QHt
(A) 0,4,8,12,16,.........
13,........
Q:0,1,1,3,5,8, (C) 12,16,20,24,
P: (D) 1,3,5,7,9, (B) .. (A). .
p-q
fkBt GRIAIG
- - Q- (P-
q q atte-H# at
-p -p (P Q)-- 31
-- THAI
fa 4x
Q) Q (1-x)? JRT
YR
JTAIA IGA a
eTd 31àH
HÌ fAei
ôt

A7

Rough
Work