3/qet uf

Part-1/TT I
GENERAL HINDI (I to 25)/ TIHT f(1 d 25 ma)
(a) KTHZU
b) (a) 3r
(d (c) 3a
(d) r4T
(a) t T
HU (b)ctt - TTH (a) HE (b)
(d) - 3TH (d) T
THT
(c)
(c)
(d)
(b) 17. TP HEI TÍ-fasa -
(c)
(b) a7 + 8
5.
HHTH T faTTA T -
(c) a1+ BR (d) a7c5+aR
(a) HTE
(C) TH (b) 5TH 18.
(a) q44TH b)aHH
(a) (c) HITT (d) aHE
(b) 54R
7. (d)
(b) YUT I T
(a) eET
(d) TvI R
(b) OTT 20. t r a rE TTY -
8. (d) 5TSAT
(a) Tay
(d)
9.
a faHTT
b)
(c) TCTTE
10.1H ZT TYaTi - 22. aT7Rta TR HHII
(a) quT
(a) arHTT HHIH (b)7TRUFHTH
(C) 7RENT d) gait FHT7
(d)
23.
(a) THTT
(b)T
(d) (c) HETIOEI ET
12. (d) 37HTT YT|
(a) rTET
b)RTAT (b)ga
(d) 37u (a) uTY
(d) -
a) eTTRT (b) T
(d) TH a3RTa
(c)4ERIT
TETS21]-D Page 2 of 24
Page 3 of 24
[TETS21]-D
 Part-I1/HTT II 30. Which of the following clause have 30. ffaT
COMPUTER SCIENCE-I (26to 125)/ ER
HIGH-I ( 26 H 125 a <group condition>? <group condition> 8?
(a) Select (a) Select
26. The minimum frame size required for a 26. TGbps YR TIci dlct
CSMA/CD ATTfRT
CSMA/CD
(b) From (b) From
CSMA/CD based computer network running
Group By (c) Group By
at Gbps on a 200 m cablé
l with a link speed RTT, 3FT d l cT 200 m ya f (d) Having (d) Having
of 2x10* m/sec is - ts 2x10 m/sec -

31. Memory resident virus is also called - 31.

(a) 125 bytes (a) 125 I e
taStealth virus (a) e arr
(b250 bytes (b) 250 Te
(c) 500 bytes (b) Multipartite virus (b) HoetYTEIET q r r
(c)500 aIgE (c) Trojan virus
(d) None of the above
(d) Zombie virus
27. What is the output ofthe following program? 27. ARIT UTTH 3ITUEYE TI ? (d) ararH
# include <stdio.h> # include <stdio.h> 32. Which of the following table contains the 32. A se àarETSI Tefas
void f00 (int*P) void f00 (int*P)
S 1

primary information in the data warehouse?

*P = 200:
*P 200; (a) Primary table (a) TRI &aa
b) Dimension table
int main( int main( ()Lookuptable
Tox
int a = 100: (d) Fact table
f00 (&a):
int a = 100;
(d) taa
f00 (&a):
printf (ed", a): 33. Which of the following data structure has the 33.
printf ("%d", a):
return 0; least height?
return (

(a) 100 (a) B-ree of order 4 (a) -3sitsr 4

(a 100
(b)200 B-tree of order 3 (b) - siTsr 3
(b) 200
(ey Compile time error c) B-tree of order 5
(d) Runtime error
(c)- siter5
B-tree of order 6 (d) - stsT 6
28. Operator overloading is -
28. 3REY TrGlTET - 34. Let T(n) be defined by T() = 7 and 34. T Uife7 n2 1 foy T(n) i T() = 7 3T
(a) making new C++ operators
(a) C++ 3ATTREY A T(n+1) =3n + T(n) TRT ufRAT
making C++ operators work with T(n+1) 3n + T(n) for all integers n 21.
(b) C+3TTRER 3TtTE ¥
objects Which of the following represents the order
(C)givingC++ operators more than they (c) of growth of T(n) as a function of 'n'?
T(n) faT ufafriera AT 8?
can handle C++ 3TYREY f à THT 7
(a) 6 (n) (a) 0 (n)
(d) helping in reducing execution time (b e (n logn) (b) (n logn)
of the program
29. Actual code for (c) (n) (c) 0 (n)
generated when - template function is
a
29. uE 5 a RTia 73 d (d) e(2) (d) e(2")
(a) the function
declaration appears in 35. The famous port and IP address scanner is -
35.
the source code.
(h) the function C a i n and Abel (a) 3t yàa
definition appears in the
source code. (b) Angry IP Scanner
a call to the function
appears in the (c) Snort (c)
source code.
(d) the function d) Etter Cap
is executed at runtinme.
HTT
TETS2 11-D Page 5 of 24
Page 4 of 24
[TETS21]-D
 36. What is virtual
inheritance 36. C++ aqi 51ERI PAI
in
C++
(a) C++ (a) C++ 7-7, »
technique to enhance multiple
inheritance. 41 C'onsider the following three claims -
(6) C++ I(h +k" = e (n) where (h+k" e (n) TET k TY m
technique to ensure that and m I =

pnvate member of base class can e are constants.

accessed somehow. 2n II 2 = 0(2")

O(2")
(c) To avoid
muitiple inheritance of
22 = O(2") II 2 = O(2")
classes.
T o avoid multiple Which of these claims are correct?
copies of the base
(a) I and II
(a) 13t II
class in derived class.
S7. (b) I and II (b) 13tRI
Consider the 47 (A, B. C) UW gs 5qTT ETRt a
following set of functional 37.
dependencies on the schema (A. B. C. I andI
A BC. BC, A B , AB »C (d) . I and I1 (d) LIIstIII
ABC. B C . A B. AB C. then the IPV4tT , TH C VSI ITTd
canonical cover for this set is - 42. In the IPV4 addressing format, the number of 42. HTEY
- ET?
networks allowed under class C addresses is-
(a) A BC and B C (a) A BCPT B >C
(a) 24 (a) 24
(6)
BC and A B A (b) A BC FAT A > B
ABC 2 b) 2
ABC and AB C ABC (c)A>BCPT AB C
(d)
(c) 22 (c) 2
A Band BC (d) A B TTB >C (d) 234 (d) 24
38. Which one
of the following array represents F: R R HT
38. F-HT I5TÍ HH 43. Let F: R$ >R be the mapping defined by 43. 55
a
binary max heap? TRrT? 8,
(a)(25. 12. 16. 13, 10. 8. 14 function F(x,y) = (.what will be the
PRT
Fxy) =(
(a)
125, 12, 16, 13, 10, 8, 14]
(b)25, 14. 13. 16. 10, 8. 12)
(b)
{25, 14, 13, 16. 10, 8, 12} 9 16
2 5 . 14, 16. 13, 10, 8. 12) image of + 1 underF?
(c) (25, 14, 16, 13, 10, 8, 12)
d) (25. 14, 12. 13. 10. 8. 16) The circle x+ y= 1 (a) The circle x* + y= I
d) (25, 14, 12, 13, 10, 8, 16} (a)
39. Whichof the following is not a software 39. fdreT (b) Theline+=1
process quality?
aTA y7 HfTEAr U (b)Theline+=1 3

(c) The elipse x+ y = 1

Productivity (a) 7AI
Ue The ellipse x+ y=1
(b) Portability (d) None of the above d)
b) T i faei d s s
(c)Timeliness 44. _7 i
(d) Visibility
44. The number ofleaf nodes in arooted tree of n

(d) raT having 0 or 3

nodes with each node
40. Which of the following
protocol pairs can be 'n
40. H7 Hu 3R TT RÀ
used to send and retrieve emails
(in that
foy a H children is
order)?
a)
(a)2
taIMAP, POP3 (b) n-1)
(a) IMAP, POP3 (b) n-1)
SMTP, POP3 3
n-1)
(c) SMTP, MIME b)SMTP,POP3 (c)
(n-1)
2
(C)

(d) IMAP, SMTP

(c) SMTP, MIME d) (2n+1
(d) IMAP, SMTP
TETS21)-D Page 6 of 24 of 24
Page 7
ITETS21]-D
 In a binary min heap containing 'n' numbers. 50. n' RRIT aT ISTÝ--Éu i, yaH T

45. 45. -7RI } W b i cR R HiTRM 50

the largest can be tound in ....time.
Proy firewall filters is
used at which laver
amongthe lollowng (n) (a) e (n)
Network laye (b) 0 log n) (b) 0 (log n)
b) Session layer (c) 0 (log log n) (c) 0 (log log n)
(c) Presentation layer
d) etTT AAR (d) () (d) e()
d) Application layer
T h e r e are 5 cities in a network. The cost of 51.
46. Which one of the following statement 8 46
false? biuilding a road directly between i &j is the
(a) Any relation with two attributes is BCNF EÈI cntry C (i. ) in the matrix C below. An

BCNF infinite cntry indicates that there is a

(b) A relation in which every key has mountain in the way and so road cannot be

onty one attribute is in 2NF built 3 5 11 91

A (c) 5 yya tàzi¥I, 3NF RGRTA v 9 5'11 91 3 0 39
pnme attnbute can be transilneh 10
C =5 3 0
dependent on a key in a 3NF relation. 0 3 9 0o
(d A pnme attnbute can be trans1tively
C=5 3 10 10 11 9 0 70
(d) ya HT QNTYCTI, BCNF RoINTA 119 co 7 9 10 7
dependent on a key in a BCNE 9 C 101 71 0J
relation The least cost of making all the cities

47. Which the GrT À T - T RYH yfoa reachable from each other is -

(a) 8
pubie kev ervplographic
is 47.
(a) 18 (b) 21
algornthm among the following?
(b) 21 (C) 23
he Diffie-Hellman key agreement 23
(a) fu-oT ayte uietia
protocol (d) None of the above
Hs fbI TT
b) An original intelligible message fed into the
52. YE 5 À yReH
Key generation algonthm 52.

(c) Signalling algorithm algorithm as input Is known as .. ******

while the coded message produced as output

(d) None of the above
48. iscalled the.. TTT
Let P ={x |4< xS 10 and x is even}. then P 48. t P ={x |4 <xs 10 TR x HH TR E),
. ****"

(a) stA, yBT

is equivalent to -
(a) decryption, encryption
(a) 4.5.6.7. 8.9. 10) (a) 4. 5. 6. 7, 8, 9, 10 plain text, cipher text
(b) 16. 8}
b) 6.8) (c) deciphering, enciphering
4 6. 8. 10) (d)cipher, plain text
(d) fH, &E
(c) 16.8. 10)
d) 14.6. 8. 10) noiseless ehannel with a 53. 1000 Eeu sd Y Ts iguidHA
d) 14.6.8, 10) 53. Consider a
bandwidth of 1000 Hz transmitting a signal
49. Which of the following does not reside in 49. fafam a-HI g R levels. The maximum bit rate
activation record block of a function? with two signal
(a) Global variable will be -
(a) àkyaa (a) 2000 bps
a 2000 bps
Local variable with non-static scope
(b) 2000 kbps
(c)Ponters to activation record block of (b) 2000 kbps
(c) 1000 bps
(c) 1000 bps
parent function (d) 1000 kbps
(d) 1000 kbps
(d) Function retun information

Page 9 of 24
ITETS21]-D
TETS2 1]-D Page 8 of 24
 icue (a) »}--1 fdru
used to epnsenl
a s4
54. A ciular linked
list is

to acces
IS Quene 9.
The indicates that the
subseriber 59.
P" is used
queue. A single
variable
identified in the certificate has sole
control
the queue To
which node
should T poini P and access to the private key
and
cnqueue (a) OAEP
such that both the operations
in
constant
TITf fTR cnqueue 3R
dequeue t b) Digital Signature
(a) OAEP

can be performed (b) e a rctar

dequeue
(c) PKI
time (c) PKI
d Public Key Certificate d) -HEre

From TRear yFironm T+Rear}HT 60.

A data model is collection of conceptual
a
60.
(a) Rar
10ols for describing which among the
(a rear node

(bfrontnode following?
T ot possible with single pointer (a) Data and data relationship
node next to front (b)3Tafcra 3tR
(d (b) Data semantics and
55. n i i gi
I YC a T ae consistency
55 What ris the number of comparison required constraints
for finding fourth largest
by an algonthm
eiement in the given input list of 'n
ERT Data, data relationship, data
semantics and Consistency
eiements. constraints
(a) 2n 3
(a n3 (d) None of the above
(b) 2n-4
T2n 4
(c)2n-5 AHe7 F T TETR 9 H aeo
(C)n -S 61. Convert the following number to base 9 61.
(d) 2 (2n-5) (1 101222.201121)3- (1101222.201121)
(2n Si
(d
-

56. A utiirty used to specify who is allowed to 56. a5 YT HAIN 7H J1358.647 . a la 1358.647
coanect to a service over the network
and (b) 4172.647 (b) 4172.647

who not is called 4178.1 (c) 4178.153

c)
-

is 24

(2) TCP shell (a) t . sta (d) 1358.153 (d) 1358.153

TCP wrappers (b) aieihi. èuri 62.

HTreTà JVM f-
62. Which of the following is not a part of the
(C)P wrappers built in security of the JVM?
I P shell (a) Class loaders (a)TH TSH
57. The inorder and preorder traversals of a 57. T 1 S Y s T uiSTST arta (b) Servlets (b) H
binary tree are dbeafcg and abdecíg (c) Byte code verifier
74RT dbeafcg 3N abdecfg | aTST g
respectively. The post order traversal of the (d) RT vaers
binary tree is
Security manager
TTYCYE TTI
-

What is the output of following C program? 63. eirrei C TTH

(a) edbgfca (a) edbgfca 63.
include < stdio.h>
#include < stdio.h>
) debfgca (b) debfgca
void main() voidmain)
c) debgfca
(c) debgfca
(d) defbgca (d) defbgca int a[3][2] = {{1,2}, {2,1}, (2,2}}
int a[3][2] ={{1.2}.{(2,1}. (2,2}}:
S8. RMl stands for - de bt print ("%d", all][0]);
58. TR.yH.JTS. (RMI) &- print ("%d", al l][0):
(a) Revised Module Invocation
(a) fRangys H (a)
hRemote Method Invocation (a) 2
(b) 2
(c) Retail Method Invocation
(c)
(d) None of the above (c) 0
(d) TI T (d) None of the above

TETS21-D Page 10 of 24
Page 11of 24
TETS21)-D 2,2, 2.3
64. If relation R has X tuples and relation d has
say eyt, d join 3-T RaH RU As per 40-20-40 rule, the least 40-20-40 AUH 7
tuples, then the result tion R 70. amount of 70. THIR
of join on development etlort shall be spent on-
and S will have
upto . . .

Iuples. Estimation and Planning

(b) Software Design
(a) (a) x/y
(c) Software Coding (c) iveqUR a`T
(b)*Y d) Software Testing
(e) +y (c)+Y 71. n diverges for 71. fy f a
1
-

(d) (d)-y
(a) 0<ps (a) 0<pSI
65. Code red is a 65. 3 E
(a) Anti vinus (a) e i qRNH (b) p> (b) p>
(b)Photo editing software pe(2.3,5,7,..) (c) pe (2, 3, 5,7, . )
Computer worm (d) PE{2,4,6, 8, . (d) Pe l2,4, 6, 8, ..
(d) Video editing software
72. A binary tree T has 64 leaf nodes. The 72.
66. Which of the following tem is used to 66. CEd H T5 T UT number of nodes of degree 2 in T is-
describe a threat origin and the path it takes
to reach a (a) 64
target? fy f TCT (a) 64
(a) Fraud (a) is log264 (b) loga64
(b) Espionage (c) 63
(b)gR (c) 63
(c) Malfunction (c) HTa5rTA (d) 32 d) 32
T Threat vectors
73. Thefollowing post fix expression with single 73. iTa r e iuks zT2 AAari UTE
67. A data bus 16 bits wide is accessed 67.
. . imes to read an instruction of
128 fat EI T Y16 faa a digit operands is evaluatedusing stack
823 /24 *+51* *
FTTT 7V fT
128 bits. A
823/24 +51 -

1
Note that is the exponentiation operator.
(a)
(a) 2 The top two elements of the stackk after the

(c) 8 (b) 4 firstisevaluated, are

(c)8 ua 8,1
d) 7 (a) 8,1
(d) 7 (b) 5,7
68. A functional b) 5,7
dependency X ^Y is trivial, 68. T HTT s4sHI X>Y fetaua 8, (c) 3,2
(C) 3,2
if- qf- (d) 1,5 d) 1,5
a) XcY (a) XeY
74.
T
Which of the following register ís employed 74. fefea N - I zfrkeR àHd i ga
XY (b) XY to hold temporarily
(c) XY the right-handinstruction
(d) None of the above (c)X#Y from a wordinmemory?
e Instruction Register (IR) (a) Instruction Register (IR)
69. Which is the (b) MAR
root class of all AWT events (b) MAR
in 69. JAVA Tt
JAVA? 3qà (AWT) (e) AC and MQ (e)AC and MO
fa Java.awt.ActionEvent (d) IBR (d) IBR
(a) Java.awt.ActionEvent 75. 75. a7 GA A
(b) Java.awt.AWTEvent
IPSec is designed to provide the security at
PSec I fGy su
(b) Java.awt.AWTEvent the
(c)Java.awt.event.AWTEvent (c) Java.awt.event.AWTEvent
a Transport layer
(d) Java.awt.event.AWTEvent.Event (b) Network layer
(d) Java.awt.event.AWTEvent.Event (c) Application layer
d) Session layer
TETS21]-D Page 12 of 24
TETS21]-D Page 13 of 24
 TETNA uuit aq
of the following is the correct 82.
76. Module based programming language is 76. HEqA ****m***
82. Which
recurrence relation related to the complexity
(a) C
(a) C of binary search?
(b) C++
(b) C++
T ( n ) = T(G)+O(n)
(a) T(n) =
T(C)+0(n)
ml
m (c)
(b)
b T(n) =T)+1
d Ada
(d) Ada T(n) =
T()+1 (c) T(n)
2T()+O(n) =

7. The 77. TTHOTT H I 0,4375

I TGITEIRI (TS-T ( Tn) = 27()+On)
Cquivalent of the decimal number d)
Tn = 2T()+1
04375 is- (d)Tn 2T()+1
00111Y (a) 0.0111
83. .********
is not a type of antivirus program. 83.
(b) 0.1011 (b) 0.101
O S

(a) Quick heal

(c) 0.1100 (c) 0.1100 (a) fr d
(b) McAfee
d 0.1010 (d) 0.1010 (b) t y
78. HIPAA is related to - 78. HIPAA HaTda i -

(c) Kaspersky
(a) Finance (a) fa O2 (d) HTTEifTE Affd
Microsoft office
(b) Health (b)AT
84. SCM stands for- 84. YA. (SCM) H
Education (c) RIeHT
(a) Software Control Management
d Stock market
tb Software Configuration Management YAerA
Which one Afciea d (c) HTTEaTR 3FTERT
of the
following micro operation -
79. ALU 1-HI3D (c) Software Concept Management
in ALU causes overflow sometimes? (micro-operation) a71-51 (d) None of the above
HTTYTE (overflow) z5T RUI ITI E? HPI fT a3RÍ I
Logical shiftieft trees are possible 85. 8 H
85. How many different binary
b Arithmetic shift left with 8 nodes?
(a) 256
(C) Circular shift right
xL+t 256
(c) fXYTE KI^T b) 128
(b) 128
d) None of the above (c) 248 c) 248
80. Suppose in a TCP connection at any given 80. (d) 64
(u64
H A H 3R 3AYI3
time the receiver advertised window size is is the way to 86.
HH RHaR YSTEIEU fAst 1 TBR 20 kB 86. Which ofthe following
correct

20 kB and congestion window size is 10 kB.

3ITY u T fSt 7 TBTR 10 kB I T initialize an array?
{2, 4. 12. 5, 45. 5
What should be the size of sender window to 45, 5} (a) int num [6) =

i n t num [6] {2,4, 12. 5, =

5}
achieve flow control?
(b) int num { } ={2, 4, 12,5, 45. 5}
(b) int num { =
{2,4, 12.5. 45.
asg? (c)int num {6} = {2, 4, 12)
(a) 30 kB
(a) 30 kB (c) int num (6) {2,4, 12} =

5. 45, 5}
(b) 20 kB (d) int num (6) =
{2. 4, 12,
(b) 20 kB (d) intnum (6) {2,4, 12,5, 45, 5)
=

R TIAU
(c) 10 kB
(c) 10 kB 87. A hash table contains 10 buckets and uses 87. E TaT 10 ae
d Could be 10 kB or 20 kB or both
(d) 10 kB 20 kB qi B T I linear probing to resolve collisions. The key E I dTH (key values) UT
used
81. Suppose there Si and S2. Si is
are two servers 81. GTY ai TR Si TR S2 I values are integers and the hash function 34TT TR
UDP
S1, UDP values 43, 165,62. 123, 142
TR T5RT key%10
server and S2 is TCP server. Both is key%10. If the 43, 165, 62, 123. 142 T a7
in what location
ae dr
servers are
simultaneously maintaining 100 100-100 TATSE (Client) HTP session T are inserted in the table, 3I Ti, a dZ (key value) 142f
inserted?
sessions. each with different clients. The would the key value 142 be
V I S1 TR S2 GT A sockets HRI
number of sockets at both S1 and S2 are - (Assume the size of table 8) 8 HT GY-
-

(a) 100. 100 (a) 2 (a) 2

(a) 100, 100 (b) 3
(b) 100. O2 3
(c) 1, 100 (b) 100,1 4 (c) 4
(c)
(c) 1, 100 (d) 6
td1. 101 (d) 1, 101
(d) 6

ITETS21]-D Page 15 of 24
TETS21]-D Page 14 of 24
 yIcei rie 1IP) B1 feu
88. Weak
cntity set to bemeanineful, it must 88. a
he the part of a - ider the DAG (Directed Acyclic 94. erfRara DAG (Directed Acyclie Graph)
94 Graph
(a) One
with V = {A. B. C. D, E, F} shown below
1 V= [A. B.C. D. E. F} HI faTR 6frg
to one relationship
One to many relationship
Many to many relationship
(d None of the above
89. 89. THE VYHder JEIEV Ë-
ompliment Accumulator' is an exampleof C
(a) Register of the
Addresing
Mode Which following is not a
topological
(b Implied Mode (b)HOIIEE HS order among the given options? order 18 8?
(cImmediateMode (a) ABCDEF (a) ABCDEF

TtHRelative Mode (d) frafea HE (b) ACBDEF (b) ACBDEF

90. What the worst (c) ACBDFE c) ACBDFE

is
time complexity of 90.
case i R Hd yTRYH 7 3477 DYT ZV
search operation on unordered and ordered CBDAFE d) CBDAFE
list using linear search algorithm fb
How many bytes are required for encoding
95200 bits?
95
200 fe r
respectively? (worst case time complexity) T E?
te O (n) and O ()
(a) O (n) TT O () 5 Bytes (a) 55
(b) O (n) and O (logn) (b) 3 Bytes
(b) O (n) FRT O (logn) (b) 3T5
(c) O (n and O (n) (c) 4 Bytes
(c) 4 T5T7
(c) O (n) aT O (n)
d) O logn) and O (logn) d) 2 Bytes
(d) 2 4T5TH
(d) O (logn) TeT O (logn)
91. Which aborted afe oi FiRTA UH yfaea Fez qI
of the following polynomial is used by 91. ARem À M-HI uferAifAYT HDLC 96. If a transaction 1s
during its active 96.
state, will go in a
-

HDLC for CRC generation? EIRT CRC TTRIA N yu fu T

(a) Failed state (a) RE
(a) +x+1+I
(b) Terminated state
(b) +*+1 (a) x+x+x+ 1
(c) Committed state
(c) +x+x*+1 (b)xl+x2+x+1
(d)x+x* +x* +1 (c) xl+x2 +x+ 1 dPartially committedstate
92. The term
(d)x+x +x+| 97. The term in which a person is continuously
cycle stealing is used in which 92. HIT FHT T yuT AHGTRYT H chased by another person or graph of several
context among the following? is known
people, as
(a) Clock Cycle Over Riding
(a) Phishing (a) fsT
b) DMA Based Data Transfer
(b) Bulling (b) goT
Polling Mode Data Transfer eStalking (c)ife
d) Interrupt Based Data Transfer
(d) Identity theft
93. The default
parameter passing method used 93.
in C++ is -
C++ ÀJTaT T feyiot qKTHTEY 98. Which of these anomalies is also known as 98. H r a I H TH 3/T4CI a ww (Write
Call by Reíerence Write) aiftare rEl TAI ?
(a) 7E ww (Write-Write) conflict?
ERT
(b) Call by Value (Call by (a) Dirty Read
(a)sis
(c) Call by Name
Reference)
(b) TiT
(d) None of the above (c)
(Call by Value) (b) Unrepeatable Read
YHTR (Call by Name) (c) 3747
cLost Update
(d) TgT USE
(d) Write Update
TETS21)-D Page 16 of 24

[TETS21]-D Page 17 of 24
 Which Iype of routing protocol HTH BTET
104 Ues the 104. f yBTR I IUEI uEml
99 Consider the following message
99. 1ub
(divisor
polynomial shortest path lirst algorithm?
Fa Distance vector
(h) Link state
(a) foteI ÀER
M = 10100I 101
Afefad (message) «hl ITSfa (c) Hybrid
(b) f E
The Cyeli Redundaney Check (CRC) T (c) ETsfas
me age using the diviso polvnoml (d) Sliding window
M 1010001101
+ + Iis 05. Which of the
following supports the
(a) 01110
(a) 0110 concept 105.
of hierarchical classification?
(b) 01011
b) 01011
(a) Polymorphism (a)ag5T
(c) 10101 (e) 1010
(b) Encapsulation (b) tBYUT
(d) 1010
d 10110 Abstraction
5 feYN G (c) (c) HfAI
tear down phase, switched 100. HHe Raa fby IN c
U of a cireuit Inheritance
(d)Tg5
nctwork. a signal is sent to relcase ne
What does f (250, 2) return? 106. f(250. 2) TAT afïtH arT 8?
rsources- 106.
(a to cach router
(m, n) f (m. n){
ans = ans = l;
b to cach switch count = 0 count = 0:
(c to each computer while (ans<= m) | while (ans< = m) |

dtoeach server Count=count+ 1; count = count + 1;

101. Which one of the following is not NP-Hard 101. Amfaraa NT VI-IT YTRT T ans=ans n; ans = ans * n;

problem? ? return (count) return (count)

(a) Assignment problem (a) 3FHIHE HRI
(a) 6 (a) 6
(b) Travelling salesman problem 8
(b) b)8
(c) Non linear
programming (c)I
(c) far utufaT d)7
d) None of the above
Hamiltonian cycle problem
107. The number of RAM chips of size (256k x) 107. 2 Mbyte HHRI qTÀ fy (256k x 1) HIET
ET?
102.
If A =
{1.{2}.3) .
the power set of 'A' does 102. af A =
{1,{2},3} . A Y7aR HT À M are required to construct a2 Mbytememory? fbat RAM faI 3AT47Y25TT

not contain ka8 (a)8

(a) (b) 10 2> (b)10
(a) (c) 64
612 (c) 64
(b) 21 (d) 32
c) 1.3 (d) 32
() 1,3) Cloud 108. A T- TTTT 7ruT HfAT
(d) 3 108. Which of the following is not a
d) 13 Computing Service? i?
103. Suppose fn) is nlogn. Consider the 103. af f(n), n-lognI A HfdH (laaS)
EETH (a) Infrastructure as a Service (laaS) (a) T77R T
following statements (b) Platform as a Service (PaaS)
(A) fn) is O(nvn)
(A) f(n) is O(nvn) (B) (c) Software as a Service (SaaS)
(B) fn) is 0(nvn)
fn) is O(nVn) (d) aTT YT HfdH (TaaS)
(C) fin) is O(n*) Typing as a Service (TaaS)
(C) fn) is 0(n) restriction 109. f i Y a Å TEraE eftT T
109. Which one of the following is the
Which of the following is true? of indirect addressing?
(a) Page - size 2
(a) A. B & Care all not true. (a) Page - size 2
(a) A, B 3iR CF TEI I
(b) B& C are true but A is not true. (b) Page - size 2
(b) Page - size 2k
(b) B 3N CHEI UR A HE T$ 8I c) Page - size 2 2
B is true but A &C are not true. e Page - size 2 2*
(d) Page - size 2 2-
(d) A&B are true and C is not true. (d) Page - size 2 2*
(d) A3t B T UR C HE T
ITETS21]-D Page 19 of 24
Page 18 of 24 [TETS21]-DD
 fRecach.
uTPR } fR (cache hit)
7 175 taN
ead
110.
fRadze (read request) 5 d TCL commands are
115. TCL
110. sume that for a ertam praessor.
a
H7R e 5 I PACacha
115 (a) SELECT and INSERT
t I E , 3R
nanoseronds on a cache niiss
(nanoseconds) (a) SELECT Ya INSERT
Teyucst tahes
UR 50 7 *HT | HI7 iG f (b) GRANT and REVOKF
ianosevnds on a cache hit. SuppONt miss) B (b) GRANT YT REVOKE
and
that
(c) UPDATE and TRUNCATE
ohserveU (c) UPDATE a TRUNCATE
wiie runung a program. t was

esus
d COMMIT and ROILLBACK
M t the praessor s read request (d) COMMIT YT ROLLBACK
time From the
the following, wha is the average case 116.
lolowing. what f a_a h r T f
cache ht The average read access time) B- 116.
From
average read access complexity for finding the
n a n o s e o n d s is -

10
imc
height of the Tar ETEH Ttfkiel (average case
(a) binary tree?
(a 10 time complexity) Fi 8?
(b)14 (a) h=0 (log log n)
1 (a) h=0(log log n)
h = 0 (n log n)
(c) (b) h 0(n log n)
(d) 12
(c) h=0 (n) (c) h=0(n)
d 12
AHAT À (d) h=0(log n) d) h 0(log n)
the 111. a P ys TET E, a
then which of value ot Floor(8.4) + Ceil (9.9) is 117. Floor (8.4) + Ceil (9.9) HT-
117. The
1a statement.
.
P
-

ETETiul 8?
folkowing IS a tautolog 8 (a) 18
(a) Pa F 19
a PAF (b) (b) 19
(b) PvF (C) 20 (c) 20
PvF d) 17
(c) Pv7P (d) 17
ic PP
7an= 0 hH
T PAT
(d) PaT
118. The recurrence relation a+- 7an =
0 with 118. Ro RGR an
HTYETUY HRYIT 7 EA DV ao= 7. n20 HHg ETTI=
compler software problems. the 112. e ao 7, n 20 is equivalentto -

112. For solving

(a) an T n 20 (a) anT n20
best project team is
(b) an =
7 n20 (D)an=7 n20
(a) YOTR
(a) Closed paradigm an = 7- n21 (c)a 7-n2
b Open paradigm (b)g DIN (d) an =7"* n21 da 7 n21
de D HT Rerfi r I
c)Randomparadigm 119. Which of the following is an example of 119.

Synchronous paradigm (d) 4761ter yeR boundary condition vulnerability?

Weak password (a) 5uTN YT¥HAI
that 113. y Hq T-T R(ABC) tg, HTA f a)
scheme RiABC).
113.
For a relation assume
SQL injection
the attributes are prime attributes. then (c) Cross site scripting (c)TH-ITEE RpET
minimum R is in which Normal Form? f H H 7 (Normal Form) 8? (d) Buffer overflows d ) 7 HTqRYATG
D SETAH
is not a logical 120. HGRTT -
(a) INF
(a) INF 120. Which of the following
database structure?
(b) 2NF (a)
(b) 2NF (a) Tree
(b) RAT
3NF 3NF (b) Relation
(c)
(d) BCNF e Network
(d) BCNF (d)
(d) Chain
114. The number ofattributes in a relation schema 114. RAM HT KETTE i TT FEOT 121.
121. Adigital computer has a common bus system o H H RH (common bus
is
iscalled- of 32 bits each. Bus
for 16 registers The number
(a) Key constructed with multiplexers.
(a) Key () each multiplexer is-
(b) Arity of selection inputs in
(b) Arity (rëN)
(c) Domain AT8 (a) 8
(c) Domain (8H-)
(b) 5 (b) 5
LCardinality d) Cardinality (feAfere) (c)4 C) 4

(d) None of the above

TETS21]-D Page 20 of 24
Page 21 of 24
TETS21]-D
122 How many times is the comparison i 2n is 122. a f a utuTH fbt aTR
ar T i2n
TaTi>.
perlormed in the following
program?
int i =
200, n =
I10: int i =200, n = 110:
ain main ()
while (i n) while (i2 n)
1=i-1: i=i-1:
n = n+ n =n+ I

(a) 46
(b) 47 b) 47
(c) 48 48
(c)
d 90 (d) 90
123 The statement in Java
programming 123. f r a T Java programming HTH Code
double varl =8/3: double varl = 8/3:

System.out.println (varl); system.out.println (var1);

prints which among the following-
(a) 2 (a) 2
(b) 2.0 (b) 2.0
(c) 3.0 c) 3.0
2.7 d) 2.7
124. The following statement of Java program- 124. Java program 5I ATYT TTE -

System.outprintln(2 = = 2.0): System.out.println(2 = = 2.0);

satisfy to which among the following -

Prints true (a) e

b) Prints false (b) t e T
(c) Will not compile successfully
W i l l compile successfully but raises
an exception
y7RRT TT
125. Which of the following algorithm does not 125. A-ffaT d - fReA f
use divide and conquer ATR GT (divide and conquer) 5i FUiT F7
strategy?
(a) Merge sort
(a) u HE
(b) Quick sort
(b) aka E (Quick sort)
eBinary Sort and Stressian
Multiplication (Binary sort and Stressian
(d) Travelling Salesperson Problem Multiplication)
(TSP) (d)afi HTTT ATTH (TSP)

[TETS21]-D Page 22 of 24