"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
 (SPACE FOR ROUGH WORK)

S/22/2024/A
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.
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
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.
 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
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.
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
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
75. ^ 75. When we implement the runnabie interface,
f, ^ PHHrrlRsId ^ iFft
. we must define the method :
.(method)^ define f:
(A) start' () (B) run()
(A) start() (B) run()

(C) init() (D) " runnabie (C) initO (D) runnabie

76. C-H-Trfq^ floor 76. The standard C++ math library function

(- 8.8) PHHRriRsld tef : floor (- 8.8) will letum the following values:

(A) - 8.8 (B) - 8.0 (A) - 8.8 (B) - 8.0

(C) 8.0 (D) -9.0 (C) 8.0 P),-9.0

77. PdMPcrlP^d 77. Which of the following interface enables

^ http ■375^^' (request) ^ "SITF ^ servlets to read data from an Http

(read) ^ t ? request ?

(A) Http Request Servlet (A) Http Request Servlet

(B) Http Servlet Request (B) Http Servlet Request

(C) Http Servlet Response (C) • Http Servlet Response

(D) Servlet Http Request (D) Servlet Http Request

78. ^ ^ ™ 78. * What are the basic attributes of a straight

t? line segment ?

(A) wsr (A) Length, Width, Size

(B) 'eM. ^ (B) Length, Width, Color

(C) (C) Type, Wdth, Color

. P) ^5^1^ ^ (D) None of-the above

{8)S/22/2.024/A 8
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.
 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
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
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
 \

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
 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
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.

 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
 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.
101. "^rf^ ^ WsfTiT t, 101. If a process is under statistical control, then

it is :

(A) % (A) Maintainable

(B) -m^ -qW t . (B) Measurable

(C) wrm ^ t (C) Verifiable

(D) ^t (D) Predictable

,102. v:m^ ^ PshWd ^TT^TJIT# ^-■"--OT 102. Crystal methodology of agile is indexed

arpTfrm 1^ ^ t .i by: -

(A) aTOK (B) (A) Size (B) Time

(C) ^TTO (D) ^ (C) Cost (D) Color

103. ^ %!?: 103. Which tool is used for structured

wiW "sfM t ? analysis ?

' (A) (A) UML

(B) (B) DFD

(C)'^fTfro-aft.aiK.aTR. (C) Warrior-Orr diagram

(D) ^ P) HIPO diagram

104. #.aTR.^. ^ arstf t : 104. CRC stands for :

/

(A) l^ff^rf^fM (A) Class Responsibility Collection

(B) RwiPHpoiM' *l(rlNlU< (B) Customer Re^onsibility Collaborator

(C) =b(^.'^H (C) Computer Responsibility Collection

■ (D) (D) Class Responsibility Collaborator

(8)S/22/2024/A 18
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.
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
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.
 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
 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. .
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
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
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
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
 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
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
 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
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
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
 (SPACE FOR ROUGH WORK)

S/22/2024/A
 (SPACE FOR ROUGH WORK)

V
1

/
V

:i
H
f'

}.
n

./
I '
• I
f ]

S/22/2024/A