11. Match the following
domain in GROUP 1 with the solution technologies in GROUP 2
GROUP
1
p)
Service oriented computing
Q)
Heterogeneous communicating system
R)
Information representation
S)
Process Description
GROUP
2
1)
Interoperability
2)
BPMN
3)
Publish-find-bind
4)
XML
a)
p-1,
Q-2, R-3, S-4
b)
P-3,
Q-4, R-2, S-1
c)
P-3,
Q-1, R-4, S-2
d)
P-4,
Q-3, R-2, S-1
Answer: c
12.
The transport layer protocol used for real time multimedia, file transfer, DNS
and email respectively are
a)
TCP,UDP,UDP and TCP
B)
UDP,TCP,TCP and UDP
C)
UDP,TCP,UDP and TCP
D)
TCP,UDP,TCP and UDP
Answer: c
13. Using public key
cryptography, X adds a digital signature σ to message M, encrypts <M,
σ >, and sends it to Y, where it is
decrypted. Which one of the following sequences of keys is used for the
operations?
a)
Encryption: X’s private key followed by Y’s private key; Decryption: X’s public
key followed by Y’s public key
b) Encryption:
X’s private key followed by Y’s public key; Decryption: X’s public key followed
by Y’s private key
c) Encryption:
X’s public key followed by Y’s private key; Decryption: Y’s public key followed
by X’s private key
d) Encryption:
X’s private key followed by Y’s public key; Decryption: Y’s private key followed
by X’s public key
Answer: d
14.
Assume that source S and destination D are connected through two intermediate
routers, labeled R. Determine how many times each packet has to visit the
network layer and the data link layer during a transmission from S to D
a)
Network layer-4 times and Data link layer-4 times
b)
Network layer-4 times and Data link layer-3 times
c)
Network layer-4 times and Data link layer-6 times
d)
Network layer-2 times and Data link layer-6 times
Answer: c
15.
An index is clustered, if
a)
It is on a set of fields that form a candidate key.
b)
It is on a set of fields that include the primary key.
c)
the data records of the file are organized in the same order as the data
entries of the index
d)
The data records of the file are organized not in the same order as the data
entries of the index.
Answer: c
16.
Three concurrent process X, Y, and Z execute three different code segments that
access and update certain shared variables. Process X executes the P operation
(i.e. wait) on semaphores a, b and c; process Y executes the P operation on semaphores
b, c and d; Process Z executes the P operation on semaphores c, d and a before entering
the respective code segments. After completing the execution of its code
segment, each process invokes the V operation (i.e. signal) on its three semaphores. All semaphores are
binary semaphores initialized to one. Which one of the following represents a
deadlock-free order of invoking the P operation by the processes?
a) X: P(a) P(b) P(c) Y: P(b)P(c)P(d) Z: P(c)P(d)P(a)
b)
X: P(b) P(a) P(c) Y: P(b)P(c)P(d) Z: P(a)P(c)P(d)
c)
X: P(b) P(a) P(c) Y: P(c)P(b)P(d) Z: P(a)P(c)P(d)
d)
X: P(a) P(b) P(c) Y: P(c)P(b)P(d) Z: P(c)P(d)P(a)
Answer: b
Next : Gate 2013 computer Science Questions and Answers 17-22
Previous : Gate 2013 Answer key Computer science 1-10
Previous : Gate 2013 Answer key Computer science 1-10
No comments:
Post a Comment