GATE entrance test Previous year papers

Can you give me question paper for Graduate Aptitude Test in Engineering Information Technology stream examination ?

[Kiran Chandar]

Here I am giving you question paper for Graduate Aptitude Test in Engineering Information Technology stream examination in a file attached with it so you can get it easily.

1. Consider an undirected random graph of eight vertices. The probability that there is an edge
between a pair of vertices is ½. What is the expected number of unordered cycles of length
three?
(A) 1/8 (B) 1 (C) 7 (D) 8
Answer:-(C)

2. Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.
(A) P only (B) Q only
(C) Both P and Q (D) Neither P nor Q
Answer:- (C)

5. Which one of the following expressions does NOT represent exclusive NOR of x and y?
(A) xy x 'y' + (B) x y' Å (C) x ' y Å (D) x ' y' Å
Answer: -(D)

6. 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)

7. What is the time complexity of Bellman-Ford single-source shortest path algorithm on a
complete graph of n vertices?
(A) ( ) 2 n Q (B) ( ) 2 n log n Q (C) ( ) 3 n Q (D) ( ) 3 n log n Q
Answer:-(C)

8. 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)
Exp:- 1. Cycle detection using DFS: 2 O(V E) O(V ) + = and it is polynomial problem
2. Every P-problem is NP( ) since P NP Ì
3. NP complete NP − Î
Hence, NP-complete can be solved in non-deterministic polynomial time

9. 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)
Exp:- (1) NTM @ DTM
(2) RELs are closed under union & but not complementation
(3) Turing decidable languages are recursive and recursive languages are closed under
intersection and complementation
(4) RELs are closed under union & intersection but not under complementation
|CS-GATE-2013 PAPER|
India’s No.1 institute for GATE Training 1 Lakh+ Students trained till date 65+ Centers across India
4

10. 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)

11. 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)
Exp:- Clustered index is built on ordering non key field and hence if the index is clustered then the
data records of the file are organized in the same order as the data entries of the index.

12. 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