MP SET 2025: State Eligibility Test, Computer Science & Application
Text of page 1
W.
R/P/P/2025/II Question Booklet No.
Subject-Computer Science & Applications
SET A (i^fescb")
Paper II (Optional) 250303337
Name
Subject-Code-03
SIiFT -sijaiHl*!)^ if
^ ' Candidate should write his/her
Roll No. Roll No. in the given boxes.
TT^n/No. ofPrinted Pages :32 ^te^il/Total No. of Questions : 100
TFR : 3 wt 318?^? ^ fH(ni<tK ^^^ STf^IWI "'Jjfe/Maximum Marks : 200
Time Allowed :3 Hours to complete both 1st and Ilnd question paper
81? ^rraraif-'fir^ ej f i ■qrt^raf 3ttRf ^ *0 «iNr f i
31?^ "if "^IT "f I TI^T "SRT <i«td "t" I ■^' aftr ( Sfl'.T^.atlT. "^fte )
^ <»>i^ ^f?T »<tTs6 ^ % <t)ioii I
?tT H^ ^ fhctr^JT iso c»«npt«o tt^Jir % H trjt yA<t) uvi 2 sf^ ^ i "^Nf '5 wff
WTsrf^ranff 1 ^ ^1^ 2 1 at^[TrRri vtt ^ ^ afr'iff 11 ^ uicmtH
I
y?T-8iT I RiMw trn-'q^ (31^ Htgir i-so)
3I7T-8IT II . trff^ndf •gITT xJTtPrT giT 3I?T-8JT (TIVT ^ftSIT 51-150)
wyi-^fiq^ '^' ■'J^ "aff hVsmi 3tict<«j g?lff if I aft^iraT efit '«cni6 ^ ^ "fe % "55^ "fe
^ 8?^ '"j«o «^«ti % ^fsfl aftr ^ 1 st^rar "aft ^efO 3i^-^r^«»»i atcvnci tnt ^ 1
■?iw "arTT-aa^ (ert.t^.aar. ) -qr "Praffta wrif ar atiavaar qfefeai sw 'wraf ar i
uOttliviff wft Tf qn4 3i^-^Rd«hi ^ PialRd T«in ar ^ a;^, ataja a>ff a^ aar a^-aa (3it.3m.3TTT. 3fftT) ar at a^ 1 •
a^ ferit 3i?a a aairr aft aitf ar asaima? 3iaiiT ^ ^ at a?a ^ aar Tsa^ a a amar
ait aiaar aiar anrnrT 1
ftrat aanr a:T affa '^acT a ferft trair ^ ^^agrf^ ^ai?a aafit 8rt 3iata af^ t i -
^ arraait 3T?a-:^Rflt»i aa Pt^yj f^ar an^ aaT-3Taa> (a^.tija.aTiT. ??fta) "fif aarait t^rf^aaa%
wejci '«hiel ai^ »aT9c aata ait i
irftyTaaiaiat^ a9*ii<^ait.'^.aTi^^fta^^ra» apt ^a^ait^^ar^aaff ar^ 1
^aT-M:t<»' (3^.1^.3^?.) ar aaT ^ ajrar ■^fwaia cRt i
INSTRUCTIONS TO THE CANDIDATES
This Question Booklet is printed in two lan^ages—EUndi and English. Candidates can select any one of the
.two languages according to their.convenience.
Each question has four 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.
In this examination there are two question papers, consisting of 160 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.
PaperI General paper (Q. No. 1-60)
Paper U Question paper on the Subject opted by the examinee (Q. No. 61-160)
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 ohthe pages given in the Question
Booklet and nowhere else, not even on the Answer Sheet (OMR Sheet).
7. Ifthere is any sort of mist^e either of printing or of factu^ nature in any question, then out of the 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 baU:.point pen to mark the answers in the Answer Sheet (OMR Sheet) only after you are
instructed to open the QuestionBooklet.
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.
11. Before answering on Answer Sheet (OMR Sheet) ensure to follow the instructions given for that
(N)S/03/2025/A
Text of page 2
(SPACE FOR ROUGH WORK) (N)S/03/2025/A
Text of page 4
54. For a given undirected graph G =(V, E), 54. G = (V, E)
where V is the set of vertex and E is the
set of possible interconnections between "I" srk E ^ ^
pairs of vertices, which among the ^ t", PinRiRaa
following statements is true for the 'tAPi'i
spanning tree ? t ?
(A) A spanning tree T is a subset of
(A) ^ T "ITFF G ^ f^FTT^*
(Xr^) ^ t ^^
edges in graph 0 such that T have
^TFTT
a cycle covering all vertices.
"t I
(B) A spanning tree T is a cyclic and
(B) t 3?k-:G ^
connected subtree of G consisting
t, G^
of all the vertices and subset of E,
VtH sik E ^ "STO
such that G remains connected by
^TTfkFT t G, T ^ fekf ^
the edges of T.
W t I
(C) ■ A spanning tree T contains all edges
(C) ^ T, TTFF G ^^ I^FTRf
of graph G.
"^TTfiTeT ^RcTT t I
(D) A spanning tree T contains all
(D) ^ TWF G ^ ^ #Eif
vertices and edges of graph G 13^* feTRf ^ ^TTfkFT t I
55. The Boolean function 55.
F(A, B)= A + B-A . B F(A, B)= A + B-A - B
is equivalent to : . ' t:
(A) A- B (B) A- B (A) A- B ^ (B) A- B ^
(C) O ' (D) A + B (C) 0^ (D) A+ B ^
N-(5)S/3/2025/A
Text of page 5
56. If P(A) = 0.6, P(B/A) = 0.5 and 56. P(A) = 0.6, P(B/A) = 0.5
P(B) = 0.4, P
P(B) = 0.4, where P is the probability,
CETTfecTT) t, Tft P(A/B) ^ RH ^ "51^
'what is the value of P(A/B) using Bayes'
^ #TT ?
theorem ?
(A) 0.75 (B) 0.30
(A) 0.75 (B) 0.30
(C) 0.60 ■(D) 0.50 (C) 0.60 (D) 0.50
57. In how many ways can you distribute 57. "^Tf^ "^f ^ ^
7 different-different books to 4 different- ^ ^ a^TT 7 31^-awT
different shelves such that each shelf has
at least one book ? ^ t ?
(A) 5040 (B) 2400 (A) 5040 (By 2400
(C) 3024 (D) None of these ■ (C) 3024 (D)
58. For a given relation R, the relation is 58. R ^ Wfe,
symmetric, antisymmetric and transitive. yPcH^HpHd sSk t I PHHPdP^d
Which among the following statements is R
true for the relation R ?
■ t? -
(A) The relation R is an empty relation.
(A) R 13^ t I
(B) The relation R is a reflexive
■ (B) R t I
relation.
(C) R mR^iiP^o ^
(C) The relation R cannot be defined.
t I
(D) The relation R is a complete
relation. (D) R 133^ l?f t I
N-(5)S/3/2025/A P.T;0.
Text of page 6
59. A farmer has 20 hectares of land for
growing paddy crop and maize crop. The Rim, 20
farmer has to decide how much of each
^t I ^^ %
f^icRT dMHl "I" I ^TFT
to grow. The cost per hectare for paddy
^ "SlfcT 30 3fk
crop is Rs. 30 and for maize it is Rs. 20. HCWII 20 ^ I ^
The farmer has budgeted Rs. 480. 480 ^ t" I
Paddy crop requires 1 man-day per hectare m ^ ^ TrffT I
and maize crop requires 2 man-days per
hectare. Tliere are 36 man-days available. ■9^ 2 ^
The profit on paddy crop is Rs. 100 per t I 36iTm-f^ t I
hectare and on maize crop it is Rs. 120 TO ^ "STOiT 100 ^ 3#
per hectare. ^ 120
t I
Find the number of hectares of each crop
3TM ^
the farmer should sow to maximize
^ Rny. ^h'ohi
profits :
W :
(A) 4 hectares with paddy crop and (A) 4 TO ^
16 hectares with maize crop. 16 "4* ^
(B) 6 hectares with paddy crop and (B) 6 TO ^ 3^
15 hectares with maize crop. 15 ^
(C) 2 hectares with paddy crop and (C) 2 TO ^ ^
18 hectares with maize crop. 18 ^ "^T)^
(D) 6 hectares with paddy crop and (D) 6 TO ^
14 hectares with maize crop. 14 ^
60. Which ofthe following points lies within
60. ^ ^ rHMfdR^d ^
the feasible region for the following
constraints ? <1^1 "Rto "i" ?
Xj-1-2x2 ^10 X] -1-2x2
3x|+X2 ^15 3xi -i-X2 ^15
Xi,X2>0. Xi,X2>0.
(A) (1, 2) • (B) (5, 5) . (A) (1, 2) (B) (5, 5)
(C) (3, 4) ■ (D) (6, 1) (C) (3, 4) (D) (6, 1)
N-(5)S/3/2025/A
Text of page 7
61. Which elements(s) is (are) needed to
correctly determine the behaviour of a
sequential circuit ?
(A) State of flip-flop (A) ^
(B) Input only (B)
(C) Output only (C) ^[66^6
(D) All of the above (D)
62. Boolean Algebra is also called as : 62. T3:^r%T ^ t I
(A) Arithmetic algebra (A) Wrfhld -q^i^T
(B) Switching algebra (B) PwRm q.<rl^9ll
(C) Linear switching number system (C) feSR
(D) None of the above , (D) "3^1^ ^^
63. Which of the following is not correct 63. PHMprlPtsid ^ RISC ^
about RISC processor ? ^ ^t ?
(A) Relatively few instructions (A) ^
(B) Memory access is limited to load (B) ^ alk ^ ^
and store instructions
(C) All instructions are within the (C) CPU ^ iPdwPl*
registers of the CPU
(D) Multiple-cycle instruction execution (D) Phw^M
N-(5)S/3/2025/A P.T.O,
Text of page 8
64. A control unit whose binary control 64. "ipie
variables are stored in memory is called : ^^ t, 11
(A) Microprogrammed Control Memory (A)
(B) Microprogrammed Control Unit (B)
(C) Multiprogram Control Unit (C) HeelylyiH cti'cjlcn
(D) All of the above (D)
65. A (An) -....is a program that accepts 65. -silnw t, ^
a symbolic language program and
produces its binary machine language "i" "yiSFry
equivalent. ch<ai ^ I
(A) Compiler (A)
(B) Interpreter (B)
(C) Assembler (C)
(D) None of the above (D) ^ ^ -^T^'
66. Which one of the following is correct
according to Boolean Algebra absorption
PHHrdRsld A' i( 4j1h^I ^
law ?
t ?
(A) {x+y)= xy
(A) {x + y)= xy
(B) x + xy = x (B) x+xy = x
(C) xy + y^x (C) :9;+y =:c
(D) None of the above (D) ^
N-(5)S/3/2025/A I
Text of page 9
67. Which one is the correct representation 67. 13:^-3 13:^-3 Tt ^
.of decimal number 0 in excess-3 and WTT 0 ^
excess-3 gray code ? t ?
(A) 0000,0000 (B) 0000,0011 (A) 0000, 0000 (B) 0000, 0011
(C) 0011,0000 (D) 0011,0010 (C) 0011,0000 (D) 0011,0010
68. Let X = (2, 5, 9, 10) and Y = (11, 3, 68. X = (2, 5,
6,14)be two vectors on a vector processor. 9, 10) Y ^ (11, 3, 6, 14) ^ WT
What is output vector on execution of Y > X_ PHtMlRcl
compare instructions Y > X ? "'R 'cW( $l'll ?
(A) (0, 0, 0, 0) (B) (1, 0, 0, 1) (A) (0,0,0, 0)" (B) (1,0,0,1)
I' ' -
(0(1, 1, 1,0) (D) (0, 1, 1,0) (C) (1,-1, 1,0) (b) (0, 1, 1,0)
69. A microprocessor has a data bus with 69. 24 «iei
24 lines and an address bus with 32 32 ^^ '
lines. The maximum number of bits that
can be stored in the memory is : fer ^ t ?
(A) 24 X 232 (B) 32 x 22" (A) 24 X 232 (3) 32 x 224
(O 32 X 212 (D) 24 X 224 (C) 32 X 212. (D) 24 x 224
70. A process refers to pages in the order : 70. ^
1, 3, 0, 3, 5, 6, 3. If page replacement t : 1, 3, 0, 3, 5, 6, 3 I
algorithm is FIFO, how many page faults FIFO ^ RfrRsiFH "qq
with an empty internal store of 3 frames witn t, ^ 3 3^ ^
are there ? ^ "RTsq 7.
(A) 8 ■ (B) 5 - (A) 8 . (B) 5
(C) 6 (D) 7 (C) 6 . (D) 7
N-(5)S/3/2025/A P.T.O.
Text of page 10
71. for / = 1 to « 71. for i = \ Xo n
forj= \ Xo {n ~ T) + 1 for y = 1 to (m - /) + 1
The loop will run for. times. for
«(« +l) n{n+\)
(A) rP- (B) (A) li^ (B)
2 2
n(n-\) n(n +l) n{n-l) «(« +!)
(C) -V (D) +1 (C) (D) +1
72. for i = 1 to « 72. for / = 1 to «
for 7 = 1 to i for y = 1 to /
This defines :
(A) Upper triangular matrix (A) 3m
(B) Lower triangular of diagonal matrix (B)
(C) Lower triangular matrix (C)
(D) Right lower triangular matrix (D) Tifs
73. Gradient of a straight line is : 73. TT^ wr^^ t:
(A) Constant (B) Variable (A) 3Tm (B) m
(C) Exponential (D) log n (C) (D) log«
74. Iteration is in nature. 74. t
(A) Harmonic (A) witto
(B) Oscillatory (B)
(C)
(C) Periodic
(D) None of the above (D) "5^5^ ^^
N-(5)S/3/2025/A 8
Text of page 11
75. Structural relationship between data
items is called : 'cheQllCll ^ I
(A) Storage structure " (A)
(B) Data structure" (B) "Sra
(C) Data frame (C) ^ 3^
(D) Data frmction (D)^
76. A method is an action which is 76.
able to perform. f I
(A) A function (A)
(B) An object (B) sffste
(C) A procedure (C) 3ftferc
(D) A structure (D)
"li. Consistent rate of change between 'key 77. "aRnr ^ 3% ^ 3^* "qR*
frames' from beginning to end is the ^ Mr 3tMit
process of : I
(A) Bezier curve (A)
(B) B-Spline curve (B) B-'Wvil^d ^
I
(C) Linear curve (C) eftPRR ^
(D) Convex hull (D)
N-(5)S/3/2025/A P.T.O,
Text of page 12
78. Compile time refers to : 78. ^ t i
(A) Dynamic allocation (A)
(B) Static allocation (B)
(C) Sequential allocation (C)
(D) Random allocation (D) Wt
79. Generic array operates on : 79. ■ 3ft' ^ t I
(A) Many data types (A) ^
(B) Similar data types (B)
(C) Binaiy number data types (C) ^
(D) Images (D)
80. Data files are : 80. ^ t:
(A) Record base (A) R=t)T-^
(B) Database (B)
(C) Byte base ' (C)
(D) Word base ■ (D) ^
N-(5)S/3/2025/A 10
Text of page 13
81. Which of the following is not a 81. ^
component of storage manager in the
databases ? . t ? •
(A) Buffer manager (A) Wt
(B) Relation manager (B)
. (C) Transaction manager (C)
(D) Authorization and Integrity manager (D)
82. The 'as' clause when used with either 82. ,'as' ^ TPftn ^select' 'from'
'select' or 'ffom' clause is used for : ^ "sirar t ?
(A) Renaming the attribute (A) 135Hz ^ -TO
(B) Assigning a value to the attribute ■(B) 135H? ^ ^ ^
(C) Renaming a relation (C) Mm ^ ^ ^
(D) None of the above (D) ^ ^
83. Which of the following is not an 83. SQL
aggregate function in SQL ? W\ "=1^ t ?
(A) Aggregate (B) Count (A) Aggregate (B) Count
(C) Max (T)) avg (C) Max (D) avg
84. What does the process of decorrelation 84. Decorrelation"^ "SlfelT query ^
do while processing a query ?
(A) Negates the correlation between two (A) ^ relations correlation ^
relations. t I
(B) Negates the correlation between two (B) attributes correlation
attributes.
t I
(C) Nested query ^ join
(C) Replaces a nested query by a query
query ^ ^ 1
with a join.
(D) Nested query
(D)" Replaces a nested query with a SELECT FROM query
simple SELECT FROM query.
. t 1
N-(5)S/3/2025/A 11 P.T.O,
V-
Text of page 14
85. Which of the following is not true for 85. Hybrid hash join ^
i
hybrid, hash join ? ^^ "=1^ t ?
(A) It helps in query optimization. (A) query optimization
t I
(B) It is useful when all of the build
(B) cR ^ t "SR
relations cannot fit in memory. build relations 3TT
(C) Needs a minimum of one block of t I
memory as a buffer for each (C) ^ Anld' ^
buffer ^
partition created.
(D) Needs a maximum of one block of
(D) ^ ^
memory as a buffer for each ' (buffer) .37fe?R
partition created. ^ 11
86. Which of the following is not true for a 86, Distributed lock manager
distributed lock manager ? ^ TO t ?
(A) Its aim is to strike a compromise (A) single lock manager
between the advantages and Wr ^ ^ RR RTRSTRT %=1T
disadvantages of a single lock "^IcTT t" I
manager approach. (B) R^' RTO handle
(B) It has a reasonably high overhead R^ fR^' overhead
* with reference to handling the t I
number of messages. (C) Lock 133 unlock ^ 3jf
(C) The lock and unlock requests are RT?^ (sites) RT f I
made at multiple sites. (D) deadlock RRTRRT 133"
(D) It may lead to global deadlock as %, SFT: ^R^ TOR
the deadlock handling is more global deadlock Rit RRTTO RR
complex. tI
N-(5)S/3/2025/A 12
Text of page 15
87. Codd's 7th rule states that capability of 87. Codd ^ 7^ t ^
(base or derived
handling a base relation or a derived
relations) ^ operand ^ cIT?
relation as a single operand applies not
^ ^ data ^
only to the retrieval of the data but also
retrieval
to the. .and.
^ ^ I
Pick the correct choice.
(A) Creation, insertion, update
(A) HfiTT^PT, miz
(B) Insertion, update, deletion (B) miz,
(C) Insertion, modification, update ■ (G),
(D) Insertion, update, creation ■ (D)
88. What is the full form of DTD ? 88. DTD ^ ^^ ^ ^
^ »
(A) Data Type Document ; (A) zifq
(B) Document Type Data (B) ^
(C) Document to Document (C) ^
(D) Document Type Definition (D) ^ iWRH
N-(5)S/3/2025/A 13 P.T.O.
Text of page 16
89. Which of the following is not true for a 89. Server System Architecture ^
Server System Architecture ? ^^ t ?
(A) Transaction server systems are (A) Transaction server query
different from query server system. server system ^ f* I
(B) It has transaction server system and (B) transaction server system TT8TT
data server system separately. data server system ^^ I
(C) Query server system provides an
(C) Query server system ^
client ^
interface for a client to send
requests for carrying out an action.
^I
(D) The role of data server system is to
(D) Data server system client
allow the client to interact With
^ pages files 5=tii§qT
servers by making requests to read
■ or update data in units such as file
or pages.
90. Column-oriented storage is better than 90. "OT ^
the row-oriented storage in data ^u^KU| f,
warehouse, because :
(A) All the attributes of a relation may (A) ^ ^
not be needed to be fetched into the
memory.
t 1
(B) Storing values of same type
together increases the effectiveness
of compression. f I
(C) Both (A) and (B) (C) (A) ^ (B)
(D) None of the above (D) 3M^Jcki ^^
N-(5)S/3/2025/A 14
Text of page 17
91, The address of an instruction or data byte 91,
^^^^ W
as used in a process is known as :
(A) Logical address
(A)
(B) Physical address (B) pLbtod
(C) Virtual'address (C)
(D) Process address (D)
92, What is the main • role of Memory
Management Unit(MMU) in operating (MMU) ^ ^ i ■?
system ?
(A) ^
(A) Page replacement
(B)
(B) Memory protection
(C)
(C) Perform swapping
(D) Address translation (D) 13^
93, Which of the following is the correct 93. srfq^ -^f pHHPdRtid ^
definition of Thrashing in operating ^^ t ?
system ? (A) Pn-tiA 3#ITOT
(A) A situation under which a process ^ "^f fqaml
is spending most of the time tl '
swapping in and out pages. ■ (B) %Tt ^
(B) A situation that arises due to a
problem in page allocation algorithm. t- I
(C) A situation under which a process ' (C) 1Mr ^ gq:
takes a lot of time to restart. 31R^ WTcTT "t 1
(D) A situation which arises due to (D) ^ ^
limited main memory and program • imR ^ ^ ^ -mjn
size in large. ■3^ ^ t I
N-(5)S/3/2025/A 15 P.T.O.
Text of page 18
94. fork( )system call in UNIX is used 94. fork() frRSiT W
for ; [^-Hl «TRTT ^ I
(A) Creating a process (A)
(B) Duplicate a process (B) ^
(C) Terminating a process (C) ^ ^
(D) Message passing (D) ^
95. In reference to storage management, 95. ^ Af, ^
which 'RAID' level is considered worst (RAID)^^Tsm
for data protection ? "^TFTT "^TTcTT ^ ?
(A) RAID 5 (B) RAID 1 (A) RAID 5 (B) RAID 1
(C) RAID 0 (D) RAID 2 (C) RAID 0 (D) RAID 2
96. In reference to multithreading models, a 96. ^ "A* ^ 3fk
relationship must exist between user
^^"A ^t 1 PHHRrlRsld
threads and kernel threads. Which one of
the following is not the correct A:' ^ ^ ^t ?
relationship ? (A) hT-sqi
(A) Many-to-Many Model
(B)
(B) One-to-One Model
(C) Tfer
(C) Many-to-One Model
(D) One-to-Many Model (D) ffel
97.. Which of the following disk scheduling 97. PHMRrlRsId A:* ^
algorithms can suffer from starvation ? ^ TlfrTcl ^ i?
(A) LOOK scheduling (A) LOOK
(B) SCAN scheduling (B) SCAN
(C) SSTF scheduling (C) S'STF
(D) FCFS scheduling (D) FCFS
N-(5)S/3/2025/A 16
Text of page 19
98. Which of the following is a hardware- 98.
based solution for process ^ t ?
synchronization ?
(A) ^H14A<
(A) Semaphores
(B) HRte
(B) Monitors
(C)
(C) Atomic operations
(D) Spinlocks (D) PWHdTqi
99. Which Unix command is used for the 99. pHHPdRsld ^ ^FRTT
purpose of 'octal dump a file" ?
(A) oct (B) od (A) oct (B) od
(C) octd (D) octald (C) octd (D) octald
100. Which of the following is the, key 100.
objective of the medium-term scheduler ^ "5^^ iHHP^Rsid ^
in an operating system ? t ?
(A) To select a process from ready (A) ^icTR
queue and give it to the CPU for
execution (CPU) ^ ^
(B) To temporarily remove process from (B) Mfl ^ ^ ^
memory and place them in pH^iddi sfk -3^*
secondary memory WTT
(C) To handle the execution of user and (C) ^ Pdt>MKd
system commands
(D) To allocate CPU time to various (D) ^ (CPU)
processes 3TT^fZcT
N-(5)S/3/2025/A 17 P.T.O
Text of page 20
101 is the first phase of waterfall 101.
model. wr t 1 -
(A) Design (A)
(B) Testing (B)
(C) Requirement analysis (C)
' (D) Implementation (D)
102. Which of the following metrics is 102. ■4" ^
commonly used to measure software
reliability ? "I ?
(A) Line of code (A) oTlfT 37f9i"
(B) Mean time to failure (B) "#7 ^
(C) Cyclomatic complexity (C)
. (D) Response time (D) "SlfR
103. What is a functional requirement • in 103. =bRfrH<^)
Software Engineering ? ^ t ?
(A) Description of user interface design (A) ^ fqq^ui
(B) A measure of software performance
(B) ^ "03^ Rq
(C) A constraint on the design of
system
(C) feeiT ^ TfeV
(D) Description of behaviour that a (D) 1^ffw MRR^Pd^ "0^ OT
system will exhibit under specific ■5rMcT ^
conditions
N-(5)S/3/2025/A 18 'i
Text of page 21
104. Which of the following testings is related 104. ■wIhi hh
to the boundary value analysis ? ^ t ?
(A) White box and Black box testing (A) «iT<w
both
(B) White box testing (B). TftOT
(C) Black box testing (C)
(D) Npne of the above (D) "ft' ^^
105. N is the number of nodes of the control 105. ftFm TiTF N ^ wn t narr
graph and E is the number of edges in Tini ft' E ^ WIT t i
the control graph. What is McCabe's McCabe's -Jifecnai V(G) ^
cyclomatic complexity V(G)? t ?
(A) V(G) = E - N + 2 (A) V(G) = E-N + 2
(B) V(G) = E + N + 2 (B) V(G) = E + N + 2
(C) V(G) = E + N - 2 (C) V(G) = E + N-2
(D) V(G) = E - N - 2 (D) V(G) = E-N-2
106. In basic COCOMO model, the software 106. ftfe COCOMO -RT^ ft*,
projects are categorized in which of the UTO ft' ^ ^ia1
following modes ? t ?
(A) Organic, Semi-detached, Embedded (A)
(B), Initial, Intermediate, Final (B) "R^WT, 3TfdR
(C) Development, Maintenance, Testing (C)
<D) Small, Medium, Large (D)
N-(5)S/3/2025/A 19 - P.T.O,
Text of page 22
107. Which of the following is not a step of 107. THMPdRsId ^ ftqRf
reverse engineering process ? ^ ^t ?
(A) Generation of information (A)
(B) Storage of information (B)
(C) Creation of document (C) d\dt^6
(D) Creation of information (D) aTTF
108. Which of the following is not a primary 108. ISO 9126 OT "RfWw ^
quality characteristic defined by ISO
9126 ? t ?
(A) Functionality (A)
(B) Usability (B)
(C) Scalability (C)
(D) Portability (D)
109. Two modules are coupled if they 109. in #f ^ ^
share some global data items. ^IT|TT I
(A) Control (B) Stamp (A) (B)
(C) Content (D) Common (C) ^ (D) WTRI
N-(5)S/3/2025/A 20
Text of page 23
110. ■ Which of the following is not an element 110. ^ (^)
of user interface ? ^ "t ?
(A) Users (A)
(B) Contents (B) WTTlt
(C) Environment (C) ci|dlcl<U|
(D) Business logic (D) ^
111. Which notation provides a strict upper 111. rHHRrirtsid ^ f{n) ^ ^
bound for /(«) ?
(A) Omega notation (A)
(B) Big O notation (B) ^ '0'
(C) Small O notation (C) '0'
(D) Theta notation (D) 8fer
112. Given an integer array arr [ ]; the iih 112. ^ "^2^ "iyifcti 31^ arr [ ] "^f ■
element can be accessed by writing : 31^^ "511^ tvIM :
(A) *(arr + /) (A) *(arr + /)
(B) * (/■ + arr) (B) * (/ + arr)
(C) arr [/] (C) arr [/]
(D) All of the above (D)
N-(5)S/3/2025/A 21 P.T.O.
Text of page 24
113. Performance measurement is concerned 113. ^
with obtaining the space and time
requirements of a particular program. (m<4)T4<h -^^51^) cite t I ^ Wf
These quantities depend on which of the rHHPdRsId ^ t?
following ?
(i)
(i) Compiler
(ii) tqnr
(ii) Options used
(iii) ^ TR qUnq Tjqr
(iii) Computer on which the program is
f
run
(iv) dMqVl qft qf iiliJlfqil qM
(iv) Programming languages used
Codes : W •
(A) Only (i) (A) =t)c«rl (i)
(B) (i), (ii) and (iii) (B) (i), (ii) (iii)
(C) Only (i) and (iii) (C) (i) (iii)
(D) (i), (iii) and (iv) (D) (i), (iii)^(iv)
114. 0-notation for the ' function
114. WT /(«)= 2"+6«^+3rt ^ te
/(«)= 2"+ 6?)^+3'« is : O-qtter t :
(A) 0{nm) . (B) o(«^) (A) 0(/wk) (B) d(«^)
(C) 0(n2) (D) 0(2") ,(C) o(«') (D) 0(2")
115. In which of the following hash functions, 115. ftefelte t ^ qiFR
do consecutive keys map to consecutive
hash values ? t?
(A) Division method (A) fecjl-jn -£{9:^
(B) Multiplication method (B)
(C) Folding method (C)
(D) Mid-square method (D) "^81^
N-(5)S/3/2025/A 22
Text of page 25
116. B-tree are balanced search trees 116. B-^ ^ ^ ^ ^ t,
specifically designed to be stored on
magnetic disks. Which of the following ^ ^ I FinicnRaa
are true about B-tree ?
^^ B-^t ^ f?
(i) B-tree are" designed to work on (i) B-"^
^ Riy. «I1NI
direct access secondary storage
'm % A
devices.
(ii) B-^ ^ ^ "OTT t f,
(ii) B-tree are similar to red-black trees
^ I/O ^
but they are better at maximizing
"f I
disk I/O operation.
(iii) B-^ ^^ f^
(iii) B-tree differ from red-black trees in
B-"^ ^ "=31^
that B-tree nodes may have many
i\ f I
children. ■
(iv) B-^ ^
(iv) Many database systems Xise B-tree. , ■ <5M^Vl t' I
Codes :
^I
(A) (i), (ii) and (iii) (A) (i), (ii) 3fk (iii)
(B) (ii), (iii) and (iv) (B) (ii), (iii) 3ik (iv)
(C) (i), (ii) and (iv) (C) (i), (ii) 3lk (iv)
(D) (i), (iii) and (iv) (D)'.(i),(iii)3ik(iv)
117. The result of evaluating the expression 117.
4*2+8/2t2-16t4 4*2+8/2t2-16t4
IS :
^ ^(^ ^)
3Tlt27TT :
(A) 6 (B) 3
(A) 6 (B) 3
(C) 12 ■ (D) 8 , (C) 12 (D) 8
N-(5)S/3/2025/A 23 P.T.O,
Text of page 26
8^
118. Which of the following takes an input as 118. RhRhRsIcI ^^ ^
Boolean expression and asks whether the 37FKf (^^T^^) "I
expression has an assignment to the ■"JW t "fe" TO
variables that gives a value of true ? ^ t, ^ 1TFT ^ t ?
(A) The satisfiability problem (A) X
(B) Hamiltonian cycle problem (B)
(C) Travelling salesman problem (C)
(D) None of the above (D) ^ ^
119. Which of the following is not an 119. Pi*-iRiRsia qfftro ^
application of Greedy algorithm ? ^ t ?
(i) Ordering projects by deadlines (i) ^ ^ ^
(ii) Logical link controlling
(ii) vfff^TTOT fef^
(iii) Packet scheduling
(iii)
(iv) Removing noisy data for training
(iv) ^ ^
neural network
^ ^ PHc+iMHl
Codes :
W •
(A) Only (i) (B) (i) and (iv)
(A) ^ (i) (B) (i) 3fk (iv)
(C) Only(ii) (D) Only (iii)
(C) (ii) (D) (iii)
120. Which of the following is a binary tree 120. PinRrlRsid "4* #T 3#^
with heap order, but there is no structure ^ ^ t, ^
constraint on this tree ?
(A) AVL tr^e (B) Splay tree (A) AVL t (B) ^
(C) Skew heap (D) d-heap (C) ^ ^ (D) d-heap
N-(5)S/3/2025/A 24
Text of page 27
121. Which of the following is not the set of 121. ^
regular expression R =(ab + abb)*bbab ? R = (ab + abb)*bbab ^^^ t ?
(A) ababbbbab (B) abbbab (A) ababbbbab (B) abbbab
(C) ababbabbbab (D) abababab (C) ababbabbbab (D) abababab
122. If the CFG G is in CNF,then Ae length 122. CFG G, CNF ^ w^
of derivation of a string w of length n n ^ ^ L(G)
belonging to L(G) is : cit Wft :
(A) « (B) (2« - 1) (A) n (B) (2« - 1)
(C) 2« . (D) 2" (C) 2n (D) 2"
123. The intersection of two regular languages 123.
is: t:
(A) Always regular (A)
(B) Always non-regular (B)
(C) May be regular or may be non- (C) ^3^ 4 i\ "OTdi t smr
regular
(D) None of the-above (D) ^^
124. YACC is a : 124. YACC t :
(A) Lexical Analyzer Generator (A)
(B) Parser Generator (B) "qi^C
(C) Semantic Analyzer (C) "^TTToTTf^
(D) None of the above (D) ^
l\I-(5)S/3/2025/A 25 P.T.O.
Text of page 28
125. Which of the following phases of 125. ^ RHPdRsId "4*
compilation process is an optional phase ?
(A) Lexical analysis phase (A)
(B) Syntax analysis phase (B) ^
.(C) Code optimization phase (C) ^
(D) Code generation phase (D) ^ ^
126. The regular Expression having all strings 126. i{ ^
in which any number of O's is followed
by any number of I's followed by any ^^ 1 1 ^ ^
number of 2's is : ^^ 2 ^ WTT T?^ ?
(A) (0 + 1. + 2)* (B) 0* 1*2' (A) (0 + 1 + 2)* (B) 0* 1* 2*
(C) 0* + 1 + 2 (D) (0 + 1)* 2* (C) 0* + 1 + 2 (D) (0 + 1)* 2*
127. Consider a NDFA shown in figure below. 127. TTFTT "W NDFA %, ^
The automation accepts :
(A) All the words that contain the (A) ab ^ ^ ^
substring ab and end with a. a ^ wm t I
(B) All the words that contain the (B) ba ^ ^ ^ ^
substring ba and end with a. a "ghrt t I
(C) All the words that end with a, but (C) ^ a t
not the null string e. null G I
(D) All words thafend with a, and also (D) ^^ ^ a ^ t
the null string. sk null ^ ^ t I
N-(5)S/3/2025/A 26
Text of page 29
128; A context free grammar is in Chomsky 128. ^ "iTmqI
Normal form if every rule is of the form :
(A) A -> BC, A -> a where a is (A) A -)■ BC, A -> a ^ a t
terminal and A, B, C are variable. afk A, B, C t I
(B) A -> aB, A -> aC where a is (B) A ^ aB, A ^ aC ^ a -2^=^ t
terminal and A,B»C are variables. ak A,B,C^ftte t I
(C) A ab, A -> BC where a, b are (C) A ^ ab, A BC ^ a, b
terminals and A,B,C are variables. t alk A,B,C^ft^ f I
(D) A -> aBC where a is terminal and (D) A -> aBC ^ a t sfk
A,B)C are variable. a,b,c^Mto t I
129. Consider the following Syntax Directed 129. iHHfafetl
Translation Scheme (SDTS), with non (SDTS) ■qt 1^' {S, A}
terminals {S; A} and terminals {a, b}. ^-<ir4Hd f aflr {a, b} t I
S aA {print 1} S -> aA {print 1}
S ^ a {print 2} S -> a {print 2}
A Sb {print 3} A Sb {print 3}
Using the above SDTS, the output SDTS ^ Wk ^ ITT ^
printed by a bottom-up parser, for the aab ^ TTT^ OT 31^32
input aab is : f!r2. ■^TTdl f :
(A) 13 2 (B) 2 2 3 (A)" 1 3 2 (B) 2 2 3
(C) 2 3 I (D) Syntax error (C) 2 3 1 (D) TTU
130. A system program that sets up an 130. i[m
executable program in main memory ^ ^ ferj; Mti ^
ready for execution is : t :
(A) Assembler (B) Linker (A) (B) Rn'^tx
(C) Loader (D) Compiler (C) ^ (D)
N-(5)S/3/2025/A 27 P.T.O.
Text of page 30
to
131. How many components are there in a 131. m ^
data communication system ? f ?
(A) 1 (B) 3 (A) 1 (B) 3
(C) 5 , (D) 7 (C) 5 (D) 7
132. If two systems are connected to the-same 132. it ^f ^
link, there is usually no need for a/an : ^f I
(A) Physical layer (A) im
I
(B) Transport layer (B)
(C) Application layer (C) im
(D) Network layer (D)
133. An IPv6 address consists of. octets. 133. Pv6 ^t 1
(A) 4 (B) 8 ' (A) 4 (B) 8
(C) 16 (D) 32 (C) 16 (D) 32
134. If a host is on two networks it must 134. "ZTf^ ^ C^) ^
have IP address. Ml^H* IP ^4'^
I
(A) 1 (B) 2 (A) 1 (B) 2
(C) 3 (D) 4 ■ (C) 3 (D) 4
135. For given two codewords 10110110 and 135. ii 10110110
10001111, what is the Hamming 10001111
distance ? 7
(A) 1 (B) 2 (A) 1 (B) 2
(C) 3 (D) 4 (C) 3 (D) 4
136. Which of the following is a well known 136. PHHPelP<sJd i[i SMTP ^
port for SMTP (Simple Mail Transfer feq; ^t ?
Protocol) ?
(A) 80 (B) 75
(A) 80 (B) 75 .
(C) 25 (D) 90 (C) 25 (D) 90
N-(5)S/3/2025/A 28
Text of page 31
137. The default mask for class-C IP address 137. IP ^
is : f:
(A) 255.0.0.0 . (A) 255.0.0.0
(B) 255.255.0.0 (B) 255.255.0.0
(C) 255.255.255.0 (C) 255.255.255.0
(D) 0.0.0.0 • (D) 0.0.0.0
138. A network with bandwidth of 15 Mbps 138. 15 Mbps^ ^
can pass only an average of 18000 tw 18000 "5^ ^ "TO
frames per minute with each frame f 3^ sitecFT 5000 ^
carrying an average of 5000 bits. What ^ t I^ ^ W
is the throughput of this network ? t. ?
(A) 1 Mbps (B) 1.5 Mbps (A) 1 Mbps (B) 1.5 Mbps
.(C) 2.0 Mbps (D) 2.5 Mbps ^ (C) 2.0 Mbps (D) 2.5 Mbps
139. What will be the transmission time for 139.^ ^ -2 Gbps f, ^
a 4.5 kilobytes message if the bandwidth 4.5 ^ ^ WT
of the network is 2 Gbps ? bWt ?
(A) 0.020 ms (B) 0.018 ms (A)' 0.020 ms (B) 0.018 ms
(C) 0.136 ms (D) 0.009 ms (C) 0.136 ms (D) 0.009 ms
140. For the frame 1101011011, the 140. 3^ IIOIOIIOII ^
generator G(;c)= + x +1 is used, then G(x)= jc'*+x+i ^
what will be the checksum for this t I "5^ ^ ^
frame ? ?
(A) 1110 (B) 1010 . (A) 1110 (B) 1010
(C) 1001 (D) 0111 (C) 1001 (D) 0111
141. Which of the following is a commonly 141. fHHfdPsid ^
used, agent communication language ? 33^ -ti-qK TNT ^ ?
(A) SQL (B) KQML (A) SQL (B) KQML
(C) HTTP ' (D) COMMUTE (C) HTTP (D) COMMUTE
N-(5)S/3/2025/A 29 P.T.O,
Text of page 32
142. What is fuzzification in the context of 142. feeq ^ ™
fuzzy systems ? t ?
(A) Converting a fuzzy set into a crisp (A) 13^ ^ ^ Psti'trM A'
.set MRciPcld WT
(B) Converting a crisp input into a (B) ^ A
fuzzy value HPwPdd
(C) Simplifying fuzzy rules (C) "qr# ^
(D) Combining multiple fiizzy sets • (D) ^^ AA ^
143. Which genetic operator is primarily 143. "^RWTT A
responsible for maintaining genetic
diversity in the population ? ^ "t" ?
(A) Selection (B) Crossover (A) (B)
(C) Mutation (D) Elitism (C) (D)
144. Which algorithm is commonly used in 144. 41Pi At
reinforcement learning for policy "qr ^ wiW
optimization ? f^RTT ^sjicIT ■§■ ?
(A) K-Means (A) K-RtRT
(B) Q-Leaming' , (B) Q-^
(C) Linear Regression (C) yPdMHH
(D) Principal Component Analysis (D)
N-(5)S/3/2025/A 30
Text of page 33
145. In the context of rational agents, what is 145. ^ '31^ -m'
the 'Performance measure' ? t ?
(A) A standard to measure the speed of (A) ^
an agent's actions
(B) A benchmark for the accuracy of an
(B) ^ ^ ^
agent's -actions
(C) ^ f
(C) A criterion that determines how felt ^ fepn
successful an agent's behaviour is
(D) A function to evaluate the (D) ^ TO? ^
computational complexity of an
agent's actions
146. What is the main advantage of 146. M^l^shPHd ^ mm ^
hierarchical planning ? t?
(A) It requires less computational ■ (A) ^ ^
power
(B) It breaks down problems into
simpler sub-problems
(C) It ensures that all actions are (C) ^ iiPiP^^d 1
independent f
(D) It only works for deterministic (D) PnqdicHcti ^
problems
147. In a PEAS description, what does PEAS 147. PEAS PEAS ^ ^
stand for ? ; t ?
(A) Performance, Environment,, (A) wkr, -q*^, ^
Actuators, Sensors (B) T'jpftkT
(B) Perception, Environment, Actions, (C) Pd^MlPtd
\
Strategy ^
(C) Plan, Execute, Analyze, Solve (D) wkr qf^^, iJe^rfqH -q^^, ^HiqlP^id
(D) Perform, Evaluate, Adjust, Succeed
N-(5)S/3/2025/A 31 P.T.O.
Text of page 34
148. In the context of game playing, what 148. ^ ^ ^ %T3;
does it mean for an algorithm to have a ^^ t ?
*cut ofT procedure ?
(A) m ^^
(A) It stops when a certain depth is
^ ^^ f
reached
(B) ^ ^^ ^
(B) It removes unnecessary nodes from
the search tree
(C) It prioritizes certain moves over (C) ^ ^ ^ wif
others "SnfiTtecTT %TT t
(D) It performs a breadth-first search (D) ^ WT t
149. Which of the following best describes 149. rHHPdRsid ^^ ^
the role of scripts ? f ?
(A) To represent dynamic, stereotyped (A) ^ qPdvRd, STjrf
sequences of events
(B) To establish relationship between (B) ^^^TsnPm
static concepts
(C) To define logical rules for problem (C) ^ "f^ cnf^
solving
(D) To model procedural knowledge (D) yPstiqicHdi WT ^ ^
150. Which of the following is a common 150. Pi*^PnRaa ^
component of the generic structure of a ^ "^rmFT ^ wift
multi-agent system ? t ?
(A) Data repository (A)^
(B) Agent interface (B) 13^
(C) Central control unit (C)
(D) Communication protocol ■ (D) yldldiTd
N-(5}S/3/2025/A 32
Text of page 35
' Ttjv NrRg"
(SPACE FOR ROUGH WORK)
(N)S/03/2025/A
Text of page 36
TV chi4 VT?
(SPACE FOR ROUGH WORK)
(N)S/03/2025/A
Page 1 of 36
Source: Madhya Pradesh Public Service Commission. Question paper published by Madhya Pradesh Public Service Commission.