Wednesday, 19 November 2014

GATE Computer Science and Information Technology Solved Paper 2013 - Part 2

11.       Match the problem domains in Group I with the solution technologies in Group II.
Group I                                                  Group II
(P) Services oriented computing                  (1) Interoperability
(Q) Heterogeneous communicating
systems                                                          (2) BPMN
(R) Information representation                      (3) Publish-find bind
(S) Process description                                  (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 protocols 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 labelled 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 processes 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 operations 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
17.       Which of the following statements is/are FALSE?
(1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine.
(2) Turing recognizable languages are closed under union and complementation.
(3) Turing decidable languages are closed under intersection and complementation
(4) Turing recognizable languages are closed under union and intersection.
(A) 1 and 4 only           (B) 1 and 3 only
(C) 2 only                      (D) 3 only
Answer: C
18.       Which of the following statements are TRUE?
(1) The problem of determining whether there exists a cycle in an undirected graph is in P.
(2) The problem of determining whether there exists a cycle in an undirected graph is in NP.
(3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
(A) 1, 2 and 3                (B) 1 and 2 only
(C) 2 and 3 only           (D) 1 and 3 only
Answer: A
19.       What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices ?
(A) Θ(n2)            (B) Θ(n2logn)           
(C) Θ(n3)            (D) Θ(n3logn)
Answer: C
20.    In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a set are placed in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. The main memory block numbered j must be mapped to any one of the cache lines from
(A) (j mod v)*k to (j mod v)*k+(k−1)
(B) (j mod v) to (j mod v)+(k−1)
(C) (j mod k) to (j mod k)+(v−1)
(D) (j mod k)*v to (j mod k)*v+(v−1)
Answer: A


0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App