Sei sulla pagina 1di 8

s aslaalia. i.N a laalia. i.

N
www.Padasalai.Net
s s s as
N
laalia. i.www.TrbTnpsc.com s as laalia. i.N saaslaa
d
aa a
d a d
aa a
d a d
aa ad a d
aa a
d a d
aa a
d
ww .P.P ww.P.P ww.P.P ww.P.P ww.P.P
w
ww w www w www w wwww wwww
ADHITHYA etet
TRB- TETetet
COACHING CENTRE
etet
KANCHIPURAM etet
i . N
i . N i . N
i . N i . N
i . N i . N
i . N
d a
d saaslaala d a
d
laala MATRIC SCHOOL -s9786851468
saasSUNDER d ad aaslaala
d a
d saaslaala d a
d saaslaa
aa
.PTEST-1 aa aa aa aa
w ww
w
.P w ww
w
.PCOMPUTER
.P SCIENC
w www.P.P PG -TRBww ww.P.P DATE : 10. 03w.w .P.P
w2019
w
ww ww ww ww ww
i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
1. salaThe
a i
la GSM network sisasldivided a
ala i into the following i
aslala three major Systems
a aslal:a
a i aslaa
a a s a a a sa a sa a sa
adad a)
.P.P .P.P
SS,BSS,OSS adad .P.P adab)
d
BSS, BSC, .PMSC
. adad
P .P.P adad
www w www w ww w w wwww www w
ww ww ww ww ww
c) t CELL, BSC, OSS t d) SS,tCELL, MSC
i . N . e et
N i . N . e et
N i . N . e et
N i . N . etet
N
2. sasaThe
l a a i
l key requirement/s asafor
l a a i
l a routing function l a a i
asainl packet-switching networks
l
asal a a i is/are: aslaa
d a a d a sa d a sa d a sa d a sa
a ad
.P.P .P.Pa ad .P.P a ad .P.P a ad .P.P a ad
w w w a) Efficiency
w w w w w w w ww w w w
www www www www www
b) t Correctness, Simplicity and Fairness
i .N . e et
N i .N . etet
N i .N . etet
N i .N . etet
N
a i a i a i a i
d a
d saasac)
l l a Optimality,aRobustness
d d saasal l a and Stability
d ad
l
saasa l a
d a
d saasal l a
d a
d saaslaa
aa
.P.P P.P
.theaa .P.P aa .P.P aa .P.P aa
w ww
w d) Allwofww
w above w www wwww wwww
ww ww ww ww ww
3. Applet etetViewer tool is available etet in which of thei.folder etet of JDK etet
i . N
i . N i . N
i . N N
i . N i . N
i . N
d a
d saaslaaa)
la Bin
d a
d saaslaala d
b)
adsaaslaalaLib d a
d saaslaala d a
d saaslaa
aa
.P.P .P.Paa .P.P aa .P.P aa .P.P aa
w
ww
ww
w c) Source
www ww
w www www d) Class wwwwww
wwwwww
4. What’s etet the difference between etet Servlets and applets? etet etet
a i . N
i . N a i . N
i . N a i . N
i . N a i . N
i . N
a sa
la
asla1) Servlets a saaslalaon Servers, where
executes a saas la
aslaApplets executes on
a sa
lala
asBrowser a saaslaa
adad
.P.P .P.Padad .P . adad
P .P.P adad .P.P adad
www w 2) www
Servletsw have no GUI, where
ww w w as an Applet has GUI
wwww www w
ww ww ww ww ww
3) eteServlets
t creates static eteweb
t pages, where .as eApplets
tet creates dynamic eteweb
t pages
a i . N
i . N a i . N
i . N a i N
i . N i . N
i . N
a sa
l
asa4)l a Servlets cana s l
handle
a
a
asal only a single request, a sa
l a
asal where as Appletasacan l a
asalhandle multiple asaaslaa
a
d
a ad d
a ad d
a ad d
a ad adad
w .wP.P requests
w .P. P w .P . P w . P. P w . P. P
ww
ww wwwww wwwww wwwww wwwww
a) ete1,2,3 t are correct etet b) 1,2ete are
t correct etet
a i . N
i . N a i . N
i . N a i . N
i . N a i .Ni . N
d a
d
l
saasac)l a 1,3 are correct
d a
d saasal l a
d d)
ad
l l a
saasa 1,2,3,4 are correct d a
d saasal l a
d a
d saaslaa
aa
.P.P .P.Paa .P.P aa .P.P aa .P.P aa
w ww
w 5. Which ofw ww
the
w following is used in
w wwTCP
w to provide extreme
wwww reliability? wwww
ww ww ww ww ww
a) eteChecksum
t etet b) Sequence
etet number etet
i . N
i . N i . N
i . N i . N
i . N i . N
i . N
d a
d saaslaac)
la TCP header d a
d saaslaala
length d d)
adsaaslaalaNone of the above d a
d saaslaala d a
d saaslaa
aa
.P.P .P.Paa .P.P aa .P.P aa .P.P aa
w ww
w 6. TLB is w ww
acronym
w for w www wwww wwww
ww ww ww ww ww
a)NN eteTranslation
t Looking N eBuffer
N
tet b) Translation
N etet
N Look asideNBuffer etet
N
a i . i . a i . i . a i . i . a i . i .
a sa
la
aslac) Translation a s
Left
a
a
aslalBuffer d)
a saaslalaTranslation Look a s aslala
Block
a a saaslaa
adad
.P.P .P.Padad .P.P adad .P.P adad .P.P adad
www w 7. A disk w www w
scheduling algorithm inww w w
wwoperating system causes
an ww
ww the disk arm to sweep w w
ww back
ww w ww ww
and eforthtet across the disk N surface
etet servicing all requests etet in its path. Thisi.N iseatet
N N N N
s aslaali
a)
a. i .
FCFS s as laalia. i .
b)s aslaa ia. i . N
l Shortest seek timesasal i.N l a a s aslaa
d a
a ad a d a
a ad a d a
a ad a d a
a ad a d a
a ad a
w w.P.P w .P.P
w w .P.P
w ww.P.P w .P.P
w
w
www c) Scanw
www w
www d) Eschenbackwww scheme
w w
www
i .N . etet
N i .N . etet
N i .N . etet
N i .N . etet
N
a i a i a i a i
d a
d
l
saasa l a
d a
d saasal l a
d ad
l
saasa l a
d a
d saasal l a
d a
d saaslaa
aa
.P.P .P.Paa .P.P aa .P.P aa .P.P aa
w ww
w w ww
w w www wwww wwww
ww AADHITHYA ww PG-TRB COMPUTER ww SCIENCE , KANCHEEPURAM- ww 9786851468 ww
i . N . etet
N i . N . etet
N i . N. Netet i . N . etet
N
i i i
alaala https://www.trbtnpsc.com/2017/10/computer-instructor-trb-exam-study-materials-download.html
alaala alaala alaala i alaa
dasas dasas dasas dasas dasas
s aslaalia. i.N a laalia. i.N
www.Padasalai.Net
s s s as
N
laalia. i.www.TrbTnpsc.com s aslaalia. i.N saaslaa
d
aa a
d a aad a
d a aa d a
d a aad a
d a d
aa a
d
ww.P.P ww.P.P ww .P.P ww.P.P ww.P.P
w
ww w www w ww ww www w w
ww w

i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
i i i i
d a
d saaslaala d a
d saaslaala d a
d saaslaala d a
d saaslaala d a
d saaslaa
aa
.P.P 8. Which allows a a to create a derived
.P.you
P aclass
.P.P a that inherits properties a a from more than.P.one
.P.P aa
w ww
w w ww
w wwww w ww
w w ww P
w
ww base class? ww ww ww ww
a)
i . N . eteMultilevel
N t
inheritance i . N . etet
N b) i . . etet inheritance i.N.N
Multiple
N N etet
a
aslala i a
aslala i a
aslala i a
aslala i aslaa
a sa a sa a sa a sa a sa
adad c)
.P.P Hybrid adad
.P.Inheritance
P adad)
.P.P d Hierarchical adad
.P.Inheritance
P adad
.P.P
www w www w www w www w www w
ww 9. The principle ww of ‘locality of references’ ww justify the use wwof ww
a)
i . N . eteDMA
N t
i . N . etet
N b) i . N . etet
Polling
N i . N . etet
N
l
asala a i l
asal a a i l
asal a a i l
asala a i aslaa
d a sa d a sa d a sa d a sa d a sa
a ad c)
.P.P Cache a ad
memory
.P.P a ad)
.P.P d Virtual memory a ad
.P.P a ad
.P.P
w w w w w w w w w w w w w w w
www www www www www
10. The following C programs print
.N . etet
N .N . etet
N .N . etet
N .N . etet
N
amain
i i ( ) a i i a i i a i i
d a
d
l
saasa l a
d a
d saasal l a
d a
d saasal l a
d a
d
l
saasa l a
d a
d saaslaa
aa
.P.P { .P.Paa aa
.P.P aa
.P.P aa
.P.P
w ww
w w ww
w wwww w ww
w w ww
w
ww ww ww ww ww
fork( );
i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
i i i i
d a
d saaslaafork
la ( );
d a
d saaslaala d a
d saaslaala d a
d saaslaala d a
d saaslaa
aa
.P.P print (“1”) .P.Paa aa
.P.P aa
.P.P aa
.P.P
w ww
w w ww
w wwww w ww
w w ww
w
ww ww ww ww ww
}
i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
aslaa)
ala i 1 a
aslala i b)saslala11
a i a
aslala i aslaa
a sa a sa a a a sa a sa
adad
.P.P .P.Padad adad
.P.P adad
.P.P adad
.P.P
www w c) 111www w www w d) 1111 www w www w
ww ww ww ww ww
11. Enterprise Resource Planning (ERP)
i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
l a
asaa)l a i has existed afor l a
asover a i
al a decade. l
asal a a i l
asala a i aslaa
d a sa d sa d a sa d a sa d a sa
a ad
.P.P .P.Pa ad a ad
.P.P a ad
.P.P a ad
.P.P
w
www
w w b) does
w
www
wnot
w integrate well with
wwww w the
w functional areas other
w
www
w w than operations. w
www
w w
c) et is
i . N
i . N et inexpensive to iimplement..Ni . etet
N i .Ni . etet
N i .Ni . etet
N
l a
saasad)l a automate and l al a
saaintegrates the majority l al a
saasofa business processes. l
saasa al a saaslaa
d a
d d a
d sa d a
d d a
d d a
d
aa
.P.P aa
.P.the
P aa
.P.P aa
.P.P aa
.P.P
w
ww
ww
w 12. Which one
www wof
w w following statements
ww wwww is NOT correct wwabout
w ww
w HTTP cookies? w
ww
ww
w
a) eteA t cookie is a piece of
etecode
t that has the potential etet to compromisei.Nthe etet
i . N
i . N i . N
i . N i . N
i . N i . N
d a
d saaslaala security ofda an
d
laala user
saasInternet d a
d saaslaala d a
d saaslaala d a
d saaslaa
aa
.P.P .P.Paa aa
.P.P aa
.P.P aa
.P.P
w ww
w b) A w ww
cookie
w gains entry to the
wwwuser’s
w work area ww
through
w w an HTTP header w ww
w
ww ww ww ww ww
c) eteA t cookie has an expiry etetdate and time i.N.N etet etet
a i . N
i . N a i . N
i . N a i a i . N
i . N
a sa
la
aslad) cookies can abe
sa ala to track the browsing
aslused a saaslala pattern of a particular a saaslala site. a saaslaa
adad
.P.P .P.Padad adad
.P.P adad
.P.P adad
.P.P
www w 13. Consider w w
wawcomplete binary tree w w
wwhere
w the left and the w w
right
w w subtrees of the root w w
wware
ww ww ww ww ww
max N eheaps.
N
tet N etet
N N etet
N N etet
N
a i . i . a i . i . a i . i . a i . i .
a sa
l l
asaThe a
lower bound s
for
a a
l a
al number of operators
asthe a sa
l
asato l a
convert the treea s
toa
l l a
asaaheap is a saaslaa
d
a ad d
a ad d
a ad d
a ad d
a ad
w .P.P
w w .P.P
w w w.P.P w .P.P
w w .P.P
w
w
www a) w w
Ω(log
ww n) wwww b) Ω(n) www w w
www
c)i.N.N eteΩ(n
t log n)
i .N . etet
N d) i .Ω(n2)
N . etet
N i .N . etet
N
a i a i a i a i
d a
d
l
saasa l a
d a
d saasal l a
dadsaasa l l a
d a
d
l
saasa l a
d a
d saaslaa
aa
.P.P .P.Paa aa
.P.P aa
.P.P aa
.P.P
w ww
w w ww
w wwww w ww
w w ww
w
ww AADHITHYA ww PG-TRB COMPUTER ww SCIENCE , KANCHEEPURAM- ww 9786851468 ww
i . N . etet
N i . N . etet
N i . N. Netet i . N . etet
N
i i i
alaala https://www.trbtnpsc.com/2017/10/computer-instructor-trb-exam-study-materials-download.html
alaala alaala alaala i alaa
dasas dasas dasas dasas dasas
s aslaalia. i.N a laalia. i.N
www.Padasalai.Net
s s s as
N
laalia. i.www.TrbTnpsc.com s aslaalia. i.N saaslaa
d
aa a
d a aad ad a d
aa ad a d
aa a
d a d
aa a
d
ww.P.P ww.P.P ww.P.P ww.P.P ww.P.P
w
ww w www w ww w w www w wwww

i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
i i i i
d a
d saaslaala d adsaaslaala d adsaaslaala d a
d saaslaala d a
d saaslaa
aa
.P.P 14 . Match the w aa
following
.P.P aa
.P.P aa
.P.P aa
.P.P
w ww
w w w w w ww
w w ww
w wwww
ww ww ww ww ww
P. Lexical analysis - 1. Graph coloring
. N etet
N . N etet
N . N etet
N . N etet
N
aQ.
aslalai i . Parsing a
aslala i i . - 2. DFA aminimization
aslalai i . a
aslalai i . aslaa
a sa a sa a sa a sa a sa
adad R.
.P.P Register
.P.P
dad
aallocation - w3.w adaPost-order
.P.P d traversal adad
.P.P adad
.P.P
www w www w ww www w wwww
ww ww ww ww ww
S. Expression evaluation - 4. Production tree
i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
l
asalaa)a i P-2, Q-3, R-1, S-4.
l
asal a a i b) l
asala a i
P-2, Q-1, R-4, S-3. l
asala a i aslaa
d a sa d a sa d a sa d a sa d a sa
a ad c)
.P.P P-2, .P.P
Q-4, ad S-3
a R-1, .P.P d
a ad) P-2, Q-3, .P.P
R-4,
d
a aS-1. a ad
.P.P
w w w w w w w w w w w w w ww
www www www www www
15. In a connected graph , a bridge is an edge whose removal discounts a graph.
i .N . etet
N i .N . etet
N i .N . etet
N i .N . etet
N
aWhichi one of the followinga i statements is true? a i a i
d a
d
l
saasa l a
d adsaasa l l a
d adsaasal l a
d a
d
l
saasa l a
d a
d saaslaa
aa
.P.P .P aa
.P aa
.P.P aa
.P.P aa
.P.P
w ww
w a) Aw tree
ww
w has no bridges w ww
w w ww
w wwww
ww ww ww ww ww
b) t A bridge cannot be part of a simple cycle
i . N . e et
N i . N . etet
N i . N . etet
N i . N . etet
N
i i i i
d a
d saaslaac)
la Every edgeaof
d dsaasalaaclique
la with size graph
d adsaaslaala d a
d saaslaala d a
d saaslaa
aa
.P.P aa
.P.with
P aa
.P.P aa
.P.P aa
.P.P
w ww
w d) Agraph
w ww
w bridges cannot w whave
w w a cycle w ww
w wwww
ww ww ww ww ww
16. Given below
etet are some algorithms,
etet and some algorithm etet design paradigms etet
a i . N
i . N a i . N
i . N a i . N
i . N a i . N
i . N
a sa
la
asla1. Dijkstra’s shortest
a sa aslala path a sa aslala - i. Divide and a sa
lala
asconquer a saaslaa
adad
.P.P .P.Padad adad
.P.P adad
.P.P adad
.P.P
ww
ww
w w 2. Floyd-warshall
wwwww w algorithm ww to
www compute
w all - ii.
ww Dynamic
www w programming wwwwww

i . N . etePairs
N t shortest path etet
i . N . N i . N . etet
N i . N . etet
N
l a
asa3.l a i l
ason a a i l a a i
al a sorted array asaasal - iii. Greedy adesign l
asala a i aslaa
d a sa Binary search
d a sa d d sa d a sa
a ad
.P.P .P.Pa ad a ad
.P.P a ad
.P.P a ad
.P.P
w w w 4. w w w
Backtracking search on a w w
graph
w - iv. w w w
Depth-first search w ww
www www www www www
i .N . etet
N i .N . etet
N i .N . etev.t Breadth-first search
N i .N . etet
N
a i a i a i i
d a
d
l l a
saasaMatch the abovedalgorithms adsaasa l l a
a
l l a
asacorresponding design
on the left dtoadsthe d a
d
l a
saasaparadigm they dadsaaslaa
l a
aa
.P.P .P.Paa aa
.P.P aa
.P.P aa
.P.P
w ww
w follow. w ww
w w ww
w w ww
w wwww
ww ww ww ww ww
a)NN ete1-i,
t 2-iii, 3-i, 4-v. .NN etet b) 1-iii,
N etet2-iii, 3-i, 4-v. i.N.N
N etet
i . i . i i . i . i . i
d a
d saaslaac)
la
1-iii,2-ii,3-i,
d ad
aslaala
sa4-iv. d d)
adsaaslaala1-iii, 2-ii, 3-i, 4-v. d a
d saaslaala d a
d saaslaa
aa
.P.P .P.Paa aa
.P.P aa
.P.P aa
.P.P
w ww
w 17. Which w w w w
iswnot a debugging technique
w w w
w w w w
w w wwww
ww ww ww ww
a)i.N.N etetcore dumps i . N . etet
N b) i . . etet
traces
N N i . N . etet
N
ala
aslac) i a
aslala i a i
aslalaregression testing a
aslala i aslaa
a sa print statements
a sa d)
a sa a sa a sa
adad
.P.P .P.Padad adad
.P.P adad
.P.P adad
.P.P
www w w w
wwhich
w w w
ww of valid lexicalwunits w w
ww in the source ww wwww
ww 18. The rules ww govern the formation ww w
program
i . N . etet are
N i . N . etet
N i . N . etet
N i . N . etet
N
l
asala a i l
asal a a i l
asala a i l
asala a i aslaa
d a sa a) Syntax rules
d a sa d a
b)sa Semantic rulesd a sa d a sa
a ad
.P.P .P.Pa ad a ad
.P.P a ad
.P.P a ad
.P.P
w w w w w w w w w w w w w ww
www c) www rules
Lexical www d) Synthesis wwwphase www
i .N . etet
N i .N . etet
N i .N . etet
N i .N . etet
N
a i a i a i a i
d a
d
l
saasa l a
d adsaasa l l a
d adsaasal l a
d a
d
l
saasa l a
d a
d saaslaa
aa
.P.P .P.Paa aa
.P.P aa
.P.P .P.Paa
w ww
w w ww
w w ww
w w ww
w www
w
ww AADHITHYA ww PG-TRB COMPUTER ww SCIENCE , KANCHEEPURAM- ww 9786851468 ww
i . N . etet
N i . N . etet
N i . N. Netet i . N . etet
N
i i i
alaala https://www.trbtnpsc.com/2017/10/computer-instructor-trb-exam-study-materials-download.html
alaala alaala alaala i alaa
dasas dasas dasas dasas dasas
s aslaalia. i.N a laalia. i.N
www.Padasalai.Net
s s s as
N
laalia. i.www.TrbTnpsc.com s aslaalia. i.N saaslaa
d
aa a
d a d
aa a
d a d
aa a
d a d
aa a
d a aad ad
ww .P.P ww .P.P ww .P.P ww .P.P ww.P.P
w
ww w ww w w w
ww w ww w w ww ww

i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
i i i i
d a
d saaslaala d a
d saaslaala d a
d saaslaala d a
d saaslaala d adsaaslaa
.P.P aa19. Which of the aa
.Pfollowing
.P concepts means .P.P a aadding new concepts .P.Pa to
a a program as it .P.P aa
w ww
w w ww
w w ww
w w ww
w wwww
ww ww ww ww ww
runs ?
. N etet
N . N etet
N . N etet
N . N etet
N
aa)
aslalai i . Data hiding a
aslalai i . b) a
aslalai Dynamic
i . loading a
aslalai i . aslaa
a sa a sa a sa a sa a sa
.P.P adad c) Dynamic .P.P adad
typing .P.P adad)
d binding ww .P.Padad .P.P adad
www w www w www w ww wwww
ww ww ww ww ww
20. Match the following with respect to programming languages :
i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
l
asala a i List -1 l
asala a i List l
asala– a i
II A l
asala a i
B C D saslaa
a s a s a s a s
.wP.P
d a
a ad a) .wP.P
Structured
d d a
a aLanguage - .wP.1P
d a
a adJAVA .wP.P
a)
d
a ad3 a
4 1 .wP.P a2daada
www www www www www
ww ww ww ww ww
b) t Non-structured Language tet - 2 BASIC tet b) 4 3 t 2 1
N e e t N e N e N e e t
s as lia. i.N Object Oriented
laac) s as lia. i.N
laaLanguage - 3 PASCAL s aslaalia. i.N c) 2saslaalia. 4i.
N 1 3 saslaa
d
aa a
d a d
aa a
d a d
aa a
d a d
aa a
d a adaada
ww . P. P d) .
InterpretedP P
ww Language ww
. . P P
- 4 FORTRAN ww
w . wd).P.P 2 3 4ww .
ww 1P. P
ww
ww ww ww ww w ww w ww
21. Important tet advantage of using tetnew and delete operators tet in C++ is
i . N . e
N i . N . e
N i . N . e
N i . N . etet
N
i i i i
d a
d saaslaaa)
la Allocation a
d
ofsaa
d
a
slala
memory
d a
d saaslaala d a
d saaslaala d adsaaslaa
.P.P aa P.P
.the aa .P .Paa .P.Paa .P.P aa
w ww
w b) Frees
w ww
w memory previously w ww
w allocated w ww
w wwww
ww ww ww ww ww
c) et Initialization of memory etet easily etet etet
i . N
i . N et i . N
i . N i . N
i . N i . N
i . N
s ala
aslad) Allocation a ofsaa a
lala
memory and frees the s a
aslala previously allocated.
memory s a
aslala s aslaa
a a s a a a a a a
.P.P adad P.Padad
.standard .P.P adad .P.Padad .P.P adad
ww
ww
w w 22. Which LAN
ww www w has the highest
ww
ww
w w data rate? ww www w ww wwww
a) ete10Base5 t etet b) 10Base-T
etet etet
a i . N
i . N a i . N
i . N a i . N
i . N a i . N
i . N
a sa
l
asac)l a Twisted Pair
a sa
l
Token a
asal Ring d)
a sa
l a
asal FDDI a sa
l
asal a
a saaslaa
d
a ad d
a ad d
a ad d
a ad d
a ad
w w.P.P w w.P.P w w.P.P w w.P.P ww.P.P
w
www 23. Which of
wwwwthe following IP Network
w
www addresses is a reserved
wwww address? wwww
a) ete127.0.0.0 etet b) 130.50.0.0
etet etet
a i .Ni . N t a i .Ni . N a i .Ni . N a i .Ni . N
d a
d
l
saasac)l a
197.65.10.0 d a
d
l
saasa l a
d d)
a
d
l l a
saasa 4.0.0.0 d a
d
l
saasa l a
d adsaaslaa
.P.P aa .P.P aa .P.P aa .P.Paa .P.P aa
w ww
w 24. When w ww
installing
w an Ethernet w ww
10BASE-T
w network, what w ww
type
w of cable is used? wwww
ww ww ww ww ww
a)NN eteFiber
t Optic N etet
N b) Coaxial
N etet Cable
N N etet
N
i . i . i . i . i . i . i . i .
d a
d saaslaac)
la
Twisted Pair
d a
d saaslaala d d)
a
d saaslaalaWireless d a
d saaslaala d adsaaslaa
.P.P aa .P.P aa .P.P aa .P.Paa .P.P aa
w ww 25. A process w w w w w w w w w w ww
ww w ww executes the following
w ww code:
w ww w ww w
for
i . N . etet i<n; i++)
(i=0;
N i . N . etet
N i . N . etet
N i . N . etet
N
ala i
aslafork(); a
aslala i a
aslala i a
aslala i aslaa
a sa a sa a sa a sa a sa
.P.P adad .P.P adad .P.P adad .P.Padad .P.P adad
www w w w
wnumber
w w w
ww created is www w wwww
ww The total ww of child processes ww ww ww
a)i.N . etetn
N i . N . etet
N b) i .2n
N . e–te1t
N i . N . etet
N
l
asala a i l
asala a i l
asala a i l
asala a i aslaa
d a sa c) 2n d a sa d a
d)sa 2n+1 – 1 d a sa d a sa
.P.P a ad .P.P a ad .P.P a ad .P.Pa ad .P.P a ad
w w w w w w w w w w w w w ww
www www www www www
i .N . etet
N i .N . etet
N i .N . etet
N i .N . etet
N
a i a i a i a i
d a
d
l
saasa l a
d a
d
l
saasa l a
d a
d
l
saasa l a
d a
d
l
saasa l a
d adsaaslaa
.P.P aa .P.P aa .P.P aa .P.Paa .P.P aa
w ww
w w ww
w w ww
w w ww
w wwww
ww AADHITHYA ww PG-TRB COMPUTER ww SCIENCE , KANCHEEPURAM- ww 9786851468 ww
i . N . etet
N i . N . etet
N i . N. Netet i . N . etet
N
i i i
alaala https://www.trbtnpsc.com/2017/10/computer-instructor-trb-exam-study-materials-download.html
alaala alaala alaala i alaa
dasas dasas dasas dasas dasas
s aslaalia. i.N a laalia. i.N
www.Padasalai.Net
s s s as
N
laalia. i.www.TrbTnpsc.com s aslaalia. i.N saaslaa
d
aa a
d a d
aa a
d a aad a
d a aad a
d a d
aa ad
ww.P.P ww.P.P ww.P.P ww.P.P ww.P.P
w
ww w w
ww w ww ww ww w w wwww

i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
i i i i
d a
d saaslaala d a
d saaslaala d a
d saaslaala d a
d saaslaala d adsaaslaa
.P.P aa26. Match the w aa :
following
.P.P .P.P aa .P.P a aa b c d .P.P aa
w ww
w w w w wwww w ww
w wwww
ww ww ww ww ww
a) OLAP - 1) Regression a) 2 3 1 4
N e t
e t e te t e te t e t
e t
s as lia. i.N OLTP
laab) s aslaal-ia.Ni.N 2) Data Warehouse
s aslaalia.Ni.N b) 2 alaa3lia.N
s s
i.N4 1
s aslaa
a a
adad c) dada
aTree a adada a a a
ada3d 2 1 4 .P.P a
adad a
w .P.P
w Decision
w .P.P
w - 3) RDBMS w .P.P
w w c)
.P.P
w ww
ww
ww ww
ww ww ww ww ww wwww
d) Neural Network - 4) Classification d) 3 2 4 1
ia.N etet
N . N etet
N . N etet
N . N etet
N
27.saslaalIn i.Win32, which function l
asala ia i . is used to create i
Windows
l
asala a i . Applications ?
l
asala ia i . aslaa
d a a d a sa d a sa d a sa d a sa
.P.P a ad a) WinAPP .P.Pa ad .P.P d
a ab) Win API .P.P a ad a ad
.P.P
w w w w w w w w w w w w w ww
www www www www www
c) t Win Main d) WinVoid
Ne et .N etet .N etet .N etet
lia. i.Ndocument standards
28.saslaaThe l
saasa al ia i .
for
N EDI were first l
saasa alia i
developed . N by large business
l
saasa alia i . Nhouse during saslaa
d
aa a
d a d a
d
a a now under the control d a
d
a a of the following standard d a
d
a a organisation .P.P adaada
ww. P. P the 1970s and
ww.P.are
P ww. P. P ww.P .P ww
ww
ww ww
ww ww ww ww ww wwww
a) ISO b) ANSI
N e t
e t N e te t N etet N etet
i . i . N i . i . N i . i . N i . i . N
d a
d saaslaac)
la ITUT
d a
d saaslaala d
d)saslaalaIEEE
a
d a d a
d saaslaala d adsaaslaa
.P.P aa .P.Pa atelephone channel .in aa a a a speed of aa
w ww
w 29. A typicalwdigital ww
w wwwwP.PTDM circuits is w w
.P.P
allocated
ww wwww.P.P
ww ww ww ww ww
a) t 4 kbps b) 8 kbps
i . N . e et
N i . N . etet
N i . N . etet
N i . N . etet
N
aslac)
a la i 64 kbps a
aslala i a i
d)saslala1.544 Mbps a
aslala i aslaa
a sa a sa a a a sa a sa
.P.P adad adad
.Pfollowing
P .P.P adad .P.P adad adad
.P.P
www w 30. Which of
wwthe
w w . is not a WAN
www w technology? ww w w wwww
ww ww ww ww ww
a) t X.25 b) Frame Relay
i . N . e et
N i . N . etet
N i . N . etet
N i . N . etet
N
l a
asac) l a i ATM l
asala a i d) l a a i
asal None of the above l
asala a i aslaa
d a sa d a sa d a sa d a sa d a sa
.P.P a ad a ad
.Pfollowing
.P .P.P a ad .P .Pa ad a ad
.P.P
w
www
w w 31. Which of
w
wwwthe
w w is a good
wwww reason
w w to use linked wwwlists
w w w in a program? w
www
ww
a) et To
i . N
i . N et make execution i . N
i .
faster
etet
N i .Ni . etet
N i .Ni . etet
N
l a
saasab) l a To access any l al a
saaselement
a randomly asaasa l al a l
saasa al a saaslaa
d
aa a
d d
aa a
d aad d aad a
d d
aa ad
ww.P.P c) To .P.P
allocate
ww space dynamically ww.P.whenever
P needed ww.P.P ww.P.P
w
ww w w
ww w ww ww ww w w wwww
d) eteTo t make deletion .of eelements
tet easier etet etet
i . N
i . N i N
i . N i . N
i . N i . N
i . N
d32.
a saaslaaAssume
la N segmentsd a
laalamemory and a page
saasin d a saaslaala of P bytes. Theswastage
size d a aaslaala on accountasaaslaa
.P.P aa d .P.Paa d .P.P aa d .P.P aa d adad
.P.P
ww
ww
w w of internal ww
ww fragmentation
w w is: ww www w ww ww w w wwwwww
a) et NP/2 t bytes e tet b) P/2 e tebytes
t etet
i . N
i . N e i . N
i . N i . N
i . N i . N
i . N
s a
aslac)la N/2 bytes asaaslala a d) s a
aslalaNP bytes s a
aslala s aslaa
a
adad a adad adada a adada a a
adad a
w .P.P
w 33. A compiler w .P.P
that
w runs on one machinew .P.P
w and produces code w .P.P
for
w a different machine w .P.P
is
w
ww
ww ww
ww ww ww ww ww wwww
called: etet etet etet etet
a i . N
i . N a i . N
i . N a i . N
i . N a i . N
i . N
a sa
l
asaa) l a Cross compilation
a sa
l
asal a b)
a sa
l a
asal One pass compilation a sa
l
asal a
a saaslaa
d
a ad d
a ad d
a ad d
a ad d
a ad
w .P.P
w w .P.P
w w .P.P
w w .P.P
w ww.P.P
w
www c) Two
w
www pass compilation wwww d) None of
wwww the above w
www
i .N . etet
N i .N . etet
N i .N . etet
N i .N . etet
N
a i a i a i a i
d a
d
l
saasa l a
d a
d
l
saasa l a
dadsaasal l a
d a
d
l
saasa l a
d adsaaslaa
.P.P aa .P.Paa .P.P aa .P.P aa aa
.P.P
w ww
w w ww
w wwww w ww
w wwww
ww AADHITHYA ww PG-TRB COMPUTER ww SCIENCE , KANCHEEPURAM- ww 9786851468 ww
i . N . etet
N i . N . etet
N i . N. Netet i . N . etet
N
i i i
alaala https://www.trbtnpsc.com/2017/10/computer-instructor-trb-exam-study-materials-download.html
alaala alaala alaala i alaa
dasas dasas dasas dasas dasas
s aslaalia. i.N a laalia. i.N
www.Padasalai.Net
s s s as
N
laalia. i.www.TrbTnpsc.com s aslaalia. i.N saaslaa
d
aa a
d a aad a
d a aad a
d a d
aa a
d a d
aa a
d
ww.P.P ww .P.P ww.P.P ww.P.P ww.P.P
w
ww w www w www w ww w w ww w w

ila.N
34. alaMatch .Netetthe following: i.N.N etet i . N . etet
N i . N . etet
N
i i i i
d a
d sasa d a
d saaslaala d a
d saaslaala d a
d saaslaala d a
d saaslaa
aa
.P.P List-I.P.Paa aa
.P.P Listw-wII.P
.P aa .P.Paa
w ww
w w ww
w w ww
w w w w ww
w
ww ww ww ww ww
a. Physical layer - 1 Allow resources to network access
. N etet
N . N etet
N . N etet
N . N etet
N
ab.
aslala i i . Data link layer a
aslala i i . - 2 Move a
aslalaipackets
i . from one destination
a
aslalai i . to other aslaa
a sa a sa a sa a sa a sa
adad c.
.P.P Network .P.P
dad
alayer - w3w adaProcess
.P.P d to process adad delivery
message
.P . P .P.Padad
www w www w ww www w ww w w
ww ww ww ww ww
d. Transport layer - 4 Transmission of bit stream
i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
l
asalae.a i Application Layerl
asal a a i - 5 Formation
l
asala a i of frames l
asala a i aslaa
d a sa d a sa d a sa d a sa d a sa
a ad
.P.P Codes: .P.Pa ad a ad
.P.P .P.P a ad .P.Pa ad
w w w w w w w w w w w w w w w
www www www www www
a b c d e
i .N . etet
N i .N . etet
N i .N . etet
N i .N . etet
N
aa) i 4 5 2 3
a i 1 a i a i
d a
d
l
saasa l a
d a
d saasal l a
d a
d
l
saasa l a
d a
d
l
saasa l a
d a
d saaslaa
aa
.P.P .P.Paa aa
.P.P .P.P aa .P.Paa
w ww
w b) 5 www4w 1 2 3 ww ww w ww
w w ww
w
ww ww ww ww ww
c) t t1 3 2 5 4
i . N . ee
N i . N . etet
N i . N . etet
N i . N . etet
N
i i i i
d a
d saaslaad)
la 1 2
d
4saaslaa3la 5
a
d d a
d saaslaala d a
d saaslaala d a
d saaslaa
aa
.P.P P.Paa
.makes aa
.Pcalls.
.P .P.P aa aa
.P.two
P
w ww
w 35. Merge sort w ww
w two recursive w ww
w Which statement w ww
w is true after these w ww
w
ww ww ww ww ww
recursive calls finish, but before the merge step ?
i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
aslaa)
ala i The array elements a i
aslala form a heap. asaaslala a i a
aslala i aslaa
a sa a sa a sa a sa
adad
.P.P .P.Padad adad
.P.P adad
.P.themselves.
P .P.Padad
www w b) Elements
www w in each half of the
ww w array
w are sorted amongst
www w ww w w
ww ww ww ww ww
c) t Elements in the first half of the array are lesst than or equal to elements in
i . N . e et
N i . N . etet
N i . N . e et
N i . N . etet
N
a saaslaalai second halfaof saasthe i
laalaarray.
a saaslaalai a saaslaalai a saaslaa
d
a ad d
a ad d
a ad d
a ad d
a ad
w .P.P
w d) All of
w w P.P
.the above w .P.P
w w .P.P
w w .P.P
w
w
www w
www w
www wwww wwww
36. Match etetthe following : i.N.N etet etet etet
a i . N
i . N a i a i .Ni . N a i .Ni . N
d a
d
l
saasa l a List -1 asaasa
d d
l l a
d a
d
l l a
saasa List - II d a
d
l
saasa l a
d a
d saaslaa
aa
.P.P .P.Paa aa
.P1.
.P .P.P aa .P.Paa
w
ww
ww
w a. Automatic
www ww
w storage class www- ww
w Scope of thewwvariable
w ww
w is global. ww w ww
w
b. eteRegister
t storage class etet - 2. Valuei.of ethe
tet variable persists N between
etet
i . N
i . N i . N
i . N N
i . N i . i . N
d a
d saaslaala different function
d a
d saaslaalacalls. d a
d saaslaala d a
d saaslaala d a
d saaslaa
aa
.P.P .P.Paa aa
.P.P .P.P aa .P.Paa
w ww
w c. w ww
Static
w storage class w- ww
w 3. Value stored in
w wmemory
w w and local to w ww
the
w
ww ww ww ww ww
i . N . eteblock
N t in which the etet
i . N . N i . N . etet
N i . N . etet
N
a
aslala i a
aslala i a
aslala i a
aslala i aslaa
a sa variable is defined.
a sa a sa a sa a sa
adad
.P.P .P.Padad adad
.P.P .P.P adad .P.Padad
www w d. w w
External
ww storage class ww w w w
- w 4. Value storedwin w w
wwCPU registers. ww w w
ww ww w ww
i . N . eteCodes
N t :
i . N . etet
N i . N . etet
N i . N . etet
N
l
asala a i a basaascal d l a a i l
asala a i l
asala a i aslaa
d a sa d d a sa d a sa d a sa
a ad
.P.P a) w3w .P.Pa a4d 1 2 a ad
.P.P .P.P a ad .P.Pa ad
w w w w w w w w w w w w w
www www3 4 2 1 www
b) www www
i .N . etec)
N t 4 3 2 i.N1.N etet i .N . etet
N i .N . etet
N
a i a i a i a i
d a
d
l
saasa l a d) 4 d3asaas1a 2
d
l l a
dad
l
saasa l a
d a
d
l
saasa l a
d a
d saaslaa
aa
.P.P .P.Paa aa
.P.P .P.P aa .P.Paa
w ww
w w ww
w w ww
w w ww
w w ww
w
ww AADHITHYA ww PG-TRB COMPUTER ww SCIENCE , KANCHEEPURAM- ww 9786851468 ww
i . N . etet
N i . N . etet
N i . N. Netet i . N . etet
N
i i i
alaala https://www.trbtnpsc.com/2017/10/computer-instructor-trb-exam-study-materials-download.html
alaala alaala alaala i alaa
dasas dasas dasas dasas dasas
s aslaalia. i.N a laalia. i.N
www.Padasalai.Net
s s s as
N
laalia. i.www.TrbTnpsc.com s aslaalia. i.N saaslaa
d
aa a
d a d
aa a
d a aad a
d a d
aa a
d a d
aa a
d
ww.P.P ww .P.P ww.P.P ww.P.P ww.P.P
w
ww w www w www w ww ww www w

i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
i i i i
d37.
a
d saaslaaWhen
la
we pass an
d a
d saaslaala
array as an argument dto
a
d
laala
saasfunction, what actually
d a
d
aala passed ?
saaslgets d a
d saaslaa
aa
.P.P .P.Paa aa
.P.P .P.Paa aa
.P.P
w ww
w w ww
w w ww
w wwww w ww
w
ww a) Address
ww of the array ww b) Values wwof the elements of theww array
c)i.N . eteBase
N t address of the i . N . etet
array
N d) i . N . etet of elements ofi.Nthe
Number
N . etearray
N t
a
aslala i a
aslala i a
aslala i a
aslala i aslaa
a
38.s
d An algorithm.PisP a s a s a s a s
ada
.P.P
a
. adamade
d up of 2 modules
a adaM1
.P.P d and M2. If time
a
.P.Padacomplexity
d a of modules
adad
.P.P
a
www w M1 andwM2 w w
ww are h(n) and g(n) w wwww
respectively, the time complexity www w of the algorithm w
wwisw
ww w w ww ww
a)i.N.N etemin
t (h(n), g(n)) .NN
i . etet b) i .max
N . ete(h(n),
N t g(n)) i . N . etet
N
l a
asac)l a i l
asala a i l a a i
asal h(n)*g(n) l
asala a i aslaa
d a sa h(n) + g(n)d a sa d d)
a sa d a sa d a sa
a ad
.P.P .P.Pa ad a ad
.P.P .P.Pa ad a ad
.P.P
w w w w w w w ww w w w w w w
www 39. A clustering www index is createdwwhen ww www www
a)i.N . eteprimary
N t key is declared
i .N . etet and ordered i.N.N
N etet i .N . etet
N
a i a i a i a i
d ad
l
saasab)l a
no key d a
ordered
d
l
saasa l a
d a
d saasal l a
d a
d
l
saasa l a
d a
d saaslaa
aa
.P.P .P.Paa aa
.P.P .P.Paa aa
.P.P
w ww
w w ww
w wwww wwww w ww
w
ww c) foreign
ww key ordered ww ww ww
d)
i . N . etethere
N t is no key and i . N no
. eteorder
N t
i . N . etet
N i . N . etet
N
i i i i
a saaslaala a saaslaala a saaslaala a saaslaala a saaslaa
d
aa
.P.P 40.
d Which of the following
.P.P
d
aa d correctly describes
aa
.P.P
d d overloading of functions?
.P.P
d
aa d d
aa
.P.P d
w ww
w w ww
w wwww wwww w ww
w
ww a) ww polymorphism ww
Virtual b) ww polymorphism ww
Transient
c)
i . N . eteAd-hoc
N t polymorphism i . N . etet
N d) i . . etet polymorphismi.N.N
Pseudo
N N etet
a
aslala i a
aslala i a
aslala i a
aslala i aslaa
a sa a sa a sa a sa a sa
ada
.P.P 41.
d The compiler.Pconverts
. adad all operands.upto
P adadthe type of the largest
P.P .P.Padaoperand
d is called .P.Padad
www w www w wwww www w www w
ww a) ww
Type Promotion ww b) TypewEvaluation
w ww
c)
i . N . eteType
N t
Conversion i . N . etet
N d) i . Type
N . etet Declaration i.N.N
N etet
l
asala a i l
asala a i l
asal a a i l
asala a i aslaa
d a sa
d The start and.Pstop d a sa d a sa d a sa d a sa
aa
.P.P 42. .Pa adbits are used in serial .P.P d
a acommunication a ad
for.P.P a ad
.P.P
w w w w w w w ww w w w w w w
www a) wwwdetection
error www b) ww
errorwcorrection www
c)
i .N . etesynchronization
N t
i .N . etet
N d) i N . etet down the communication
.slowing
N i .N . etet
N
a i a i a i a i
d ad
l
saasa l a
d a
d
l
saasa l a
d a
d saasal l a
d a
d
l
saasa l a
d a
d saaslaa
aa
.P.P 43. Simplest way a adeadlock recovery.is
.P.of aa aa aa
w ww
w w ww
w
P
wwwwP.P wwww.P.P
w ww
w
.P.P
ww ww ww ww ww
a) Roll back B) Preempt resource
. N etet
N . N etet
N . N etet
N . N etet
N
c)
i i . Lock one of the processes
i i . d) i Kill
i . one of the processes i i .
d adsaaslaala d a
d saaslaala d a
d saaslaala d a
d saaslaala d a
d saaslaa
aa
.P.P 44. Encryptionwand .P.PaDecryption
a is the w aa
responsibility
.P.P of Layer.ww .P.Paa aa
.P.P
w ww
w w w w ww w ww w ww
w
ww ww ww ww ww
a) Physical b) Network
i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
aslac)
ala i Application saslala a i a i
d)saslalaData link a
aslala i aslaa
a sa a a a a a sa a sa
ada
.P.P d
45. _________ is adad used to prove the
.P.often
P .P.P
dad
acorrectness of a .P.P
recursiveadadfunction. adad
.P.P
www w www w wwww www w www w
ww ww ww ww ww
a) t Diagonalization b) Communitivity
i . N . e et
N i . N . etet
N i . N . etet
N i . N . etet
N
asac)
l al a i MathematicalsasInduction
l a
al a i l a i
d)sasal Matrix Multiplication
a l
asala a i aslaa
d a sa d a a d a a d a sa d a sa
a ad
.P.P .P.Pa ad a ad
.P.P .P.Pa ad a ad
.P.P
w w w w w w w ww w w w w w w
www www www www www
i .N . etet
N i .N . etet
N i .N . etet
N i .N . etet
N
a i a i a i a i
d ad
l
saasa l a
d a
d
l
saasa l a
d a
d saasal l a
d a
d
l
saasa l a
d a
d saaslaa
aa
.P.P .P.Paa aa
.P.P .P.Paa aa
.P.P
w ww
w w ww
w wwww wwww w ww
w
ww AADHITHYA ww PG-TRB COMPUTER ww SCIENCE , KANCHEEPURAM- ww 9786851468 ww
i . N . etet
N i . N . etet
N i . N. Netet i . N . etet
N
i i i
alaala https://www.trbtnpsc.com/2017/10/computer-instructor-trb-exam-study-materials-download.html
alaala alaala alaala i alaa
dasas dasas dasas dasas dasas
s aslaalia. i.N a laalia. i.N
www.Padasalai.Net
s s s as
N
laalia. i.www.TrbTnpsc.com s aslaalia. i.N saaslaa
d
aa a
d a aad a
d a aa d a
d a aad a
d a d
aa a
d
ww.P.P ww.P.P ww.P.P ww.P.P ww.P.P
w
ww w www w www w www w wwww

i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
i i i i
d a
d saaslaala d a
d saaslaala d a
d saaslaala d a
d saaslaala d a
d saaslaa
aa46. The process a aassigning load addresses
.Pof a a to the various.P.parts aa aa
w ww
w
.P.P
w ww
w
.P w ww
w
.P.P
w ww P of the program
w wwww.P.and
P
ww adjusting wwthe code and data inww the program to reflectww the assigned addresses wwis called
i . . etet
____________
N N i . N . etet
N i . N . etet
N i . N . etet
N
a
aslala i a
aslala i a
aslala i a
aslala i aslaa
a sa a sa a sa a sa a sa
adad a)
.P.P Symbol resolution
a
.P.P
dad adab)
.P.P d Parsing .PP
. adad adad
.P.P
www w www w www w ww w w wwww
ww c) ww
Assembly ww d) ww
Relocation ww
47. laActivei . N . etetX controls are Pentium
N i . N . etet binary programsi.N
N that
. etetcan be embeddedi.in
N N . N
tet
e________
asal a i l
asala a i l
asala a i l
asala a i aslaa
d a sa d a sa d a sa d a sa d a sa
a ad a)
.P.P Word .pages
a ad
P.P a ab)
.P.P d URL pages.P.P a ad a ad
.P.P
w w w w w w w w w w w w w ww
www c) www pages
Script www d) Web w ww
pages www
48. laMatch i .N . etetthe following : i.N.N
N etet i .N . etet
N i .N . etet
N
i a i a i a i
d a
d saasa l a
d a
d
l
saasa l a
d a
d
l
saasa l a
d a
d
l
saasa l a
d a
d saaslaa
ww
aa
.P.P List-I
ww
aa
.P.P ww
aa
.P.P Listw- .II
P.Paa a b c w.P.dP aa
w
ww w www w www w www w w ww w
a. Wireless Application Environment 1. HTTP a) 2 4 w1w 3
e te t e t
e t e t
e t e te t
ab.ia.Ni.N Wireless Transaction alia.Ni.NProtocol 2.alia.Ni.IPN b)ala4lia.N i.3N 2 1
d a
d saasla l
d a
d saasla
d a
d saasla
d a
d sa s a
d a
d saaslaa
aa
.P.P c. Wireless aDatagram
.P.P a Protocol a a 3 Scripts .P.P
.P.P a a c) 4 3 1 .P.2P aa
w ww
w w ww
w w ww
w w ww
w wwww
ww ww ww ww ww
d. Wireless 4. UDP d) 3 1 4 2
N e te t N e t
e t e t
e t e tet
s s lia. i.N operating system
49. alaaLinux
s as
i.N
laalia.uses s aslaalia.Ni.N
s aslaalia.Ni.N
s aslaa
a a
adad a) dada a
aScheduling adab)a
d a a a
adadScheduling a
adad a
w .P.P
w Affinity
w .P.P
w w .P.P
w Fair Preemptive
w .P.P
w ww.P.P
ww
ww wwww wwww wwww wwww
c) Hand Shaking d) Highest Penalty Ratio Next
ila.N etet N etet N etet N etet
50.saslaaData i.NIntegrity control l
asal i
uses
a a. i . N l
asala ia. i . N l
asala ia. i . N
aslaa
d a a d a sa d a sa d a sa d a sa
a ad a)
.P.P Upper .P
and
.P
d
a alower limits onwnumeric a ad data.
.P.P .P.Pa ad a ad
.P.P
w w w w w w w w w w w w ww
www www www www www
b) t Passwords to prohibittunauthorized access tot files.
i . N . e et
N i . N . e et
N i . N . e et
N i . N . etet
N
i i i i
d a
d saasac)
l al a Data dictionary
d a
d saasato keep the data dadsaasa
l al a l al a
d a
d
l
saasa al a
d a
d saaslaa
aa
.P.P aa
.P.P aa
.P.P .P.Paa aa
.P.P
w ww
w d) Data
w wdictionary
w w to find last w w
waccess
w of data w ww
w wwww
ww ww ww ww ww
i . N . eA1tet A2
N
3
i .
4 t t 5
N . ee A
N
6 7
i . N . etet B8
N
9 10 t t
i .N . ee
N
a i A a i
B B aC i C a D i
d a
d
l l a
saasa 11 12 d a
13
d
l l
saasa 14 a
15 16d a
d
l
saasa17l a
18 19
d a
d
l l
saasa 20 a
d a
d saaslaa
aa
.P.P D Bww
a aA
.P.P C B ww
aC a
.P.P D A ww .P.PaBa A
aa
.P.P
w ww
w w w w w w w wwww
ww 21 ww22 23 24 ww25 26 27 w28
w 29 30 ww
Dt D A C t B B C B D D
i . N . e31et 32
N 33 i . N
34. e et 35
N 36 37
i . N . etet 38
N 39 40
i . N . etet
N
a
aslala C i a
aslalaB i a
aslaCla i a
aslalCa i aslaa
a sa A Aas a B B as a B A as a a sa
adad
.P.P 41 42 ada43d
.P.P 44 45w.P.Pa46dad 47 48 w.P.P
dad
a49 50 adad
.P.P
www w w
wCw w ww Dw ww B w wwww
ww A ww A C wwC D wDw D ww
i . N . etet
N i . N . etet
N i . N . etet
N i . N . etet
N
l
asala a i l
asala a i l
asala a i l
asala a i aslaa
d a sa d a sa d a sa d a sa d a sa
a ad
.P.P a ad
.P.P a ad
.P.P .P.Pa ad a ad
.P.P
w w w w w w w w w w w w w ww
www www www www www
i .N . etet
N i .N . etet
N i .N . etet
N i .N . etet
N
a i a i a i a i
d a
d
l
saasa l a
d a
d
l
saasa l a
d a
d
l
saasa l a
d a
d
l
saasa l a
d a
d saaslaa
aa
.P.P aa
.P.P aa
.P.P .P.Paa .P.Paa
w ww
w w ww
w w ww
w w ww
w www
w
ww AADHITHYA ww PG-TRB COMPUTER ww SCIENCE , KANCHEEPURAM- ww 9786851468 ww
i . N . etet
N i . N . etet
N i . N. Netet i . N . etet
N
i i i
alaala https://www.trbtnpsc.com/2017/10/computer-instructor-trb-exam-study-materials-download.html
alaala alaala alaala i alaa
dasas dasas dasas dasas dasas

Potrebbero piacerti anche