Embed Size (px)
Citation preview
MO
DE
LSO
LV E
D PA
PD
EL
SO
LV
ED
VED PAPERV
ED P
40
R
IBPS SO
IT CWE (M
ain) Exam
Ex
am D
ate:28.01.2018
Based on Memory
1,
In SQ
L w
hic
ho
f the follow
ing
comm
andsis
mainly
used
to
remo
ve
a u
ser-d
efin
ed
object
(4) Information
Serv
ice R
ou
- (1) application
tine
(2)accessibility
(5) None of th
esefro
ma
datab
ase?
5.
In Oracle,
which
data
type is
(3) atomicity
(4) Advanced
(1
) R
em
Ov
e
use
d to sto
reu
nstru
ctu
red
bi- (5) A
utomatic
(2) Drop
nary
data
?1
0. U
niqueIP address
isassigned
(3) Dele
te
(1)IN
T
to each
h
ost
in w
hichof the
(4) Era
se
(2) VA
RC
HA
Rfollowing layer?
(5) R
ollb
ack
(3) D
OU
BL
E(1) N
etwork
Layer
2. Which
of th
e fo
llow
ing
ph
ase
s does
not belo
ngto
the softw
are d
ev
elo
pm
en
t lifecy
cle
?
(4) BL
OB
(2)
Data L
ink Layer(5) N
on
e of th
ese
(3) Transport L
ayer6
. W
hich
layer
of th
e O
SI m
od
el
definesth
e language a
nd
syn tax
forp
rog
ram
s?
4) A
pplication Layer
(1) Testing
(5) physical layer (2) M
ainten
ance
11
. Wh
at is the d
efault value for
(3) Marketing
(1) Data
link
layer
Bo
olean
variablein
an
array? (4) C
oding(2) P
rese
nta
tion
layer
(1) Null
(2) Zero
(5) None o
f these
(3) A
pplication layer (3) F
alse(4) T
rue
3. Consider th
e follo
win
g en
cryp
-tio
n a
log
orith
ms?
(4) S
essio
nlay
er
(5) Tran
spo
rt layer(5)
Bit
I. D
ata
E
ncry
ptio
n S
tan
dard
(DES)
7.
UD
Pan
dT
CP
are
cate
go
rised
lay
er o
f the
12
. Wh
ich o
f the
following lib
raryfu
nctio
nis u
sed
to co
ncate-
un
der th
e
I. Ad
van
ced E
ncry
ptio
n S
tan
dard
(AES)
nate
tw
stringsin
aC
pro g
ram?
OS
I mo
del.
(1)physical
(1) strcpy (2) strlw
r II. R
ivestS
ham
irA
dleman
(RSA)
(2) data
link
(3)
strcmp
(4) strcat
Choose
the option
that cor
rectlym
atchesth
egiven algo
rithms w
ith th
e type o
f cry
p
tography(public-key of private
key) utilised by them.
(1) DES&
AE
S: private-key:
RSA: public-key
(2) AES
&
RS
A: private-key
DES: public-key
3) DES & R
SA
: private-key A
ES: public-key
4) RSA: private-key; DES &&
AES
public-key 5) AES
(3) app
lication
5
) strempP
13
. Wh
ich o
f the follow
ing fun
c-tio
ns is u
sed to
cop
y o
ne m
em
ory
locatio
n to
an
oth
er
in C
++
?
(4) transp
ort
(5) n
etw
ork
8. W
hic
h o
f the fo
llow
ing
top
ol
ogiesm
ainlyu
se h
ub
for
in-
(1) mem
nmove
terc
on
nectio
n o
f reso
urc
es?
(2) m
em
ch
r
(1) Ring topology(3) m
emcm
p
(2) Bu
s top
olo
gy
(4) mem
cPy
(3) Tree topology
(5) mem
set
14
. W
hic
h o
f the follow
ing is
n
ot
true reg
ardin
g a
n O
LT
P s
ys
(4) Star topology
(5) Mesh topology
tem
?
9. 'A
CID
is
a set o
f pro
pertie
s o
f
data
base
tran
sactio
ns in
ten
d-
private-key; DE
S &
(1) OL
TP
is g
enerally
regard
ed
RSA public-key 4. The full form
of ISR is
as
un
su
itab
le
for
data
ed
to
g
uaran
tee v
alid
ityev
en
in
the ev
en
t o
f erro
rs,
po
wer
failu
res.e
tc. T
he a
lph
ab
et
'A' in
the ab
brev
iation
'AC
ID' sta
nd
s
wareh
ou
sing
.
)Information Service
Re (2) O
LT
P sy
stems
an
be rep
oS
-
questito
ries
of fa
cts a
nd
h
isto
ri-
2) Information Select Routine3) Interrupt Service
Routine
cal d
ata
of b
usin
ess
analy-fo
r sis
.
ISIT
-51
3
KIR
AN
'S IB
PS
IT O
FF
IC
ER
PR
AC
TIC
EW
OR
K B
OU
R
is the execution of
26
.
serie
s o
f pro
gra
ms
each
on
set
or "b
atc
h"
of
np
uts
,ra
th
er th
an
a sin
gle
inp
ut.
(1
) U
PD
AT
E
(3) T
he p
urp
ose
of an
OL
TP
sy
s-
tem
is to
ru
n d
ay
-to-d
ay
op
-(2
) IN
SE
RT
(3
) C
RE
AT
E
(1) Bath
gath
erin
g
(2) B
ath
p
rocessin
g
era
tion
s.
(4) Th
e d
ata
mo
del o
f an
OL
TP
sy
stem
is n
orm
alised
.
(4
) T
RU
NC
AT
E
(5) N
on
e o
f th
ese
(3) Batc
h
ch
an
nellin
g
(4) Batch
networking
orie
nte
dp
ro
-
(5) OL
TP
ofle
rs larg
e am
ou
nts
21
.
TC
P is
a
.
of ra
w d
ata
. to
co
l.
15
. In
wh
ich
of the follow
ing join
s, the result is g
enerated
only w
hen
v
aria
ble
matc
hes
from
bo
th ta
ble
s?
(5) No
ne o
f these
(1) D
ata
2
7.
Wh
ich
o
ne o
f the fo
llow
ing
is
11
sedas a
syn
ch
ron
izatio
n to
i
in a m
ultip
rog
ramm
ing
envi
(2) N
etw
ork
(3
) S
essio
ns
(1) Inn
er
join
(4
) C
on
nectio
n
ro
nm
en
t?
(2) C
ross
join
(5
) Ap
plic
atio
n
(1) Sem
ap
ho
re
22
. W
hic
ho
f th
e
follo
win
g algo-
rith
m can
be u
sed
to e
fficie
nt-
(3) Equi-join
(2) A
dd
ress b
us
(4) N
atu
ral
join
ly calcu
late sin
gle
so
urce
sh
orte
st p
ath
s in
a
Directed
gra
ph
?
(1) Djik
stra(2
) Bellm
an
-Fo
rd
(3) IC
s 5
) Ou
ter jo
in
(4) Lo
gic
gate
1
6.
Th
e w
eak
en
ing
of a
sig
nal o
ver
the d
ista
nce it
trav
els
is c
alle
d
(5) N
on
e o
f these
28
. W
hat is
the s
ub
-netw
ork
num-
ber
of a
ho
st
with
an
IP
ad-
dre
ss o
f 17
2.1
6.6
6.0
/21
?
(1)
atte
nu
atio
n
(2) m
od
ula
tion
(3
) To
po
log
ical
So
rt
(4) Strongly C
on
necte
d C
om
po
- (3
)d
em
od
ula
tion
(1
) 1
72
.16
.64
.0
(4) con
ditio
nin
g
nen
t(2
) 1
72
.16
.48
.0
(5)
tran
sd
uctio
n
(5) N
on
e o
f th
ese
(3)
17
2.1
6.3
6.0
1
7.
Wh
at
is th
e c
om
man
d u
sed
to
23
.In
S
QL
, w
hic
hco
mm
an
dis
used
to
ch
an
ge d
ata
in a
data
tab
le?
(4) 1
72
.16
.0.0
access
top
ele
men
to
f a
sta
ck
with
ou
td
ele
ting
it?
(5) No
ne o
f these
(1)p
eek2
9. W
hic
hty
pe o
f mem
bers
of a (1
) UP
DA
TE
(2) is E
mp
ty
base cla
ss is
n
ev
er accessib
le (2
) INS
ER
T
to a
deriv
ed
cla
ss?
(3) to
pE
lem
en
t(3) B
RO
WS
E(1
) Pu
blic
(4) is full (4) A
PP
EN
D
(2) Priv
ate
(5) pop
18
. Ho
w m
an
y lay
ersare
pre
sen
tin
a data w
areho
use sy
stem?
(5) No
ne o
f these
(3) Pro
tecte
d
24
. Th
e language use
d in
applica-tio
n p
rog
ram
sto
req
uest
data
from
th
e D
BM
S is referred
to
(4) Un
iqu
e(1
)8
(2) 7
(5) A
ll of th
e a
bo
ve
(3) 9
(4)6
3
0. W
hen
yo
u sta
rtu
p th
e co
pu
ter th
eb
oo
tup
storagea
wh
ichth
e B
IOS
versions, mar
ufa
ctu
rer
an
d d
ata
are as
pla
yed
on
the m
on
itor
is calleu
(1) Bo
otstrap
as th
e
(5) 5
(1) DM
L
19
. If h
is an
y h
ash
ing
fun
ctio
nan
dis u
sed
to h
ash
n k
ey
s in
to
a ta
ble
of s
ize
M,
wh
ere
(2) DD
L
(3) Query L
anguage n
=m
,,the
exp
ectedn
um
ber
of
collisio
ns in
vo
lvin
g a
partic
u-
lar key
x is
(4) DC
L
(5) No
ne o
f these
(2)P
ow
ero
n self test (PO
SI)2
5.
Which
of th
e following proto-(1) less th
an
1 col is connectionless, low
ov
er-
(3) System
configuration
(2) less than
n h
eadan
d high speed?
(4) Kern
el load
ing
(3) less than
m
(1) AR
P
(5) No
ne o
f these
(4) less than
n/2
(2)
TC
Pan
dA
RP
31
. A
. m
ean
s th
at o
ne recor
in
a p
artic
ula
r re
co
rd iyP e
is
(5) greaterth
an n
20
. Wh
ich
of th
e following
SgL
statem
ent is use
d
to changed
data
in
a databasetable?
(3) ICM
P related
to o
nly
on
e reco
an
oth
er reco
rd ty
pe
(4) UD
P
(5) TC
P
(1) O
ne to
o
ne relatio
nsh
p
(2) On
e to
man
y relatio
ns
sh
ip
ISIT-514
KIRA
N'S
IBPS IT OFFICERPRACTICE
WORK B
ooK
36
. R
ow
s of a relation are called
4
1.
Wh
lch
of th
e follow
ing is
no
t (3
) Man
y to
o
ne re
latio
nsh
ip
(4) Many
to m
an
y relationship
(1) Relation
a context
free gramm
arcom
(5) No
ne o
f these
(2) Tuples
ponents?
32
. In
files.
there
is a
key asso
ci-
ated w
ith each
record
wh
ichis
(3)D
atastru
ctu
re
(1) Terminalsymbols
(2) No
nterm
inal
sym
bo
l(4) A
n
entity
(5) None of these
used
to differentiate a
mo
ng
|
different records. F
or every lile |
37
. A
computer
systemconsisting
(3) Production
line
(4) List
there is at
leasto
ne set o
f a
key
that is u
niq
ue.
Su
ch
a Key
of its p
rocesso
r, m
emo
ryan
d
1/O devices accepts data, p
ro
cessesit an
dp
rod
uces
theo
ut
pu
tre
sults.
Can
yo
u
tellin
w
hic
h c
om
po
nen
t is
the
raw
data
fed?
(5) None of
these
42
. TLB is a high speed
cacheused
to
ho
ld
recen
tlyre
fere
nced
pag
eta
ble
en
tries
a p
artof
pag
edv
irtual
mem
ory
.In
vert
ed
pag
e tab
lesch
eme
uses
a
pag
e tab
le th
at co
nta
ins
an
entry
for each p
hy
sicalfram
e.n
ot for each
logicalpage.
Th
is
is calle
d
(1) Unique
key (2
) Prim
e a
ttribu
te
(3) Indexkey
(1) Mass M
emo
ry(4) Prim
ary key (2) M
ain M
emo
ry(5) N
ull key (3) L
ogicU
nit 3
3.
is prim
arily
use
d
for
en
sure
sth
at
the
table
occu
- (4) A
rithmetic U
nit p
ies a fixedfractio
nof m
emo
-
ry. Th
e size is pro
po
rtion
al to
physicalm
emory.
notthe
virtu
al ad
dre
ss space.
map
pin
g
ho
st
nam
es
an
d
(5) No
ne o
f these
destin
atio
ns
to
IP a
d-
dress
bu
t can
alsob
e u
sed
for
38
. Th
e m
ech
an
ical d
iskette
driv
ein
wh
ich
we in
sert o
ur d
iskette
oth
er pu
rpo
ses.
is co
nn
ecte
d
to
the
co
mp
ut-
er's-b
us.
(1) TC
P (T
ransfer C
on
trol P
ro-
(1)T
hree
(2) Fo
ur
tocol)(3) F
ive (4) S
ix
(1)D
ata(2)
DN
S(D
om
ain
N
am
e
Sy
s-
tem)
(5)M
ore
than
six(2) C
om
mu
nic
atio
n
43
. Which
one is capableof over
lapp
ing
I/0 o
peratio
n for o
ne
job
with
pro
cessor o
peratio
ns
foran
oth
er jo
b?
(3) Ad
dress
(4) Parallel
3) S
HA
(S
ecu
reh
ash
A
lgo
-(5) N
on
e of th
ese
rithm)
39
. Th
e p
rocess
of tra
nsfe
rring
data
inte
nd
ed
for a p
eriph
eral d
evice in
to a d
isk (o
r inte
rme-
(4) Simle N
etwork m
anagement
Pro
toco
l(S
NM
P)
1) R
egister
(5) None of these
dia
te sto
re) so
that it c
an
be
(2) Operating System
n
34
. O
verride is a meth
od
.tra
nsfe
rred
to p
erip
hera
l at a
(3) Spooling
mo
re co
nv
en
ien
t time o
r in
(4) Buffering
(1) for an
op
eration
that re
places an inherited m
eth-
od for th
e sam
e operation.
bu
lk is k
no
wn
as
(5) No
ne o
f these
(1) Multiprogram
ming
44
. Th
e T
RA
P is o
ne o
f the in
ter-
(2) Spooling(2) for a d
ata that rep
lacesan
inherited method for
the ru
pts
av
aila
ble
in
IN
T'E
L
80
85
. Which of th
e following
(3) Caching
sam
e o
pera
tion
. (4) V
irtual
pro
gra
mm
ing
sta
tem
en
ts is tru
e
regard
ing
TR
AP
? (3) for an operation that takes
arguments
form
libraryfunction.
(5) No
ne o
f these
40
. C
on
sid
er
an
o
pera
tion
o
t ad
-(1) It is level triggered
(2) It is negativeedge triggered
as well as positive
edge trig-
gered
ditio
n.
Fo
r tw
o n
um
bers
,th
e
4) All of theseoperating w
ill generatea
su
m.
If the o
pera
nd
are
string
s,an
d
the sa
me o
pera
tion
wo
uld
pro
du
ce a
third
string
by con
cat-en
atio
n.
Th
is featu
res
is called
5) None of these
35. The w
ord (3) It is positive
edge triggered m
eans th
e ability
to take m
any forms.
(1)Polymorphism (4) lt
is bo
th p
ositiv
e edg
e trig-
gered and level triggered (1) In
herlta
nce
(2) Overloader
(5) No
ne o
f these
(2) En
capsu
lation
(3) Polymorphism
4
5. T
hey way a particular applica-
tion
v
iew
s th
e d
ata
fro
m
the
13) Overnider
4) Aggregation
datab
asethat
the application u
ses is
a:
(4) Binding
5) Generalization
(5) N
on
e o
f these
ISIT-515
KIR
AN
'SIB
PS
IT O
FF
IC
ER
PR
AC
TIC
EW
OR
R 5
6.
A
pro
gra
m
that
neith
er ren
i
cate
s o
r co
pies itself,
but does d
am
ag
e o
r co
mp
ro
mis
es th
secu
rity
of
the
co
mp
ute
n
Wh
ich
o
f the fo
llow
i
co
mp
ute
rv
iru
s?
prin
tfo
d".
a):
(1
) M
od
ule
prin
tfbd
". a);
(2) R
ela
tion
al
mo
del
retu
rn O
: ng is
that (3
) Sch
en
ma
(4
) S
ub
sch
em
a
(1) 20
20
(1) Jo
ke p
rog
ram(5) N
on
e o
f these
(2) 1
0 2
0
(2) W
orm
4
6.
Each
n
od
e in
a
link
ed
lis
t (4
) 10
10
(3
) 20
10
(3) T
rojan
m
ust co
ntain
at
least
(1) T
hee fie
lds
(5
) C
om
pilatio
n erro
r
(4) H
oax
5
2.
Fir
ew
all
in co
mp
ute
ris
u
sed
for
(2) Fiv
e fields
(5) No
ne o
f these
(3) Fo
ur ficld
s 5
7. W
hic
h
of th
e follow
ing state. m
en
ts sho
uld
b
e u
sed
to oh
tain
a re
main
der a
fter dividing
3.1
4 by 2
.1?
(4) On
e field
s (1) S
ecurity
(5) Tw
o field
s (2
) D
ata tran
sm
issio
n
(3
) A
uth
en
ticatio
n
47
. E
ncry
ptio
n a
nd
decry
ptio
n a
re
functions of the
lay
er.
(1) Tra
nsp
ort
(2) Sessio
n
(4) Mo
nito
ring
(1
) rem
= 3
.14
%2
.1;
(5) No
ne o
f these
(2) re
m=
mo
df{
3. 1
4. 2
.1):
53
. W
hat
is IS
P a
nd
wh
at
is th
eir
fun
ctio
n?
(3) Application
(3) rem=
fmo
d(3
.14
.2.1
): (4) P
rese
nta
tion
(4) R
em
ain
der c
an
no
tbe ob-
tain in
floatingpointdeci
48
. B
an
ker's
alg
orith
m fo
r reso
urc
e
(1) Inte
rnal S
erv
ice P
rov
ider: A
co
mp
an
yw
hic
hp
rov
ide
in-
tern
et c
on
nectio
n fo
r a fee.
allo
catio
n d
eals w
ith
sio
n
(1) Dead
lock
pre
ven
tion
5
8. W
hat sh
ou
ldb
e the outputof
the follow
ing program?
(2) Inte
rnet S
erv
ice P
rov
ider: A
co
mp
an
yw
hic
hprovide
in-
tern
al
tran
sferrin
g d
ata
ser-
vic
e to
an
o
rgan
izatio
n.
(2) Deadlock
avo
idan
ce
(3) Dead
lock
recoveryy #
inclu
de<
stdio
.h>
(4) M
utu
al
ex
clu
sion
in
t m
ain
0
5) A
ll of th
ese
(3) In
tern
et
Serv
ice
Pro
vid
er: A
4
9.
Aln)
is a co
llectio
n o
f in-
co
mp
an
yw
hic
hp
rov
ide
in-
form
atio
n th
at
dete
rmin
es
tern
et
co
nn
ectio
n to
o
ther
int
i =
3
, j. k
:
wh
ich
filesy
ou
can
access
an
d
wh
ich
settin
g y
ou
use
. people
for a fee. j
&i;
(4) Intern
al Service P
rov
ider: A
printf
("6d \n". i*ji+*j): (1) N
etwo
rkcom
pany provide intern
al co
nn
ection
to transfer
data
betw
een two com
pany.
retu
rn0
: (2) U
ser accou
nt
(3) Op
erating
system
(4) File sy
stem
5) N
one of these
(1) 30
(2) 2
7
54
. O
nce the active m
edium is e
x-
(3) 15 (4)9
(5)N
on
eo
f these
cited.the first photons o
f light are
producedby w
hich physi- cal p
rocess?
(1)B
lackbody rad
iation
(5) 3 5
0. W
hich
p
art of th
e com
pu
ter provides
only temp
orary
stor-
ag
e o
f files?
59
. Wh
icho
f the follow
ing state m
en
tsare
co
rrect
ab
ou
tthe
given program?
(1) RO
M m
emory
(2) Processor (2) S
pontaneous enisslo
n
#include<stdio.h> (3) H
ard drive(3)
Synchrotron
radtation in
t m
ain
) (4) M
otherb
oard
(4) Plank's
oscillatlon 55. W
hichof
the tollowing
is no
t a type of expansion slot
or b
us
design usedin
Advanced-tech nology
classsystenm
s?
(5) RA
M
Mem
oryin
tsize,
i: 5
1.
Wh
at will
be the output o
f "a"|in
follo
win
g c
od
e?
scantd
".& size):
#include <stdio.h>
in
t arrlsiz
el:
int
main
))
PCM
CIA
a for
(1=1:k=
size:it+ in
t a 2
0
(2)ISA
(3)PR
OM
scanf(od". arr|lil):
int a=
10
: (4) E
ISA
printtod". larr|il):
(5) None of these
retu
rnO0;
ISIT-516
KIRAN'S IBPS IT OFFICERPRACTICE
wO
RK
BOOK 9
. (31'software development lile
10
. (1) At the network layer,
a gdo-(1) T
he
co
de
is e
rro
neo
us s
ince
the su
bsc
ript fo
r arra
y u
sed
in fo
r loop is in
the ra
ng
e 1
cycle.'these
sixsteps include
planning. analysis,
design.d
evelo
pm
ent
& im
ple
men
ta
tion
,te
stin
g&
d
ep
loy
men
t
bal addressing system
that uniquely icdentifies
every
host and router
is necessary for
to siz
e.
deliveryof
a packetfrom
net
and
m
ainten
ance.
work
to network. T
he Internet(2) T
he c
od
e is
erT
on
eo
us sin
ce
the v
alu
es
of a
rray
are
get-
ting scan
ned
through th
e
loop.
3.
(1) D
ES
and
AE
S
uses sym
m
etric
or S
ecre
to
r priv
ate
key
cry
pto
gra
ph
y.
RS
A
an
d
DS
S
are the m
ost w
idely used
pu
b-
lic key encryption algorithms.
address (or
IP address)is 32
bits (for IPv4)
that uniuely and universally defines
a host o
r ro
uter
on
the internet.
(3) Th
e c
od
e is e
rro
neo
us sin
ce
the
state
men
t decla
ring
ar-
ray
is in
valid
.4
. (3)
ISR
. S
tan
ds fo
r "Inte
rrup
t
Serv
ice
Ro
utin
e." A
n IS
R(also
11
. (3) By
default,th
e value
of boolean
primitive
type is
false (4)
Th
e c
orre
ct
an
dru
ns
su
c-
cessfully. 1
2.
(4)Y
oucan
con
catenate
two
calle
d a
n in
terru
pt h
an
dle
r)is
a so
ftware
pro
cess in
vo
ked
by
an
in
terru
pt
req
uest
from
a
hard
ware
dev
ice.
string
seasily
usin
gstan
dard
libra
ry
fun
ctio
n
strcat(jo
f strin
g.
h head
er
file.
13
. (4) T
he m
em
cp
yfu
nctio
nis
use
dto
cop
y a
blo
cko
f data
(5) No
ne o
f these
60
. Wh
ich
of th
e follow
ing tw
o li-
bra
ry fu
nctio
ns a
re u
sed
to d
y-
nam
ically
allo
cate
mem
ory
?
(1) mallo
can
d m
em
allo
c
5.
(4) SQ
Ld
ata
typ
es th
at
are
ideal fo
r larg
e a
mo
un
ts of u
n-
str
uctu
red
b
inary
data
in
-
clud
eth
e BL
OB
data type (B
i
nary
Large
Ob
ject)an
d
the
BF
ILE
data
typ
e(B
inary
File
object).
from
a so
urc
e a
dd
ress to
a des-
tinatio
n a
dd
ress.
(2) alloc a
nd
mem
allo
c1
4. (1)
DB
MS
b
uilt
for
on
line
(3) mallo
can
d callooc
tran
sactio
n p
rocessin
g (O
LT
P)
is g
enerally
regardedas
un
-(4) m
em
allo
can
d farallo
c
(5) No
ne o
f these
su
itab
le fo
r 6
. (3) T
he ap
plicatio
n layer o
f the
OS
I m
od
el p
rov
ides
a fram
e-
wo
rk
to ru
n ap
plic
atio
n p
ro-
gra
ms. It d
efin
es
the lan
gu
age
an
d sy
nta
x u
sed
by
pro
gra
ms
to c
om
mu
nic
ate
with
sup
ple
-
men
tary
pro
gra
ms.
data
w
areh
ou
sin
g
becau
se
each
syste
m is
desig
ned
with
a d
ifferin
g s
et o
f req
uire
men
ts
in m
ind
e.g.: O
LT
P s
yste
ms
are
design to m
ax
imiz
eth
e tran
s-
actio
np
rocessin
g cap
acity
.
OL
TP
h
old
s
cu
rren
td
ata
-AN
SW
ER
S1. (2)
2. (3)
3. (1)
4. (3
)
8.
12. (4)| 1
3. (4) 1
4. (1)
| 15. (1) 1
6. (1)|
20. (1) 24. (1)| 2
8. (1) |
29. (2) 3
0. (2
) 3
1. (
1)| 32. (4)|
36. (2
)
40. (3) 44. (4) 48. (2)
49. (2) 5o. (5)51. (4)| 52. (1)
56. (3)| 60. (3)|
5. (4)
6. (3)
7. (4)
9. 13)
10
. (1
)| 1
1. (3
)
7.
(4) T
he tra
nsp
ort lay
er co
n-
trols
the reliability o
f co
mm
u-
nicatio
ns th
rou
gh
flow
co
n-
trol,
seg
men
tatio
n,
an
d erro
r
co
ntr
ol.
Tw
o g
reat e
xam
ple
so
f
tran
sp
ort
pro
toco
ls are T
CP
(as in T
CP
/IP) a
nd
U
DP
. TC
P,
or th
e T
ran
sm
issio
n C
on
tro
l
17. (1) 18
. (1) 1
9. ()
21
. 4)
22
. (3)
25. (4) |2
6. (2)
wh
ere
as
data
w
are
ho
usin
g
23
. .(1)
ho
lds
his
toric
al
data
.O
LT
P
su
pp
orts
day
-to
-d
ay
decis
ion
s
an
d serv
es large
nu
mb
er o
f
clerical/o
peratio
n
users.
27. (1)
33. 2) 3
4.(1)
37
. (2)
38
. (2)
41
. 14) 4
2. (")
45. 14) 4
6. (5)
35
. (1)
39
. (2)
43
.(3)
15
. (1) IfC
=
in
nerjo
in| A
.B)
cre-
ate
s th
e ta
ble
o
r tim
eta
ble
. C
.
Pro
toco
l, is co
nn
ectio
n o
rlen
t
ed
. UD
P,
or th
e U
ser D
ata
gra
m
Pro
toco
l, is
n
ot
co
nn
ectio
n
as
the in
ner jo
in
betw
een
A
an
d
B
by m
atc
hin
gu
p
ro
ws
usin
g a
ll the v
aria
ble
s w
ith th
e
sam
e n
an
e as k
ey v
ariab
les.
Yo
u
can
p
erto
rm in
ner jo
ins
on
ly o
n certan
co
mb
in
atio
ns
47
.14)
53. (1) 54. (2) 57. (3)
58
. (3) 5
5. (3)
orie
nte
d.
59
. (3) 8
. (4)
Sta
r n
etw
ork
co
nsists
ot
-EX
PL
AN
AT
ION
S-
on
e c
en
tral
hu
b w
hic
h a
cts
as
of ta
ble
s a
nd
tim
etab
les.
Itf A
a con
du
itto tran
smitm
essag
es. In
sta
r to
po
log
y, e
very
ho
st
Is c
on
necte
d to
a
cen
tral
hu
b.
is a
tab
le,
then
B
m
ust
be
a
(2) Th
e S
QI. D
RO
P co
mm
an
dis
use
d
to
rem
ov
e a
n
ob
ject fro
m th
e d
atä
base
. If yo
u d
rop
a
table, all th
e ro
ws in
the ta-
ble
is
d
ele
ted
an
d
the
tab
le
tab
le.
inn
erjo
in retu
rn
sC
as
a ta
ble
.
16
. (1)
Atten
uatio
n
is
a g
en
era
l
term
th
at
rele
rs to
an
y r
ed
uc-
tion
in
the stre
ng
tho
f a sig
nal.
Atte
nu
atio
n o
ccu
rs w
ith
9.
(3) In
th
e co
nte
xt
of
tran
sac
lo
n p
rocessin
g.
the acro
ny
im
AC
ID
re
fers
to
th
e
fo
ur
key
stru
ctu
re is re
mo
ved
from
th
e
data
base.
Wh
en
a
tab
le
is
pro
pertie
s o
f a tran
sactlio
n
alomlcity, conslsteney, Isola
thon, an
d d
urab
ility
an
y
typ
e
of sig
nal,
wh
eth
er
dro
pp
ed
all th
e re
fere
nces to
he ta
ble
w
ill n
ot
be
valid
.
ISIT
-517
