MP SET 2024: State Eligibility Test, Computer Science & Application
Text of page 1
"91.
R/P/P/2024/II Question Booklet No.
Subject-Computer Science & Application
SET A . (-^^5^)
Paper II (Optional)
ct^s-22 ^
24220-2545
Subject-Code-22
Name
^ Candiilate should write his/her
Roll No. Roll No. In (he given boxes.
■gf^ WTT/No. of Printed Pages : 32 Tf^/Tota! No. of Questions : 100
Tm : 3 9 fg^ ^^ gyrf^/Maxlmum Marks : 200
Time Allowed : 3 Hours to complete both 1st and Ilnd question paper '
fcTtr Pi^^i
■q? m-gferaJT ^ ^ 3Tthift ^ M11 ^ T?;g> vrror f1
WT W Tdthc-U f I "STH ^ ^ "3tIT T# t I ^ ( 3Tt."qTT.3tlT. ) '^T
^Mpdd ofit «»ji^ '^fcT wiT$<i '«hlcil I ^ ^ ^
^ f ^ fitengJT 150 dWpiy WT ^ tr?T f rwr 2 3T5> ^ t I
aiftanf "f i tn^a? TtTT 2 stsb i ai^nPtd utt ^ 1 5tt«iiwqi ^ tngtm
t' 1 . .' • '
■U77-Ttl I - WT-tTW (tJTT WIT 1-50)
nyH-Ti? 11 iiftyiyf gm ¥97-117 (¥77 wit si-iso) ^
^ ¥77-^rW<*>r 'fif 1J^ WIT 3ITWT ij^ TT gyiff Tf t I Tft^TT^lf Tit WT? ^ TTT^ t UTT-^fkeni
^ gl^ afrt Ph«?<«(< i st^ttiit % t# Tit ¥97-^wt»i tnriTcT Tfir ^ i
TTT-TTT) ( ait.g7.3IK. Tft?) TT f^TTfftH wif TT ^ 3TIT?5raT Tf^rfeUT T5^, 3RT TT 7^ I
ilft^ W Vf TTlf ¥77-gft7SRT ^ I^TSlfftTT "WR TT ^ Ti^, 3T^. Ti^ 7^ rTTT JtTT-77 ( 3it.g7.3TK. ^) TT ^ 7^ I
i^Rtit ¥77 7 ¥TiK ^ Titf 7T 7W7T7T ¥T7T ^ ^ ¥77 TTT 3T^ TRftTff ^ ^ WTRK
Tit 7T7T» *41*11 ¥TTgnT I ^
f^TTt ¥oFK TIT «ic^AcT, riT'l %TR T (cjitil ¥TK TIT f^T^TfTTI (s«il§« 341H* TIT ¥Tt7 tRrT ^ I ^ ^ »
7TT 3TT¥^ ¥97-gfeTTIT IltrT^ ^ 1^1^ ^TT ^ 77^ ¥771^^ ^-¥7TI ( 3it.T^.3IK. 7^7) 77T 1%Tf%7 TIT% ^
<^qn TIT^ TTR »qT§c ^7 TIT ¥Tt7 «h^ I
77ITT ^ ¥7TTg3Tt.Tjg.3TIT. jitj Tt^^ ¥77Tg^ 3T«ITf TI^ I
, 7tK-¥¥T) ( ^.g7.3TK. ) 7T TtK ^ ^ 7g ^ifTlt' 9T TTR7 TK7T I
INSTRUCTIONS TO THE CANDIDATES
1. This Question Booklet is printed in two languages—Hindi andEnglish. Candidates can select any one of the
two languages according to their convenience.
2. Each question has foiu* options. There is only one correct answer to each question. Choose the appropriate
option and darken/blacken the corresponding circle on the Answer Sheet (OMR Sheet) with black point pen.
3. In this examination there are two questionpapers, consisting of ISO objective type questions and each question
carries 2 marks. Both the question papers and all the questions are compulsory. Two (2) marks shall be
awarded for each correct answer. Unanswered question will not be given any marks. There is no provisions
for Negative Marking.
Paper 1 General paper (Q. No. 1-50)
Paper II Question paper on the Subject opted by the examinee (Q. No. 51-150)
4. No. of pages consisting of this question booklet is indicated over the cover page. Candidates are advised to
■ ensure that' all the pages of Question Booklet are properly printed and binded. Otherwise they may demand
- the other Question Booklet of the same set.
5. Kindly make necessary entries on the Answer Sheet (OMR Sheet) only at the places indicated and nowhere else.
6. Examinee should do all rough work on the spaces meant for rough work on the pages given in the Question
Booklet and nowhere else, not even on the Answer Sheet (OMR Sheet).
7. If there is any sort of mistake either of printing or of factual nature in any question, then out ofthe Hindi and
English versions of the question, the Hindi version will be treated as standard one.
- 8. Use of any type of calculator, log table or any type of electronic devices etc. are not allowed. '
9. Use only black ball point pen to mark the answers in the Answer Sheet (OMR Sheet) only after you are
instructed to open the Question Booklet.
10. Candidates will leave the Examination Hall only after handing over the Answer Sheet (OMR Sheet) to the
Invigilator at the end of the examination. . « x
11.Before answering on Answer Sheet (OMR Sheet) ensure to follow the instructions given for that.
S/22/2024/A
Text of page 2
(SPACE FOR ROUGH WORK) S/22/2024/A
Text of page 3
51. PHHRrlRsid TfrqtfeH 51. Which of the following statements is a
t ■? proposition ?
(A) ^IWT 31TW ^ ^ ! (A) God bless you !
(B) WTT^ 3TWT 2 t I . (B) One even prime number is 2.
(C) %T3; 13:^ ^^ i (C) Get me a cup of tea. :
(D) 3TR. cflfe ^ t ? (D) What is today's date ?
52. ^SH^Pd+d ^ i^TOT "4* 52. Which of the following is a mandatory step
PdHPdP<sld ■^* ^ 3Tf^T^ t ? in the principle of Mathematical induction ?
(A) (A) Inductive hypothesis
' (B) fwt^ (B) Inductive reference
(C) P^^P^cj (C) Deductive hypothesis .
I
(D) fe'SpKci (D) Deductive reference
53. ■RH epni /srk 53. Let functions /and g are one-to-one, then
^ {g oj) 4i'=^;n "^Wt : - function (g o^ is :
(A)* (A) Many-to-many
(B) . . . (B) Many-to-one
(C)-^-l-M (C) One to many
(D) (D) One to one
54. "Cancellation laws" ^ t : .54. "Cancellation laws" are always satisfied in:
(A) fR ■^* (A) ling.
(B) ch^ifd=i (B) commutative ring
(C) ^ y.dlA'd ^ -^ar (C) ring with unit element
(D) "^ferd slAi "A* (D) integral domain
(8)S/22/2024/A P.T.O.
Text of page 4
55. ^Kpuich 55. The group of matrices ' with
determinant is-a subgroup of the
3^?OT*T 31T^* ^ V^ group of invertible matrices under
'S^W^ t I multiplication.
(A) 3 (B) 4 (A) 3 ■ (B) 4'
(C) 1 (D) 2 (C) 1 ' (D) 2
56. n iJi4i 37RPT 56. The maximum number of possible non-zero
^PdcHi A' "^-"^I^ iTpff ^ values in an adjacency matrix of a simple
. aqp??^KW "^jW t : graph with n vertices is :
(A) n (B) (A) n (B)
(C) «(«- l)/2 (D) /?(«+ l)/2 (C) n(ri- A)/2 (D) «(« + l)/2
57. PHHPdPsid ^ 41^J|Puid 57. Which of the following is not a valid rule
^ ^t ? of Boolean Algebra ?
(A) A + A'= A (A) A + A' = A
(B) A + A'= I (B) A + A' = I
(C) A .A = A (C) A.A = A-
(P) A.A'=0 (D) A.A' = 0
58. 35k kHf 58. Both transportation and assignment
ylyiPM^I WTTsjf ^ T3^ ^ ^ WT problems are members of a category of
I', t^RT^ «TMT f : linear programming problems, called :
(A) Network flow problems
■ (B) m¥^\^ (B) Routing problem
■(C) dFvdPWcti ■ (C) Logistic problems
(D) f^ikrr (D) Shipping problems
(8IS/22/2024/A
Text of page 5
59." rHMreiPsld TIN) 59. Consider the following graph :
IJFP "^' iHHrelPdd Which of the following is true with respect
t ? to above graph ?
(A) <^q<n ■yl^V (A) Hamiltonian circuit only
(B) 'm?? (B) Hamiltonian path only
(C) ■qm 1?^* lfiT^df¥H (C) Hamiltonian path and Hamiltonian circuit
(D) ^ ^ "qiST "q tfTTc^tfro (D) Neither Hamiltonian path nor
Hamiltonian circuit
60, oiig^O ■ mIw- 60. The steps for finding post-order traversal of
.f*, : . a binary tree are :
.(A) "qr «n^, ^ (A)^ Visit root, traverse the left subtree and
"^', 1^ "qi^ ^ ^°Ri ^ traverse the right subtree
■ (B) "qr ^ "^ENzt ^ ^ (B) Visit root, traverse the right subtree
oJiq ^ ' and traverse the left subtree
(C) ^ TET^ ^ "qr (C) Traverse the left subtree, visit root and
' "511^', fqiT "qR ^ traverse the right subtree
(D) ^ ^ ^*, ^ (D) Traverse the left subtree, traverse right
^ 3|r "qr subtree and visit root
(8)S/22/2024/A P.T.O.
Text of page 6
61. For an w-variable Boolean function,
WT Csr^ -Rrf^sTf) ^ the maximum number of prime implicants
"I" : is:
(A) nil (B) 2"- 1 (A) nil (B) 2"- 1
(C) 2"-^ (D) 2" (C) 2«-l (D) 2"
62. (1217)8^ "t : 62. (1217)8 is equivalent to :
(A) (1217)i6 (B) (028F),6 , (A) (1217),6 (B) (028F),^
. (C) (2297)io (D) (0B17),6. (C) (2297),0 (D) (0B17),6
63. "q^ •^* 32 fe (bit) "q;^* 63. A computer has 32-bit instructions and
1-2 fe (bit) t I "qf^ 240 12-bit addresses. If there are 240 two-
f, "q^-qqi ^H*-4ld4 ^ address instructions, how many one-address
^ f ? operations can be formulated ?
(A) 4096 (B) 65536 (A) 4096 (B) 65536
(C) 8192 (D) 131072- (C) 8192 (D) 131072
64. F ("q^T^) Pi^-iRifeia 01^4^ srf^oqRw 64. Consider the following minterm expression
qi Iq^K : for F ;
F.(P, Q, R, S) = 2 0, 2, 5, 7, 8, 10, F (P, Q, R, S) = E 0, 2, 5, 7, 8, 10,
13, 15 13, 15
PHHdHf 2, 7, 8 "qiq 13 'TOTF
the minterms 2, 7^ 8 and 13 are 'do not
^ t I F^
(PHRHd care* terms; The minimal sum-of-products
^-3TRj-3te5 W^) : form for F is.:
(A) QS + QS ' '(A) QS + QS
(B) QS + QS (B) QS + QS •
(C) QRS + QRS +QRS + QRS (C) QRS + QRS+QRS + QRS
(D) PQS + PQS +PQS + P'QS (D) PQS + PQS +PQS PQS
(8)S/22/2024/A
Text of page 7
65. ^ (2) FT33 NOR^ 65. What is the minimum number of gates
^ wft^T WT t, rft ^fWi required to implement the Boolean function
(AB + C) =fj^ ^ 3iiq^(H=h (AB + C)if we have to use only 2 input
^ ^f ? NOR gates ?
(A).2 • (A) 2
(B) 3 (B) 3
(O) 4 (C) 4
(D) 5 ■ (D) 5
»
66. ^ P T3^' Q f, ^ : 66. If P and Q are Boolean variables, then :
(P + Q)(P.Q+P.R)(P.R + Q) (P + Q)(P.Q-+P.R)(P.R + Q)
^ tKoian "I" : simplifies to :
(A) P.Q (A) P.Q
(B) P.R . " ■(B) P.R
(C) P.Q + R (C) P.Q + R
(D) P.R + Q (D) P.R + Q
,67. 256k ^ WT ^ 67. How many 32k x 1 RAM chips are needed
. -i- 1^ 32k X 1 ^ (RAM)1%^ to provide a memory capacity of 256k
^ t ? bytes ?
(A) 8 (A) 8
(B) 32 (B) 32 .
(C) 64 , (C) 64
(D) 128 (D) 128
(8)S/22/2024/A P.T.O.
Text of page 8
68. [HMfdRsld 3#ToJife x'^ 68. Which one of the following expressions
y ^ Exclusive NOR hRiPiH^c^ does not represent Exclusive NOR of
t ? X and y ?
(A) xy + xy (A) xy + xy_
(B) X 07. p) X © y
,(C) x®y (C) x©;'
(D) x®y P) X©y
69. ^ W ^ ^ 69. Which memory is difficult to interface with
tif^=ticn t ? the processor ?
(A) (A) Static memory
(B) p) Dynamic memory
(C) (ROM) (C) ROM
\
(D) P) Secondary storage
70. I/O ^ ^ ^ 70. EO devices communicate with the processor
-qWr t ': through a/an;
(A) (A) Control Bus
. (B) I/O ^ '^* fesiT ^ P) I/O Bus and System Bus
(C) I/O^ (C) EO Bus
P) I/O ^ T33 I/O ^ p) EO Bus and EO Bus Controller
(8)S/22/2024/A
Text of page 9
71. PiHrdRsld ^ ^ WTt^T 71. Which of the following loop is
^ 1^ ^ used to ensure that the statements
^ ^^ ^ ^ within the loop are executed at least
^ PimP^d (Execute) ? once ?
(A) For ^ (B) While^ (A) For loop (B) While loop
N
(C) do-while"^ (D) Next"^ (C) do-while loop (D) Next loop
72. 3tTM3.i< ^ . 2RWT-3TOT . 72. The process of making an operator to
'(Instance) 3^-37OT 3I^Md exhibit different behaviours in different
. ^ yPsh-^l ^ W ^sticIT t ; instances is known'as :
(A) (A) Enc^sulation
(B) T3®fft^ (B) Abstraction
(C) ^ (C) Data Hiding
(D) 3tld<ellfe*d P) Operator Overloading
73. ^®T 73. A server having link with different clients
where the applications execute is known
^101 ^ : as: ,
(A) (A) Client Server
•/ ' '
(B) ^ P) Rack Server
(C) (C) Link Server
(D) 'h4< P) Application Server
74. C UliilPHM W "^f # include TO t ? 74. What is # include in C programming
language ?
(A)
(A) Header File
(B) 3TTfi^i5tWR P) Identifier
(C) (0) Preprocessor Directive
(D) P) Macro •
P.T.O.
(8)S/22/2024/A
Text of page 11
19, (Reflection) x-axis ^ 79. The reflection about x-axis is
(about) rHHPdReld OT ■ represented by the following transformation
^t : matrices :
-1 0 0 -1 0 0
(A) 0 1 0 (A) 0 1 0
0" 0 1 0 0 1
1 0 0 "l- 0 o"
(B) 0-1 0 (B) 0-1 0
0 0 1 0 0 T
-1 0 0" "-1 0 0'
(C) 0 -1 0 (C) 0 -1 0
0 0 1 0 0 1
0 -1 . 0 0 1 0
1 0 0 (D) 1 0 0
(D)
0 0 1 0 0 1
80. ^ ^ ^^ 80. Which curve representation uses a
^h^hVi ^ 3TT^iH ^ l^^tRd set of control points to determine the shape
^t ?^ TI«1R of curve with the cun'e always
-' 35k 3Tf^ fpm t^sjf ^5^ ipRdT passing through the first and last control
' t 1 points ?
(A) ^ (A) B-spline curve •
(B) ."^ (B) Bezier curve
I
(C) ^ (C) Spline curve '
(D) nToil^ilicrt (D) Polygonal curve
■(8)S/22/2024/A P.T.O.
Text of page 12
81. c+i'l'KHI 81. Which level of the three-schema architecture
(^<) ""jt ^ Riy. sftr describes the structure and constraints for
«
^ ^Tjf^ ■!■ ? the whole database ?
(A) ^iaR=ti (A) Internal schema
(B) (B) Conceptual schema
(C) (C) External schema
P) ^ ^ (1^) (D) User view
82. ^ i{Z ^ ^ 82. A weak entity set must be associated with
^ ^^ another entity set, called the...;....' ;.in
. '?tHT ^ileM. I order to be meaningful.
(A) ■ (A) Identifying set
(B) ^ TTfe^ ^ (B) Strong entity set
(C) ^ (C) Candidate set
(D) MiRhd (D) Partial entity set
83. (4i*c+J^H(ri 83. When the functional dependency rule
■Rm A->B 1TRT t A->B holds and B:c->_v holds,
TTPT t, ^ ^ ^#rn t then which rule implies that the
% A;c->^ ttp^ f ? Ax-> y holds ?
(A) ^fe fWT (A) Augmentation rule
(B) 1^ (B) Decomposition rule
(C) WTO 1^ (C) Transitivity rule
(D) WTRTTO "Pro P) Pseudotransitivity rule
(8)S/22/2024/A ^ 10
Text of page 13
84. XML ^ t: 84. The purpose of an XML namespace is to :.
(A) XML "^TTST (A) Provide a programming interface
fcTT3; 13;^ yluirH^i for working with XML
documents
(B) XML ^^ Ail^iii (B) Provide metadata about an XML
=h<11 document
(C) ^^ (C) Avoid naming conflicts between
- ;HlMch<u| w^ elements and attributes
(D) XMLtN^I^ ^ ^ (D) Define the structure and context of an
"^Tf^iP^a ^<11 XML documents
85. HI^Pi'M "A* "R^ ^ 85. What is the primary goal of the support
3n«fe ^8?T ^ t ? vector machine in data mining ?
(A) ^ ^ (A) To represent data relationships
(B) 3#7?T (."feA^) ARn-Ntri ^ TJ^ (B) To predict the value of a dependent
^ilqisqqiuH qiV.il viable
(C) 4dlA7H ^ ^ "Rlf^ ^ a#I^7HTT (C) To maximize the margip between
classes 0
(D) ^mIcI Aqti< ^ ■y'^sqi- '\'iciH (D) To minimize the number of support
vectors
86. NOSQL "A' 86. Document-based NOSQL database have
Pi*-iRip2ici [q^l^ai elcil f : the following characteristics:
(A) "Sisr ' (A) Stores data in a tabular format
(B) sJTSt^ ^ ^ . (B) Supports transaction and joins
(C) (■yRFqa) -SKI ^ (C) Best suited for handling structured
1^ t ■ ' data I
(D) M<l:isbR ^ t ^ (P) Stores data in nested hierarchies
P'.T.O.
(8)S/22/2p24/A 11
Text of page 14
87. 1TPT X (a, b, c, d) ^ 87, Assume X(i/, Z?, c, t/) and Y (s, t, u, v)
Y (s, t, u, v)^ t a, X ^ be two relations in which a is foreign key
^ t, Y^ ^ of X that refers to the primary key of Y.
^ t I PHMfdRsicf ■^* Which of 'the following Operations
«+>1h^I dtiWn
✓
causes the referential integrity constraint
violation ?
® x^* ■^' (i) Insert into X
(li) , Y ■^* (li) Insert into Y
Ci® X^ ^ Delete from X
(iv) Y"^ (iv) Delete from Y
(A) (i) 3Sk (iy) (A) Both (i) and (iv)
(B) ^ (ii) 3Tk (iii) (B) Both (ii) and (iii)
(C) <i4^^ (C) All of the above
(D) ^ ^ ^ (D) None of the above
88. EMPLOYEE-4* 10 1^ fl 88. A table EMPLOYEE has 10 records. It has
■ Non-NULL SALARY ^TFT^ a non-NULL SALARY Column which is
t, ^ UNIQUE ^ t 1 also UNIQUE.
■zrf^SQLT^S^ If the SQL statement
SELECT COUNT (SALARY) FROM SELECT COUNT (SALARY) FROM
EMPLOYEE WHERE SALARY NOT IN EMPLOYEE WHERE SALARY NOT IN
(NULL): (NULL):
frorfer 1^ wr t, ^ ^\66^6 ^ is executed, what will be printed as
^ ■^* TO 1^ ?Ptt ? . output ?
(A) ERROR (B) 9 (A) ERROR (B) 9
(C) 10 (D) 0 (C) 10 (D) 0
(8)S/22/2024/A 12
Text of page 15
\
89. R 89. Consider the relation ■ schema
R = {A, B, C, D,E, F, G, H,I, J} t alk R = {A; B, C, D, E; F, Q H, I, J}
f^MRrlHsId l^^feTT and the set of functional
dependency: .
^ deafen :
{ {A, B} ^ {C},
{ {A, B} ^ {C},
{B} ^ {E, F},
{3} ^ {E, F},
{A, D} ^ {Q H},
{A, D}'^ {Q.H},
{G} {I}, {H} -> {J} } on R.
{G} ^ {I}, {H}.^ {J} }"
Which of the following is a candidate key
■ 3T^ "Sfrnm. RnRriRsld "^* R
forR? -
^ %3; i .?
>)
(A) {A,B}
(A) {A,B}
(B) {A,B,D}
{A, B, D}
.(C) {A, B, D, Q H} (C) {A, B, D, G H}
(D) {A}
P)' {A}
■ 90. "^rf^ ■^* 4,00,000 90. If a data warehouse contains inventory of
(^- ■^) %IT ^ f, ^ 4,00,000 items with a bitmap index on item
, ^ 5T "fe^ t I colours. If there are five item colours (red,
"4' ij] (BM, "^TT, 3^
green, blue, white and black), how much
wn) ^ t, ^
index size storage will be required ?
•^IT^ ^ 3iic|y^=hdl #Tt ?
(B) 250 k
(A) 200 k (B) -250 k
(A)' 200 k
(D) 400 k
(C) 300 k (D) 400 k
(C) 300 k
13 P.T.O.
(81S/22/2024/A
Text of page 16
91. Which is not scheduling criteria for CPU
« ^
' "^fteTT t ? kiheduling ?
(A) (A). Turnaround time
(B) HTfTT (B) Waiting time
(C) kMl-y (C) Response time
(D) ZTfq (D) Remaining time
92. "OT ^TOT, TT^ W( ■^* 92. Data enciyption standard work on a block
^ "^fhi cfiiH ch-tdi ■^TR^ ■§* : . of bits at a time, is known as :'
• \
(A) "^ff^ %R ' (A) Block cipher
(B) tOTT (B) Stream cipher
(C) ^ (C) Data cipher
(D) ftm (D) Clock cipher
93. Ch^trt ^ Ah1<1 chli^t 93. Which is not memory management function
f ? of kernel?
(A) ^ 1^ -q;^ ^ ^ (A) Allocation of address spaces to 'the
37TTO ; process
(B) (B) Buffer management
(C) '^' V^ (C) Paging and Segihent management
(D) (D) Swapping
(8)S/22/2024/A 14
Text of page 17
94.- ^ 94. Necessary and sufficient conditions for
"f^arfOT f : deadlock to occur is/are :
(i) (i) Mutual exclusion
(ii) ^ (ii) Hold and wait
Ciii) ^ y1ij;>^H ® No preemption
(iv) ^ (iv) Circular wait
(A) (A) All of the above
(B) .©,(")^(iii) (B) (i),(ii) and (hi)
,(C) (i)alk(ii) ■ . (C) (i)and(ii)
P) (i)^(iii) (D) (i) and (ih)
95. '^, 95. In multithreaded programs, how should
^HlMMd: ^ "STPTT ? asynchronous signals generally be handled ?
(A) =ti^d "feqn^ ti'ia ^"-sm (A)■ By delivering the signals to the defeult
signal handler only
(B) ^ ^ t. (B)' By ignoring the signals if the process
^ qR tqqr ^mi "qiley. has multiple threads
(C) ^ ^ (C) By delivering the signal only to the
^nqr "^rf^ 1^rt^ dcn^i Iq^qr thread that caused it
P) qit ^ (D) By delivering the signal to all threads
I
in the process '
(8)S/22/2024/A 15- P.T.O.
Text of page 18
96. (VM)^ 96. Which of the following features distinguishes
. WTfW ^ 31OT Wt Virtual Machine (VM) for Traditional
t, Tf^ ^^ 3^ _ Operating System regarding Virtual Machine
'i ? Management ?
(A) ^3T^ T??Tt^ ^ ^ 3fk (A) The ability to fieeze a virtual machine
"f^S# and create a snapshot of its state
P) The capability to directly modify
(B) "51^^ «1GI^ ^ 1^ ^[dJ^ hardware settings for enhanced
•performance
(C) "rr?M* '^' (C) The use of complex algorithms to
improve network security within virtual
•^TpiW machines
P)^^ i^Pstiki ^ ^ %T3; ^3^^ P) The implementation of advanced
adctil ^ iNl'<^'4H encryption methods to protect data "
97. Rhtfl 3PWri ■^* ^ ainlfe^i R^wh "fe^ 97. In a system where the operating system is
^ ^ t afe ^ ^ stored on disk and the bootstrap loader is
^ t, ^ een^ ^ ^ipT^ in firmware, what is the primary role of the
.w t ? boot; block ?
(A) sfrqy^ f^T^ ^ (A) Load the entire operating system into
"4* ote memory directly ■
p) fs^ ^ Tj;^ RiR'cia ©oiTcti He'll P) Read a single disk block and provide
afR ^ ^ ^ the address and length of the
sfR w^ 31^ ■ remaining boot strap program
(C) amtf^ fwR ^ ^.' (C) Encrypt the operating system files on
■f^ TR T^f%^ disk for security
P) affqtfCT fe^iT ^ ^ -q^ P) Initialize hardware devices before
loading the operating system
{8)S/22/2024/A 16
Text of page 19
98. In which disk scheduling policy disk request
^ f^^TTf^ t ? • queue is segmented ?
(A) T3:?r.^.T3;.TT^. (A) SCAN
(B) (B) CSCAN
(C) T^^.T3:^T.^.T3;.T37T (C) FSCAN
(P) T3:^.T3:^T.^.T^^. (D) SSTF
99. ^ 'I'^K 99. The percentage of times that the page
^ "qn^; "STT^ ^ TrfcRTcmr ^ ^ number of interest is found in the translation
^TTcTT ^ ? look-aside buffer is called :
(A) (A) Access time
(B) fe (B) Hit- ratio
(C) ^ (C) Bifer time
'(D) ^ tfM (D) Packet ratio
100. TI^ ^^3Tf^ 100. Calculate average waiting time of
^ sfte TIcTt^ ^ =t)1Riy, process under.Round Robin scheduling
C1iRi'=M fcii^ Hl^l scheme if time quantum is 10 ms for given
10 ms f : table :
■ mPs^-^I (ms) Process Burst Time.(ms)
P, . ■ 10 I'O
P2 , - 29- P2 ■ 29 •
P3 3 P3 3 ■
P4 7 P4 7
P5 12 ■P5 '2
(A) 23 ms (B) 23.25 ms (A) 23 ms (B) 23.25 ms
(C).23.50 ms ■ (D) 23.75 ms (C) 23;50ms (D) 23.75 ms
(8)S/22/2024/A 17 P.T.O.
Text of page 21
105. ^ ^ ^ 105. When the functions of a module are
smfsT fH^MiRd ^5Tmr t, executed in the same time span, then
^^ : it is:
(A) eiTI^ictitn ^ (A) Logical cohesion
(B) ^^l<d ^t p) Temporal cohesion
(C) 4)*d^Hd ^t (C) Functional cohesion
P) yk1>^<d c+,l^>dH t P) Procedural cohesion
106. 37Tf¥^SF^ Ti^ 3Tk 106. Which architectural'style uses one connector
. ^ i ? and one component ?
(A) WI 3?k (A) Pipe and Filter
^ . '
(Q) ^ p) Shared data
(C) (C) Clinet-Server
. p) HfWt^;i-^®tishi^q P) Publish-Subscribe
107. ,t : ^ 107. VOTfication is:
(A) ^ ^ Tt t ? (A) Are we building a right product ?
P) ™ ^ ^^ ^ f ?
p) Are we building the product right ?
(C) ^ ^ "Sf^ m WT ^
(C) Are we following a standard
. ■ Tt f.?
process ?
P) ^ ^ TTH^ <iMdi<uiT ^ wiW
P) Are we using standard tools ?
^ Tt t ?
(8)S/22/2024/A 19 P.T.O.
Text of page 22
108. 1 ^ 10 feFit 108. What amount of software can be developed
in 1 year 10 months in an organization
t, "Mf^ 2400 t, ^ whose technology factorls 2400, if a total
IPTRT ^ 25 PY (Person- of 25 PY (Person-Year) is permitted for
Year) ^ 31^iTffT ^ ? development effort ?
(A) 28590 (B) 26590 (A)' 28590 (B) 26590
(C) 27920 (D) 27290 (C) 27920 (D) 27290
109. t T3;^ : 109. Mutation testing is a :
(A) (A) Graph-based testing
(B) T^-3TT?qTft^ (B) Model-based testing
(C) (C) Code-based testing
(D) WS-3TT^?TfeT p) Fault-based testing
F
110. t. ? 110. Which is a configuration management tool ?
(A)-^#it (A) D jango
(B) P) Marathon
(C) ^ (C) HIPO
(D) P) sees
(8)S/22/2024/A 20
Text of page 23
111. rHHPeiRsId arsrff ^ ^ ^ ■4* 111. Given the following,list of letters inserted in
^ "TO t : order into an empty binary search tree :
J, R, D, G, T, E, M, H, P, A, F, Q J, R, D, Q T, E, M, H, P, A, F, Q
hR"ii41 ^ ^ 1^-a^ What is the in-order traversal sequence of
% 7 the resulting binary search tree ?
(A) J, R, D, Q T, E,"M, H, P, A, F, Q (A) J, R, D, G, T, E, M, H, P, A, F, Q
(B) A, D, E, F, QH, J, M, P, Q, R,T (B) A, D, E, F, Q H, J, M, P, Q, R, T
(C) Q, P, M, T, R, J* H, Q F, E, D, A (C) Q, P, M, T, R, J, H, Q F, E, D, A
(D) T, R, Q, P, M,J, H, QF, E, D,A (D) T, R, Q, P, M, J, H, Q F, E, D, A
112. ^nfTRT t : 112. Heapsort involves :
. (A) ^ ^ ^ ^ZHT 3Tk ^ ^ (A) Removing data from a heap and then
, ^leidl inserting it again
(B) Copying data .from one heap to
MfdRrirM another
(C) ^ ^ ^ (C)- Copying data from the array
*^* ■Slil MldRdpH representing a heap to the heap
(D) ^ T^" sfk ftR (D) Inserting data into a heap and then
removing it ,
113. V^. ^ UN) ^ (MST) 113. In a weighted graph, ' the Minimum
rHHPdRsid ^ ^ ^ ^ 3FIRT Spanning Tree (MST) tries to
t ? minimize:
(A) mP^ ^ (A) the number of edges from the starting-
^ ^ tiysqi vertex to a specified vertex
(B) ^ (B) the number of edges connecting all the
vertices
(C) hk'Rnt ^ PiR{t>d qJ-w ?N)" (C) the total weight of the edges from the
starting vertex to a specified vertex
(D) qJ-w ^ (D) the total weight of the edges
r
connecting all the vertices
1
{8)S/22/2024/A 21 P.T.O.
Text of page 24
114. V 3^ E Trnrr 114. What is the running time complexity of
- (DPS) ^ Tf^ ^T?TT Depth-First Search (DPS) on a graph with
^ t- ? V vertices and E edges ?
(A) 0(V) (B) 0(E) (A) 0(V) (B).O(E)
(C) O(V.E) (D) 0(V + E) (C) 0(V. E) (D) 0(V + E)
115. a + b * c ^ die * h'^ 115.. What is the postfix notation of the infix
m1 WPqi^HJ T33^mFT ^ t ? expression : a + b * c- d I e * h
(A) abc * de i h.* - (A) abc * + de I h
(B) ab + * c - de I h (B) ah + * c ~ de I h *
(C) a + b*c~dleh* (C) a + b*c-dleh'^
(D) ab*c + dle-h* (P) ab * c + d le - h ^
116. f («) = + m yP- + 50 116. What is the asymptotic upper bound for the
^ aro function
t ? f{n) + 100 «2 + 50 ?
(A) 0(1) ,(B) 0(«) (A). 0(1) (B) 0(«)
(C);0(«4) (D) 0(«2) (C) 0(«4) ' (D) 0(«2)
117. : 117. What is the time complexity of the
r3T(«-l), ^«>0 . recurrence retation:
T(n)= -^
[ 1,
3T(«-1), if rt >0
T(«)=
^ "SlfH ^t ? 1, otherwise
(A) 0(3") (B) 0(«3) (B) 0(«3)
(A) 0(3«)
(C) Q(n) (D) 0(« log n)
'. (C) 0(«) (D) 6(« log ti)
(8)S/22/2024/A 22
Text of page 25
118:.PlHTdRsid ZTfTT '=hTk^[^d1 118. What is the time complexity of the following
■ W t- ?■ - function?
def function («): ' def function (n):
count - 0 count = 0 • .
if/?< = 0: lf«< = 0:
return
return
for / in range (0, n) : for i in range (0, ri) :
*
y- 1 -
■ y=1
while j < n : while j<n :
j=j + i ' j=j-^i ■
count = count + 1
count = count + 1
print (count) print (count) - '
function (20) function (20)
(A) 0(n2) (B) 0(n) (A) 0(«2) (B) 0(/7)
(C) O(nlogn) p) O(log«) (C) 0(« log n) (D) O(log n)
119. -^9^ iFTW Pi^RiRaa ' 119. Consider the following instances of the
knapsack problem :
^3# ^ ^f^sqi rt = 3 Number of items n = 2>
^ m = 20 Knapsack capacity w = 20
m (Pi,P2,P3) = (25, 24, 15) . Profits (P,,P2,P3)== (25, 24, 15) .
(Wj, ^2, W3) = (18, 15, 10) Weight (wj, W2, W3) = (18, 15, 10),
Pi^-iRiRaci ii chln+ii 04=1^14 Which of the following feasible solutions
3TfTOrm ^ t ? gives the maximum profit ?
(A) (1/2,1/3, 1/4) (B) (1,2/15,0) (A) (1/2,1/3, 1/4) (B) (1,2/15,0)
(C) (0, 2/3, 1) (D) (0, 1„ 1/2) (C) (0, 2/3, 1) (D) (0, 1, 1/2)
' 1-20. ^^ ^ ^ 4"' 120. What is the most appropriate data stmcture
^ Rm. dH^cKl ^131 to print elements of a queue in reverse
order ?
(A) (B) %xs (A) Stack (B) Linked list
(C) ^ (D) f (C) Graph , (D) Tree
(8)S/22/2024/A 23 P.T.O. .
Text of page 26
121. ^ STRlto (FA) OT 121. Languages that can be accepted by Finite
t, "^J^" WJ Automata (FA) can be represented by
wtn t, f■: formulas called:
(A) ^TH4)1 (A) Chomsky Expression
(B) Wfe' (B) Turing Expression
(C) . . (C) Non-regular Expression
(D) (D) Regular Expression
122. Tlcfe R^RJci ^ t : 122. Every Recursive Language is
(A) (A) Non-Computable
(B) (B) Uhdecidable
\
(C) (C) Recursively Enumerable
(D) ZIf^-3 ^ (D) Type-3 Language
123. -feZTfTTRTfe^ ^ 123. Deterministic and Non-deterministic
3lfsW^r : Pushdown automata:
(A) f' (A) are equivalent
(B) ■^' t (B) are not equivalent
(C) ^ ^ t (C) cannot accept regular language
P) t (D) have finite memory
(8)S/22/2024/A 24
Text of page 27
124. ^ ^ ^ TftnW' 124. In analysis part of a compiler information •
^ ^ 3|r wft?T, "fer about the source program is collected and
I
"^RT '4* [^<h1 >Jiicii "i^, ^: stored in a data structure which is :
(A) .(A) Syntax Table
(B) P) Information Table
(C) (C) Symbol fable
■(D) ^Ri<qcn ■ p) Variable Table
125. itmfm ^ ^ 125. The syntax of programming language,
f^-H^h "gH PlR^ constructs can be specified by which
t ? notation ?
. (A) wf (A) Turing-Church's form
(B) mii4 P) Griebach-Normal form
(C) (C) Chomsky-Normal form
/
(D) 4i|4 P) Backus-Naur form
126. "f^ ^ ^ yl41^< ^ 126. In a program, each time, a
1^ WT t, procedure is called, local variables are
•^* 4ilf^d ^t I • stored in a :
(A) ^ (A) Heap storage
(B) P) Stack storage
(C) t. (C) Activation Tree storage
P)- ^ P) Queue storage
25 P.T.O.
(8)S/22/2024/A
Text of page 28
127. (compilers)^ 127. To build a suit of compilers,
^ Riy. a<1<^ii chi4>1 "4' "a^rra which approach can be used to save
effort. ?,
(A) (A) Syntax Directed Translation
(B) ^*e<Hlfsy.e (B) Intermediate Representation
(C) (^Rrti=h^n snrfMw (C) Lexical Analysis
(D) ^ 3TffteqT?%^ (D) Parallel code optimization
128. LR (K) "4' K ^ t : 128. The K is LR(K) Grammar refers to :
'(A) ^ ^ (A) The number of symbol of lopkahead"
WTT
on the input
(B) MlsctAfH ^ "^Fs^T
• (B) The number of production
' (C) TTT^ ^ ^ ^*<241
(C) Number of Levels in Parse Tree
(D) (^-xjte^;^) ^
(D) Number of Null-Productions
129. Xr^ HNT ^ ^rak ^ chHl^d< 129. A language processor that can usually give
^ a^ll k' <^eu< ^kfcTT f : better .error diagnostics than a compiler is :
(A) idiildi (A) Interpreter
(B) "^1?^ (B) Byte Code
(C) 3T^T^ (C) Assembler
■ (D) xit-Ti^ (D) Pre-processor
130. 'm\ -m 3Tfe ^ 130. The set of all strings obtained by
TIM ^ ^^ concatenating zero or more strings from a
«n?n f : Language is called:
(A) qr^Rte-cj kn% (A) Conjunctive normal
■(B) ife kn% ^ (B) Griebach normal star
(C) ^ (C) Superset star
(D) ^ p) Kleene star
{8)S/22/2024/A 26
Text of page 29
131. OSlTffe^ ^ 131. In OSI model, routing of the packets to
(^^) ^ *^1^* their final. destination is done
#TT "gRT fen ^-t I by. .layer.
(A) pM^r^ctiQI "(A) Physical
(B) "SRlf^ (B) Datalink
^ >
(C) ■(C) Network
P) (D) Transport
132. "W "^HT ^ witTT 132. - is a measure of the probability
<i\c\^ "^f ^ of errors remaining in a network despite the
■^TT^mi '^' ' use of an error detecting scheme.
(A) ■ (A) Bit error rate
(B) ^ . (B) Residual error rate
(C) Tito ife (C) Symbol error rate
■ (D) -sSWh ife ^ (D) Attenuation error rate
(
133. ite "^ « "^Tt^ ^ ^^ 133. The number of physical links in a fully
(Mesh) Adqqi' '^* , .connected mesh network with n nodes in
^ •; I duplex mode will be
(B) ■ n{n + l)/2 (A). (n + 1) (B) n(n + l)/2
(A) '{n + 1)
. (C) n{n - l)/2 (D) n(« - 1) (C) nin - l)/2 (D) n{n - 1)
27
P.T.O
(8)S/22/2024/A
Text of page 30
134. TCP/IP ylilchM ^ ii fer 134. Port address used in an Internet
TT^' ; --fe ^ employing TCP/IP protocol is comprised
f- I of. bits.
(A) 8 (B) 16 (A) 8 (B) 16
(C) 32 (D) 128 (C) 32 (D) 128
135. fe ^ TRs^IT f^RT^* 135. The number of bit positions in which two
t, ; •^. f I codewords differ is called the
(A) ^ (A) Euclidean distance
(B) (B) Cosine distance
(C) tiTFT ^ (C) Hamming distance
(D) ^ (D) Manhattan distance ■ ■' ■
136. ^ mciRj^ ^ ^ 136. The technique of temporarily delaying
Pqtn'f^d ^ WfN? BTf^ outgoing acknowledgements so that they can
3P1^ ^ :gTSr ^ ster be hooked onto the next outgoing data
^ ■^- f I frame is called
(A) WW^ (B) (A) Pipelining (B) Piggybacking
(C) (D) (C) Pagbg, (D) Sliding Window
137. Phtil ^dqqi ^ f^iRiichcrl ^ 137. Which protocol is used to fmd the Logical
"5^ eiiPiiq>«n ^ %TT ■address for a network machine from its
tW uVUm ^ 3PjW fen ^ t ? Physical address ?
(A) qi^^ioi ylilchTd , (A) Message Control Protocol
(B) y,4^ fefte^?FT yl-ilqiici (B) Address Resolution Protocol
(C) HiKqi Tt|^ (C) Forward Address Resolution Protocol
(D) "ffe "Q^. feftc^^PT (D) Reverse Address Resolution Protocol
(8)S/22/2024/A 28
Text of page 31
138. ^ ^ ^ 138. Domain name space represented as a
inverted hierarchical tree structure can have
(^qcn "f I a maximum of. .levels.
(A) 64 (B) 128 (A) 64 (B) 128
(D) 512 (C) 256 (D) 512
(C) 256 •
139. PHMRrtfeld' dJld-Hl laaS =Kii<JS 139. Which of the following cloud services is an
6<}^m t ? example of laaS ? - . -
(A) (A) Google Drive,
. (B) (B) Salesforce
(G) S3 (C) Amazon S3 •
(D) ^l^sbl^T^ri- arfPli^ 365 (D) Microsoft Office 365
140. CDMA ■^, fe "^1^ ^ m 140. In CDMA, each bit time' is
3icRr^' t, subdivided into m short intervals
: "^fRTT f I called.
(A) (A) Segments
(B) (B) Fragments
■ (C) 1^ . , (C) Chips
(D) (D) Chunks
29 P.T.O,
(8)S/22/2024/A
Text of page 32
141. 31^-^ -gpFT ^ 141. The effectiveness of alpha-beta pnmning
is dependent on the order in which
^ "i" ? the states are examined.
(A) 3T?^tT^ (B) (A) highly (B) never
(C) -^-lan (D) (C) minimum (D) always
142. Loves (TFT, T^) V Loves (TFT, 142. Loves (Ram, Shyam) V Loves (Ram,
^15^) '^Ff Pi^HUi oq^ Mohan)expressing knowledge
i I representation.
(A) (B) ^ ■ (A) Incomplete (B) Complete
.(C) 3h^'^cki (D) uq^T (C) Disjoint (D) Type restriction
143. yPd'HHl f^r*5H mfro 3T^?:q 143. -Regressive planning works fiom
^ -qnTT "^tTtTT tfie goal rather than from the initial'
11 state.
(A) it#, it#' ■ (A) Backward, Backward.
(B) it#, 37Ft (B) Forward, Backward
(C) ani, arri (C) Forward, Forward
(D) ani, it# ■ ' (D) Backward, Forward
144. #t ^ ^T®^* 144. Inflectional morphology expreses
^ it^' TT^^^' ^ ^iTit relations between words of the same part
t I ■ of speech.
(A) (A) Syntactic
(B) iifiim=ti (B). Lexical
(C) ari^juf (C) Semantic
(D) "q^* ari^ .(D) Semantic and Lexical
{8)S/22/2024/A 30
Text of page 33
145. ^ t" ? 145. Which of the following is correct ?
(A) = ST^^TTH + (A) Retrieval = Indexing + Rank Precision
(B) = "5^rf<T +. ^ishHi (B) Search = Retrieval + Indexing
(C) MR^<Stii (C) 'Indexing = Search + Rank Precision
(D) (D) Retrieval = Indexing + Search
■ 146. iwif ^ 146. In Hopefield Network, the asynchronous
3=[lIcR ^ updating of the units allows a function
known as :
(A) c^IFJ^ (A) Lyapunov function
■(B) RieiRin (B) Delayed furiction
(C) TO (C) Gamma function
(D) (D) Exponential function
147. ^cHllR^M "^TT^ 147. In the reference to Death penalty in Genetic
■^f rHMprlRsId t : ■ algorithm, the following is not correct:
(A) "^TF "^^3^ ^ "^TOcIT t (A) It handles constr^ts
(B)' ^ ^ ^ TOK (B) It can be applied for both single
.•^ "^iTOT tro and multi-objective constraints
"I" problems
(C) t (C) Generates feasible solutions
(D) ^ t (D) The mutation rates may increase
31
P.t.O.
(8)S/22/2024/A
Text of page 34
148". ^ ^ 148. A straight forward approach of maintaining
■ ■ y^K etMiy, «2l^ ^ l<cb 'jR^ctiVl a uniform spread of solution in objectives
^ "I" I space is known as
(A) (A) Rake selection
. (B) (B) Feasible selection
(C) aRi*»7^ ' (C) Infeasible selection
(D) (D) Bounded selection
\
149. LRTA* 149. In the context of LRTA*, a real time
^ rHHPdRsId t : heuristic search algorithm the following is
(A) h-'m ^Rxn t correct:
(B) ^ ^ (A) The /z-values always decreases
(B) The /^-values never increases
(C) h-W] WT 3ik
(C) The A-values sometimes decreases
t
and sometimes increases
P) /i-BH T3;^* Wldil4 (D) The'/^-values never decreases and
7??IT f remains admissible
150. 3fee ^ rHMPdRsId 150. Which of the following is not correct in the
"H^ t ? context of an inner product ?
(A) ^ ^HHPnPd ^ ^^nftri (A) It must satisfy Symmetry
(B) ^ ^Tf^TT^PmM ^ (B) It must satisfy Bilinearity
(C) ^ ■^' (C) An inner product space is not a
t Pre-Hilbert space
(D) ^ T3^ ^ im (D) A Hilbert space is a complete inner
■ t product space
(8)S/22/2024/A 32
Text of page 35
(SPACE FOR ROUGH WORK) S/22/2024/A
Text of page 36
(SPACE FOR ROUGH WORK)
V
1
/
V
:i
H
f'
}.
n
./
I '
• I
f ]
S/22/2024/A
Text of page 2
state Eligibility Test 2024
Final Answer Key
Computer Science and A ^plication (22)
Answer Answer Answer Answer
Key Key Key Key
A B C D /Option A B C D /Option A B C D /Option A B C D /Option
51 131 101 71 B 76 ' 56 126 96 D 101 81 51 121 D 126 106 76 146 B
52 132 102 72 A 77 57 127 97 B 102 82 52 122 D 127 107 77 147 B
53 133 103 73 D 78 58 128 98 C 103 83 53 123 B. 128 108 78 148 A
54 134 104 74 D 79 59 129 99 B 104 84 54 124 D 129 109 79 149 A
55 135 105 75 C 80 60 130 100 B 105 85 55 125 B 130 110 80 150 D
56 136 106 76 C - 81 61 131 101 B 106 86 56 126 A 131 111 81 51 C
57 137 107 77 A 82 62 132 102 A 107 87 57 127 B 132 112 82 52 B
58 138 108 78 A 83 63 133 103 D 108 88 58 128 C 133 113 83 53 C
59 139 109 79 B- ■ 84 64 134 104 C 109 89 59 ■ 129 D 134 114 84 54 B
60 140 110 80 D 85 65 135 105 C 110 90 60 130 D 135 115 85 55 C
61 141 111 81 C 86 66 136 106 D 111 91 61 131 B 136 116 86 56 B
62 142 112 82 B 87 67 137 107 A 112 92 62 132 D. 137 117 87 57 D
63 143 113 83 B 88 . 68 138 108 D 113 93 63 133 D 138 118 88 58 B
64 144 114 84 . B 89 69 139 109 B 114 94 64 134 D 139 119 89 59 C
65 145 115 85 B 90 70 140 110 B 115 95 65 135 A 140 120 90 60 C
66 ■146 116 86 A 91 71 141 111 D 116 96 66 136 C 141 121 91 61 A
67 147 117 87 C 92 72 142 112 A 117 97 67 137 A 142 122 92 62 A
68 148 118 88 D 93 73 143 113 B 118 98 68 138 C 143 123 93 63 B.D
69 149 119 89 B 94 74 144 114 A 119 99 69 139 D 144 124 94 64 A
70 150 120 90 C 95 75 145 115 D 120 100 70 140 A 145 125 95 65 D
71 51 121 91 c ■ 96 76 146 116 A 121 ' 101 71 141 D 146 126 96 66 A
72 52 122 92 D 97 77 147 117 B 122 102 72 142 C 147 127 97 67 D
73 53' 123 93 D 98 ; 78 148 118 C 123 103 73 143 B 148 128 98 68 A
74 54 124 94 C 99 79 149 119 B 124 104 74 144 C 149 129 99 69 D
75 55 125 95 B. 100 80 150 120 : A 125 105 75 145 D 150 130 100 70 C
Text of page 3
state Eligibility Test 2024
Final Answer Key
Defence and Strategic Stuc ies (23)
Answer/ Answer/ Answer/ Answer/
A B C D Option A B C D Option A B C D Option A B C D Option
51 121 91 81 A 76 146 116 106 A 101 71 141 131 B 126 96 66 56 C
52 122 92 82 B 77 147 117 107 C 102 72 142 132 A 127 97 67 57 A
53 123 93 83 D 78 148 118 108 A 103 73 143 133 C, 128 98 68 58 B
54 124 94 84 C 79 149 119 109 B 104 74 144 134 A 129 99 69 59 B,
55 125 95 85 B 80 150 120 110 B 105 75 145 135 B 130 100 70 60 D
56 126 96 86 C 81 51 121 111 C 106 76 146 136 A 131 101 71 61 C
57 127 97 87 B 82 52 122 112 A 107 77 147 137 C 132 102 72 62 D
58 128 98 88 A 83 53 123 113 D 108 78 148 138 D 133 103 73 63 C
59 129 99 89 B 84 54 124 114 B 109 79 149 139 C 134 104 74 64 C
60 130 100 90 B 85 55 125 115 D 110 80 150 140 B 135 105 75 65 B
61 131 101 91 B 86 56 126 116 A 111 81 51 141 B 136 106 76 66 D
62 132 102 92 C 87 57 127 117 C 112 82 52 142 C 137 107 77 67 C
63 133 103 93 B 88 58 128 118 B 113 83 53 143 D 138 108 78 68 A
64 134 104 94 C 89 59 129 119 D 114 84 54 144 B 139 109 79 69 B
65 135 105 95 A' 90 60 130 120 C 115 85 55 145 C 140 110 80 70 D
66 136 106 96 B 91 61 131 121 D 116 86 56 146 D 141 111 81 71 C
67 137 107 97 B 92 . 62 132 122 C 117 87 57 147 D 142 112 82 72 B
68 138 108 98 B. 93 63 133 123 A 118 88 58 148 A 143 113 83 73 C
69 139 109 99 C 94 64 134 124 B 119 89 59 149 D 144 114 84 74 B
70 140 110 100 D 95 65 135 125 D 120 90 60 150 C 145 115 85 75 D
71 141 111 101 A 96 66 136 126 C 121 91 61 51 C 146 116 86 76 A
72 142 112 102 D 97 67 137 127 B 122 92 62 52 B 147 117 87 77 B
73 143 113 103 D 98 68 138 128 1 C 123 93 63 53 A 148 118 88 78 D
74 144 114 104 A . 99 69 139 129 B 124 94 64 54 C 149 119 89 79 C
75 145 115 i05 B : 100 : 70" 140 130 A 125 95 65 55 A 150 120 90 80 A
Text of page 4
state Eligibility Test 2024
Final Answer Key
EARTH SCIENCE (25)
Answer Answer/ Answer Answer/
A B C D /Option A B C D Option A B C D /Option A B C D Option
51 131 101 81 A 76 56 126 106 A 101 81 51 131 D 126 106 76 56 A
52 132 102 82 C 77 57 127 107 B 102 82 52 132 A 127 107 77 57 D
53 133 103 83 C 78 58 128 108 A 103 83 53 133 D 128 108 78 58 A
54 134 104 84 B 79 59 129 109 C 104 84 54 134 A 129 109 79 59 B
55 135 105 85 C 80 60 130 110 B 105 85 55 135 C 130 110 80 60 C
56 136 106 86 B 81 61 131 111 B 106 86 56 136 C 131 111 81 61 B
57 137 107 87 D 82 62 132 112 D 107 87 57 137 B 132 112 82 62 C
58 138 108 88 D 83 63 133 113 B 108 88 58 138 B 133 113 83 63 A
59 139 109 89 B 84 64 134 114 D 109 89 59 139 A 134 114 84 64 B
60 140 110 90 C 85 65 135 115 A 110 90 60 140 B 135 115 85 65 B
61 141 111 91 C 86 66 ' 136 116 A 111 91 61 141 A 136 116 86 66 A
62 142 112 92 A 87 67 137 117 B 112 92 62 142 B 137 117 87 67 D
63 143 113 93 D 88 68 138 118 B 113 93 63 143 C 138 118 88 68 D,
64 144 114 94 A 89 69 139 119 C 114 94 64 144 A 139 119 89 69 A
65 145 115 95 A 90 70 140 120 C 115 95 65 145 D 140 120 90 70 D
66 146 116 96 B 91 71 141 121 A 116 96 66 146 B 141 121 91 71 A
67 147 117 97 . C 92 72 142 122 B 117 97 67 147 D 142 122 92 72 C
68 148 118 98 D 93 73 143 123 C 118 98 68 148 A 143 123 93 73 B
69 149 119 99 C 94 74 144 124 D 119 99 69 149 C 144 124 94 74 C
70 150 120 100 c 95 75 145 125 B 120 100 70 150 B 145 125 95 75 C
71 51 121 101 c 96 76 146 126 C 121 101 71 51 B 146 126 96 76 D
72 52 122 102 D 97 77 147 127 C 122 102 72 52 D 147 127 97 77 A
73 53 123 103 C 98 78 148 128 A 123 103 73 53 D 148 128 98 78 B
74 54 124 104 A 99 79 149 129 D 124 104 74 54 C 149 129 99 79 A
75 55 125 105 C 100 80 .150 130 B 125 105 75 55 C 150 130 100 80 A
Text of page 5
State Eligibility Test 2024
Final Answer Key
HOME SCIENCE (09)
Answer/ Answer/O Answer/ Answer/
A B C D Option A B C D pHon A B C D Option A B C D Option
51 131 111 91 C 76 56 136 116 C 101 81 61 141 B 126 106 86 66 B
52 132 112 92 C 77 57 137 117 D 102 82 62 142 A^ 127 107 87 67 A
53 133 113 93 A 78 58 138 118 B 103 83 63 143 A 128 108 88 68 D
54 134 114 94 A 79 59 139 119 B 104 84 64 144 C 129 109 89 69 D
55 135 115 95 B 80 60 140 120 C 105 85 65 145 D 130 110 90 70 A
56 136 116 96 D 81 61 141 121 C 106 86 66 146 C 131 111 91 71 C
57 137 117 97 D 82 62 142 122 B 107 87 67 147 A 132 112 92 72 A
58 138 118 98 C 83 63 143 123 A 108 88 68 148 D 133 113 93 73 B
59 139 119 99 D 84 64 144 124 B 109 89 69 149 D 134 114 94 74 C
60 140 120 100 B 85 65 145 125 C 110 90 70 150 B' 135 115 95 75 D
61 141 121 101 B 86 66 146 126 B 111 91 71 51 B 136 116 96 76 C
62 142 122 102 C 87 67 147 127 D 112 92 72 52 C 137 117 97 77 A
63 143 123 103 B,C 88 68 148 128 B 113 93 73 53 c 138 118 98 78 A'
64 144 124 104 D 89 69 149 129 C 114 94 74 54 D 139 119 99 79 C
65 145 125 105 C 90 70 150 130 D 115 95 75 55 B 140 120 100 80 A
66 146 126 106 D 91 71 51 131 D 116 96 76 56 C 141 121 101 81 C
67 147 127 107 D 92 72 52 132 B 117 97 77 57 A 142 .122 102 82 B
68 148 128 108 B 93 73 53 133 C 118 98 78 58 A 143 123 103 83 C
69 149 129 109 A 94 74 ■ 54 134 B 119 99 79 59 D 144 124 104 D
84
70 150 130 110 D 95 75 55 135 D 120 100 80 60 D 145 125 105 85 D
71 51 131 111 C 96 76 56 136 B 121 101 81 61 B 146 126 106 A
86
72 52 132 112 A 97 77 57 137 A 122 102 82 62 D 147 127 107 87 A
73 53 133 113 C 98 78 58 138 C 123 103 83 63 A 148 128 108 88 D
74 54 134 114 B 99 79 59 139 A 124 104 84 64 B 149 129 109 89 C
75 55 135 115 D 100 80 60 140 B 125 105 85 65 C 150 130 110 90 A
Text of page 6
state Eligibility Test 2024
Final Answer Key
MUSIC (24) PART I AND 11
Answer/ Answer/ Answer/ Answer/
A B C D Option A B c D Option A B C D Option A B C D Option
51 81 71 61 B 76 66 56 86 B 101 141 131 121 B 126 106 96 146 B
52 82 72 62 A 77 67 57 87 D 102 142 132 122 D 127 107 97 147 D
53 83 73 63 C. 78 68 58 88 B 103 143 133 123 D 128 108 98 148 A
54 84 74 64 A 79 69 59 89 D 104 144 134 124 B 129 109 99 149 D
55 85 75 65 B 80 70 60 90 C 105 145 135 125 D 130 110 100 150 B
56 86 76 66 C 81 71 61 51 A 106 146 136 126 A 131 111 101 91 C
57 87 77 67 D 82 72 62 52 C 107 147 137 127 D 132 112 102 92 B
58 88 78 68 C S3 73 63 53 A 108 148 138 128 A 133 113 103 93 B
59 89 79 69 B 84 74 64 54 D. 109 149 139 129 B 134 114 104 94 C
60 90 80 70 A 85 75 65 55 D 110 150 140 130 B 135 115 105 95 D
61 51 81 71 ■ C 86 76 66 56 B 111 91 141 131 C 136 116 106 96 D
62 52 82 72 D 87 , 77 67 57 A 112 92 142 132 D' 137 117 107 97 A
63 53 83 73 C 88 78 68 58 B' 113 93 143 133 B 138 118 108 98 C
64 54 84 74 c 89 79 69 59 C 114 94 144 134 C 139 119 109 99 A
65 55 85 75 c 90 80 70 60 A 115 95 145 135 D 140 120 110 100 A
66 56 86 76 D 91 131 121 111 A- 116 96 146 136 B 141 121 111 101 D
67 57 87 77 C 92 132 122 112 D 117 97 147 137 D 142 122 112 102 D
68 58 88 78 C 93 133 . 123 113 C 118 98 148 138 B. 143 123 113 103 C
69 59 89 79 A ; 94 134 124 114 D, 119 99 149 139 C 144 124 114 104 D
70 60 90 80 A 95 135 125 , 115 A 120 IQO 150 140 B 145 125 115 105 A
71 61 51 81 B . 96 136 126 116 D 121 101 91 141 D 146 126 116 106 B
72 62 52 82 , C 97 137 127 : 117 B 122 102 92 142 B 147 127 117 107 A
73 63 53 83 C 98 138 . 128 : 118 B 123 103 93 143 C 148 128 118 108 D
74 64 54 84 c 99 139 ' 129 119 A 124 104 94 144 D 149 129 119 109 C
75 65 55 85 c 100 140 130 120 A • 125 105 95 145 B 150 130 120 110 B
Text of page 7
MUSIC PART ill
Answer/ Answer/ Answer/
A B C D Option A B c D Option A B C D Option
91 131 121 111 B 116 96 146 136 A 141 121 111 101 B
92 132 122 112 B 117 97 147 137 C 142 122 112 102 C
93 133 123 113 B 118 98 148 138 A 143 123 113 103 D
94 134 124 114 B 119 99 149 139 C 144 124 114 104 A
95 135 125 115 D 120 100 150 140 D 145 125 115 105 D
96 136 126 116 D 121 101 91 141 C 146 126 116 106 B
97 137 127 117 C 122 102 92 142 C 147 127 117 107 D
98 138 128 118 B 123 103 93 143 D 148 128 118 108 A
99 139 129 119 D 124 104 94 144 B 149 129 119 109 C
100 140 130 120 C 125 105 95 145 D 150 130 120 110 C
101 141 131 121 B 126 106 96 146 A
102 142 132 122 A 127 107 97 147 D
103 143 133 123 D 128 108 98 148 B
104 144 134 124 C 129 109 99 149 A
105 145 135 125 A 130 110 100 150 C
106 146 . 136 126 C 131 111 101 91 D
107 147 137 127 P 132 112 102 92 A
108 148 138 128 D 133 113 103 93 C
109 149 139 129 B 134 114 104 94 D
110 150 ; . 140 130 C 135 115 : 105 95 B
111 91 141 131 A 136 116 106 96 A
112 92 142 132 C 137 117 107 97 P,B
113 93 - 143 133 B 138 118 1 108 98 D
114 94 , i44 134 P 139 119 109 9,9 B
115 95 145 135 B 140 120 ■ 110 100 A
Text of page 8
State Eligibility Test 2024
Final Answer Key
Answer/ Answer/ Answer/ Answer/O
A B C D Option A B C D Option A B C D Option A B C D ption
51 131 101 71 C 76 56 126 96 C 101 81 51 121 C 126 106 76 146 C
52 132 102 72 A 77 57 127 97 C 102 82 52 122 A 127 107 77 147 D
53 133 103 73 D 78 58 128 98 A 103 83 53 123 C' 128 108 78 148 B
54 134 104 74 B 79 59 129 99 D 104 84 54 124 D 129 109 79 149 B
55 135 105 75 C 80 60 130 100 D 105 85 55 125 A 130 110 80 150 D
56 136 106 76 B 81 61 131 101 B 106 86 56 126 A 131 111 81 51 B
57 137 107 77 D 82 62 132 102 C 107 87 57 127 D 132 112 82 52 A
58 138 108 78 C 83 63 133 103 D 108 88 58 128 C 133 113 83 53 A
59 139 109 79 C 84 64 134 104 B 109 89 59 129 c 134 114 84 54 A
60 140 110 80 A 85 65 135 105 A 110 90 60 130 B, 135 115 85 55 D
61 141 111 81 B - 86 66 136 106 C 111 91 61 131 B 136 116 86 56 D
62 142 112 82 A 87 67 137 107 C 112 92 62 132 C 137 117 87 57 C
63 143 113 83 D 88 68 138 108 B 113 93 63 133 c 138 118 88 58 B
64 144 114 84 B 89 69 139 109 B 114 94 64 134 D 139 119 89 59 B
65 145 115 85 B 90 70 140 110 D 115 95 65 135 B 140 120 90 60 B
66 146 116 86 D 91 71 141 111 B 116 96 66 136 C ■ 141 121 91 61 B
67 147 117 87 D 92 72 142 112 C 117 97 67 137 B 142 122 92 62 C
68 148 118 88 C' 93 73 143 113 B 118 98 68 138 B 143 123 93 63 D
69 ^ 149 119 89 C 94 74 144 114 A 119 99 69 139 B 144 124 94 64 A
70 150 120 90 C 95 75 145 115 B 120 100 70 140 A 145 125 95 65 B
71 51 121 91 A' 96 76 146 116 C 121 101 71 141 D 146 126 96 66 D
72 52 122 92 D 97 77 147 117 c 122 102 72 142 B 147 127 97 67 B
73 53 123 93 C 98 78 148 118 A 123 103 73 143 A 148 128 98 68 D
74 54 124 94 B 99 79 149 119 B 124 104 74 144 B 149 129 99 69 C
75 55 125 95 A 100 80 150 120 C 125 105 75 145 C 150 130 100 70 A
Text of page 9
state Eligibility Test 2024
Final Answer Key
PSYCHOLOGY (18)
Answer Answer/ Answer/ Answer/
A B C D /Option A B C D Option A B C D Option A B C D Option
51 121 91 71 A 76 146 116 96 B 101 71 141 121 A 126 96 66 146 A
52 122 92 72 C 77 147 117 97 B 102 72 142 122 C 127 97 67 147 C
53 123 93 73 C 78 148 118 98 B 103 73 143 123 c 128 98 68 148 B
54 124 94 74 D 79 149 119 99 B 104 74 144 124 D 129 99 69 149 D
55 125 95 75 C 80 150 120 100 D 105 75 145 125 C 130 100 70 150 B
56 126 96 76 B, 81 51 121 101 A 106 76 146 126 B 131 101 71 51 C
57 127 97 77 C 82 52 122 102 C 107 77 147 127 C 132 102 72 52 B
58 128 98 78 A 83 53 123 103 B 108 78 148 128 C 133 103 73 53 C
59 . 129 99 79 D 84 54 124 .104 B 109 79 149 129 A . 134 104 74 54 A
60 130 100 80 B 85 55 125 105 B 110 80 150 130 B 135 105 75 55 D
61 131 101 81 B 86 56 126 106 D 111 81 51 131 B 136 106 76 56 B
62 132 102 82 A 87 57 127 107 C 112 82 52 132 C 137 107 77 57 D
63 133 103 83 C 88 58 128 108 D 113 83 53 133 A 138 108 78 58 C
64 134 104 84 B 89 59 129 109 D 114 84 54 134 B 139 109 79 59 C
65 135 105 85 A 90 60 130 110 C 115 85 55 135 A 140 110 80 60 D
66 136 106 86 C 91 61 131 111 B 116. 86 56 136 A < 141 111 81 61 D
67 137 107 87 B 92 62 132 112 A : 117 87 57 137 B 142 112 82 62 A
68 138 108 88 D 93 . 63 133 113 D 118 88 58 138 A. 143 113 83 63 D
69 139 109 89 D 94 64 134 114 D. 119 89 59 139 B 144 114 84 64 C
70 140 110 90 A 95 65 135 115 B 120 90 60 140 D 145 115 85 65 A
71 141 111 91 A 96 : 66 136 116 A 121 91 61 141 D 146 116 86 66 B
72 142 112 92 B 97 . 67 137 117 C 122 92 62 142 A 147 117 87 67 A
73 143 113 93 A 98 68 138 118 D 123 93 63 143 C 148 118 88 68 D
74 144 114 94 C 99 69 139 : 119 A 124 94 64 144 A 149 119 89 69 D
75 145 115 95 D 100 70 140 120 C 125 95 65 145 A 150 120 90 70 APage 1 of 36
Source: Madhya Pradesh Public Service Commission. Question paper published by Madhya Pradesh Public Service Commission.