www.LearnEngineering.

in

No part of this publication may be reproduced or distributed in any form or any means, electronic, mechanical,
photocopying, or otherwise without the prior permission of the author.

n
n g.i
GATE SOLVED PAPER
Computer Science Engineering
2013
e eri
gin
Copyright © By NODIA & COMPANY
En
arn

Information contained in this book has been obtained by authors, from sources believes to be reliable. However,
neither Nodia nor its authors guarantee the accuracy or completeness of any information herein, and Nodia nor its
authors shall be responsible for any error, omissions, or damages arising out of use of this information. This book
is published with the understanding that Nodia and its authors are supplying information but are not attempting
.Le

to render engineering or other professional services.

w
ww

NODIA AND COMPANY

B-8, Dhanshree Tower Ist, Central Spine, Vidyadhar Nagar, Jaipur 302039
Ph : +91 - 141 - 2101150
www.nodia.co.in
email : [email protected]

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS

2013

Q. 1 - Q. 25 carry one mark each.

Q. 1 A binary operation 5 on a set of integers is defined as x 5 y x2 =y2 . Which
+ one

n
of the following statements is TRUE about 5?
(A) Commutative but not associative (B) Both commutative and associative

g.i
(C) Associative but not commutative (D) Neither commutative nor associative

Q. 2 Suppose p is the number of cars per minute passing through a certain road

n
junction between 5 PM and 6 PM, and p has a Poisson distribution with mean 3.
What is the probability of observing fewer than 3 cars during any given minute
in this interval?
(A) 8/ ^2e3h
(C) 17/ ^2e3h
e eri (B) 9/ ^2e3h
(D) 26/ ^2e3h
gin
1 x x2
Q. 3 Which one of the following does NOT equal 1 y y2 ?
1 z z2
x ^x 1+h x 1+ 1+ x2 1+
En

1 1 x
(A) 1 y ^y 1+h y 1+ (B) 1 y 1+ y2 1+
1 z ^z 1+h z 1+ 1 z 1+ z2 1+
0 x y- x2 y-2 2 x y+ x2 y+2
arn

(C) 0 y z- y2 z-2 (D) 2 y z+ y2 z+2

1 z z2 1 z z2
Q. 4 The smallest integer that can be represented by an 8-bit number in 2’s complement
.Le

form is
(A) –256 (B) –128
(C) –127 (D) 0
w

Q. 5 In the following truth table, V =

1 if and only if the input is valid.
Inputs Outputs
ww

D0 D1 D2 D3 X0 X1 V
0 0 0 0 x x 0
1 0 0 0 0 0 1
x 1 0 0 0 1 1
x x 1 0 1 0 1
x x x 1 1 1 1
What function does the truth table represent?
(A) Priority encoder (B) Decoder
(C) Multiplexer (D) Demultiplexer

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

Q. 6 Which one of the following is the tightest upper bound that represents the number
of swaps required to sort n numbers using selection sort?
(A) O ^log n h (B) O ^n h
(C) O ^n log n h (D) O ^n2h

Q. 7 Which one of the following is the tightest upper bound that represents the time
complexity of inserting an object into a binary search tree of n nodes?
(A) O ^1 h (B) O ^log n h
(C) O ^n h (D) O ^n log n h

= and
F L2 "a , . Which one of the following represents
=

n
Q. 8 Consider the languages L1
L1 L*2 , L*1 ?

g.i
(A) " ,e (B) F
(C) a * (D) " , ae,

n
Q. 9 What is the maximum number of reduce moves that can be taken by a bottom-up
parser for a grammar with no epsilon- and unit-production (i.e., of type A " e

(A) n/2
(C) 2n 1-
e eri
and A " a ) to parse a string with n tokens?
(B) n 1-
(D) 2n
gin
Q. 10 A scheduling algorithm assigns priority proportional to the waiting time of a
process. Every process starts with priority zero (the lowest priority). The scheduler
re-evaluates the process priorities every T time units and decides the next process
to schedule. Which one of the following is TRUE if the processes have no I/O
En

operations and all arrive at time zero?

(A) This algorithm is equivalent to the first-come-first-serve algorithm.
(B) This algorithm is equivalent to the round-robin algorithm.
arn

(C) This algorithm is equivalent to the shortest-bob-first algorithm.

(D) This algorithm is equivalent to the shortest-remaining-time-first algorithm.

Q. 11 Match the problem domains in GROUP I with the solution technologies in

.Le

GROUP II.
GROUP I GROUP II
(P) Service oriented computing (1) Interoperability
w

(Q) Heterogeneous (2) BPMN

communicating systems
ww

(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

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

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

Q. 13 Using public key cryptography, X adds a digital signature M , encrypts M, s < >
, 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

n
private key followed by X ’s public key

g.i
Q. 14 Assume that source S and destination D are connected through two intermediate

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

e eri
(A) Network layer – 4 times and Data link layer – 4 times
gin
(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
En

Q. 15 An index is clustered, if
(A) it is on a set of fields that form a candidate key.
arn

(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
.Le

entries of the index.

Q. 16 Three concurrent processes X , Y , and Z execute three different code segments that
w

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
ww

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 h P ^b h P ^c h Y: P ^b h P ^c h P ^d h Z: P ^c h P ^d h P ^a h
(B) X: P ^b h P ^a h P ^c h Y: P ^b h P ^c h P ^d h Z: P ^a h P ^c h P ^d h
(C) X: P ^b h P ^a h P ^c h Y: P ^c h P ^b h P ^d h Z: P ^a h P ^c h P ^d h
(D) X: P ^a h P ^b h P ^c h Y: P ^c h P ^b h P ^d h Z: P ^c h P ^d h P ^a h

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

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

n
Q. 18 Which of the following statements are TRUE?

g.i
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

n
graph is in NP .

eri
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
e
(C) 2 and 3 only (D) 1 and 3 only
gin
Q. 19 What is the time complexity of Bellman-Ford single-source shortest path algorithm
on a complete graph of n vertices?
(A) ^Q n 2h (B) ^Q n2 log n h
(C) ^Q n 3h (D) ^Q n3 log n h
En

Q. 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+h. The main memory
arn

blocks are numbered 0 onwards. The main memory block mumbered j must be
mapped to any one of the cache lines from
(A) ^ j mod v h * k to ^ j mod v h * k ^k +1h -
.Le

(B) ^ j mod v h to ^ j mod v h ^k +1h -

(C) ^ j mod k h to ^ j mod k h ^v +1h -
(D) ^ j mod k h * v to ^ j mod k h * v ^v +1h -
w

Q. 21 Which one of the following expressions does NOT represent exclusive NOR of x
and y ?
ww

(A) xy x+'y ' (B) x 5 y '

(C) x ' 5 y (D) x ' 5 y '

Q. 22 Which one of the following functions is continuous at x =?

3
Z
]] 2, if x =3
4, if x = 3
(A) f ^x h =[ x 1-, if x > 3 (B) f ^x h *
=
] x +
3 , if x <
3 8 x- if x Y =
3
3
\
x 3+, if x # 3
*
(C) f ^x h = (D) f ^x h =3 1 , if x Y =
3
x 4-, if x > 3 x 27-

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

Q. 23 Function f is known at the following points:

x 0 0.3 0.6 0.9 1.2 1.5 1.8 2.1 2.4 2.7 3.0
f ^x h 0 0.09 0.36 0.81 1.44 2.25 3.24 4.41 5.76 7.29 9.00
3

The value of # f^x hdx computed using the trapezoidal rule is

0
(A) 8.983 (B) 9.003
(C) 9.017 (D) 9.045

Q. 24 Consider an undirected random graph of eight vertices. The probability that

there is an edge between a pair of vertices is 1/2. What is the expected number

n
of unordered cycles of length three?

g.i
(A) 1/8 (B) 1
(C) 7 (D) 8

n
Q. 25 Which of the following statements is/are TRUE for undirected graphs?
P: Number of odd degree vertices is even

(C) Both P and Q

e eri
Q: Sum of degrees of all vertices is even.
(A) P only (B) Q only
(D) Neither P nor Q
gin
Q. 26 to Q. 55 carry two marks each.
Q. 26 The line graph L ^G h of a simple graph G is defined as follows:
* There is exactly one vertex v ^e h in L ^G h for each edge e in G .
En

* For any two edges e and e ' in G , L ^G h has an edge between v ^e h and v ^e 'h,
if and only if e and e ' are incident with the same vertex in G .
arn

Which of the following statements is/are TRUE?

(P) The line graph of a cycle is a cycle.
(Q) The line graph of a clique is a clique.
(R) The line graph of a planar graph is planar.
.Le

(S) The line graph of a tree is a tree.

(A) P only (B) P and R only
(C) R only (D) P, Q and S only
w

Q. 27 What is the logical translation of the following statement?

ww

“None of my friends are perfect”

(A) 7x ^F ^x h / JP ^x hh (B) 7x ^JF ^x h / P ^x hh
(C) 7x ^JF ^x h / JP ^x hh (D) J7x ^F ^x h / P ^x hh

Q. 28 Consider the following sequence of micro-operations.

MBR ! PC
MAR ! X
PC ! Y
Memory ! MBR
Which one of the following is a possible operation performed by this sequence?
(A) Instruction fetch (B) Operand fetch
(C) Conditional branch (D) Initiation of interrupt service

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

Q. 29 Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders
(0-16383) and each cylinder contains 64 sectors (0-63). Data storage capacity
in each sector is 512 bytes. Data are organized cylinder-wise and the addressing
format is <cylinder no., surface no., sector no.>. A file of size 42797 KB is stored
in the disk and the starting disk location of the file is <1200, 9, 40>. What is
the cylinder number of the last sector of the file, if it is stored in a contiguous
manner?
(A) 1281 (B) 1282
(C) 1283 (D) 1284

^Q
log n h time using heap sort is

n
Q. 30 The number of elements that can be sorted in
^Q1h ^Q log n h

g.i
(A) (B)
log n
(C) cQloglog n m (D) ^Q
log n h

n
Q. 31 Consider the following function:

eri
int unknown (int n){
int i, j, k=0;
for (i=n/2; i<=n; i++)
for (j=2; j<=n; j=j*2)
e
k = k + n/2;
gin
return (k);
}
The return value of the function is
(A) ^Qn 2h (B) ^Q
n2 log n h
En

(C) ^Qn 3h (D) ^Q

n3 log n h

Q. 32 Consider the following languages.

arn

L1 $0 p 1q 0r p, q, r $ 0.
L2 $0 p 1q 0r p, q, r $ 0, p Y= r . =
Which one of the following statements is FALSE?
.Le

(A) L2 is context-free
(B) L1 + L2 is context-free
(C) Complement of L2 is recursive
w

(D) Complement of L1 is context-free but not regular.

Q. 33 Consider the DFA A given below.

ww

Which of the following are FALSE?

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

1. Complement of L ^Ah
2. L ^Ah L ^^11 * 0 =0h^0 1h * 0 * 1 *h + +
3. For the language accepted by A, A is the minimal DFA.
4. A accepts all strings over "0, 1, of length at least 2.
(A) 1 and 3 only (B) 2 and 4 only
(C) 2 and 3 only (D) 3 and 4 only

Q. 34 A shared variable x , initialized to zero, is operated on by four concurrent processes

W , X , Y , Z as follows. Each of the processes W and X reads x from memory,
increments by one, stores it to memory, and then terminates. Each of the processes

n
Y and Z reads x from memory, decrements by two, stores it to memory, and

g.i
then terminates. Each process before reading x invokes the P operation (i.e.,
wait) on a counting semaphore S and invokes the V operation (i.e., signal) on the
semaphore S after storing x to memory. Semaphore S is initialized to two. What

n
is the maximum possible value of x after all processes complete execution?
(A) –2 (B) –1

Q. 35
(C) 1
eri
Consider the following relational schema.
e (D) 2

Students(rollno: integer, sname: string)

gin
Courses(courseno: integer, cname: string)
Registration(rollno: integer, courseno: integer, percent: real)
Which of the following queries are equivalent to this query in English?
“Find the distinct names of all students who score more than 90% in the course
En

numbered 107”
(I) SELECT DISTINCT S.sname
FROM Students as S, Registration as R
WHERE R.rollno=S.rollno AND R.courseno=107 AND R.percent>90
arn

(II) P _ courseno
sname s > ^Registration A Studentshi
= / percent 90
107

(III) $T 7SdStudents,7RdRegistration ^S.rol ln o = R.rol ln o /

R.courseno 107 / R.percent > 90 / T.sname = S.snameh.
.Le

(IV) $ SN < 7SR 7RP> ^ SR, SN d Students

< / >
SR, 107, RP <d Registration / RP 90>h, >
(A) I, II, III and IV (B) I, II and III only
(C) I, II and IV only (D) II, III and IV only
w

Q. 36 Determine the maximum length of the cable (in km) for transmitting data at a
ww

rate of 500 Mbps in an Ethernet LAN with frames of size 10000 bits. Assume the
signal speed in the cable to be 200000 km/s .
(A) 1 (B) 2
(C) 2.5 (D) 5

Q. 37 In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total
length is 400 and the fragment offset value is 300. The position of the datagram,
the sequence numbers of the first and the last bytes of the payload, respectively
are
(A) Last fragment, 2400 and 2789 (B) First fragment, 2400 and 2759
(C) Last fragment, 2400 and 2759 (D) Middle fragment, 300 and 689

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

Q. 38 The following figure represents access graphs of two modules M1 and M2. The
filled circles represent methods and the unfilled circles represent attributes. If
method m is moved to module M2 keeping the attributes where they are, what
can we say about the average cohesion and coupling between modules in the
system of two modules?

n
g.i
(A) There is no change.
(B) Average cohesion goes up but coupling is reduced.

n
(C) Average cohesion goes down and coupling also reduces.

Q. 39
for 0 < i < n and b 6i @ =
eri
(D) Average cohesion and coupling increase.

A certain computation generates two arrays a and b such that a[i]=f(i)

g ^a 6i @h for 0 # i 1 n . Suppose this computation
e
is decomposed into two concurrent processes X and Y such that X computes
gin
the array a and Y computes the array b. The processes employ two binary
semaphores R and S , both initialized to zero. The array a is shared by the two
processes. The structures of the processes are shown below.
Process X : Process Y :
En

private i; private i;
for (i=0; i<n; i++) { for (i=0; i<n; i++){
a[i] = f(i); EntryY(R, S);
arn

ExitX(R, S); b[i] = g(a[i]);

} }

Which one of the following represents the CORRECT implementations of ExitX

.Le

and EntryY?
(A) ExitX(R, S) {
P(R);
V(S);
w

}
EntryY(R, S){
ww

P(S);
V(R);
}

(B) ExitX(R, S) {
V(R);
V(S);
}
EntryY(R, S){
P(R);
P(S);
}

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

(C) ExitX(R, S){

P(S);
V(R);
}
EntryY(R, S){
V(S);
P(R);
}
(D) ExitX(R, S){
V(R);

n
P(S);
}

g.i
EntryY(R, S){
V(S);
P(R);

n
}

eri
Q. 40 Consider the following two sets of LR(1) items of an LR(1) grammar.
X " c.X, c/d X " c.X, S
X " .cX, c/d X " .cX, S
e
X " .d, c/d X " .d, S
gin
Which of the following statements related to merging of the two sets in the
corresponding LALR parser is/are FALSE?
1. Cannot be merged since look aheads are different.
2. Can be merged but will result in S-R conflict.
En

3. Can be merged but will result in R-R conflict.

4. Cannot be merged since goto on c will lead to two different sets.
(A) 1 only (B) 2 only
arn

(C) 1 and 4 only (D) 1, 2, 3 and 4

Q. 41 Which of the following is/are undecidable?

1. G is a CFG. Is L ^G h =?F
.Le

2. G is a CFG. Is L ^G h = *S?
3. M is a Turing machine, Is L ^M h regular?
4. A is a DFA and N is an NFA. Is L ^Ah = L ^N h?
w

(A) 3 only (B) 3 and 4 only

(C) 1, 2 and 3 only (D) 2 and 3 only
ww

Q. 42 What is the return value of f(p,p), if the value of p is initialized to 5 before

the call? Note that the first parameter is passed by reference, whereas the second
parameter is passed by value.
int f (int &x, int c){
c = c - 1;
if (c==0) return 1;
x = x + 1;
return f(x,c) * x;
}
(A) 3024 (B) 6561
(C) 55440 (D) 161051

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

Q. 43 The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23,
39, 35, 42. Which one of the following is the postorder traversal sequence of the
same tree?
(A) 10, 20, 15, 23, 25, 35, 42, 39, 30
(B) 15, 10, 25, 23, 20, 42, 35, 39, 30
(C) 15, 20, 10, 23, 25, 42, 35, 39, 30
(D) 15, 10, 23, 25, 20, 35, 42, 39, 30

Q. 44 Consider the following operation along with Enqueue and Dequeue operations
on queues, where k is a global parameter.

n
MultiDequeue(Q){

g.i
m = k
while (Q is not empty) and (m > 0){
Dequeue(Q)

n
m = m - 1
}

eri
}
What is the worst case time complexity of a sequence of n queue operations on
an initially empty queue?
(A) ^Q nh
e
(B) ^Q n k+h
gin
(C) ^Q nk h
(D) ^Q n 2h
En

Q. 45 Consider an instruction pipeline with five stages without any branch prediction:
Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute
Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI
and WO are 5 ns , 7 ns , 10 ns , 8 ns and 6 ns , respectively. There are intermediate
arn

storage buffers after each stage and the delay of each buffer is 1 ns . A program
consisting of 12 instructions I1 , I2 , I 3 , ..., I12 is executed in this pipelined processor.
Instruction I 4 is the only branch instruction and its branch target is I 9 . If the
branch is taken during the execution of this program, the time (in ns) needed to
.Le

complete the program is

(A) 132 (B) 165
(C) 176 (D) 328
w

Q. 46 A RAM chip has a capacity of 1024 words of 8 bits each ^1K # 8h. The number
of 2 # 4 decoders with enable line needed to construct a 16 K # 16 RAM from
ww

1 K # 8 RAM is
(A) 4 (B) 5
(C) 6 (D) 7

Q. 47 Which one of the following is NOT logically equivalent to J7x ^6y ^ h / 6z ^ ahh b
(A) 6x ^7z ^J h " 6y ^ bhh a
(B) 6x ^6z ^ h " 7y ^J bhh a
(C) 6x ^6y ^ h " 7z ^J ahh b
(D) 6x ^7y ^J h " 7z ^J ahh b

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

Common Data Questions

Common Data For Q. 48 and 49 :

The following code segment is executed on a processor which allows only register operands
in its instructions. Each instruction can have atmost two source operands and one
destination operand. Assume that all variables are dead after this code segment.
c = a + b;
d = c * a;
e = c + a;

n
x = c * c;

g.i
if (x > a){
y = a * a;
}

n
else {
d = d * d;

eri
e = e * e;
}
Q. 48 Suppose the instruction set architecture of the processor has only two registers.
e
The only allowed compiler optimization is code motion, which moves statements
gin
from one place to another while preserving correctness. What is the minimum
number of spills to memory in the compiled code?
(A) 0 (B) 1
(C) 2 (D) 3
En

Q. 49 What is the minimum number of registers needed in the instruction set architecture
of the processor to compile this code segment without any spill to memory? Do
not apply any optimization other than optimizing register allocation.
arn

(A) 3 (B) 4
(C) 5 (D) 6
.Le

Common Data For Q. 50 and 51 :

The procedure given below is required to find and replace certain characters inside an
input character string supplied in array A. The characters to be replaced are supplied in
w

array oldc, while their respective replacement characters are supplied in array newc.
Array A has a fixed length of five characters, while arrays oldc and newc contain three
ww

characters each. However, the procedure is flawed.

void find and_replace (char *A, char *oldc, char *newc) {
for (int i=0; i<5; i++)
for (int j=0; j<3; J++)
if (A[i] == oldc[j]) A[i] = newc[j];
}
The procedure is tested with the following four test case.
(1) oldc = “abc”, newc = “dab”
(2) oldc = “cde”, newc = “bcd”
(3) oldc = “bca”, newc = “cda”
(4) oldc = “abc”, newc = “bac”

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

Q. 50 The tester now tests the program on all input strings of length five consisting
of characters ‘a’, ‘b’, ‘c’ and ‘e’ with duplicates allowed. If the tester
carries out this testing with the four test cases given above, how many test case
will be able to capture the flaw?
(A) Only one (B) Only two
(C) Only three (D) All four

Q. 51 If array A is made to hold the string “abcde”, which of the above four sest cases
will be successful in exposing the flaw in this procedure?
(A) None (B) 2 only

n
(C) 3 and 4 only (D) 4 only

g.i
Linked Answer Questions

n
Statement For Linked Q. 52 and 53 :

eri
A computer uses 46-bit virtual address, 32-bit physical address, and a three-level paged
page table organization. The page table base register stores the base address of the
first-level table ^T1h, which occupies exactly one page. Each entry of T1 stores the base
e
address of a page of the second-level table ^T2h. Each entry of T2 stores the base address
gin
of a pae of the third-level table ^T3h. Each entry of T3 stores a page table entry (PTE).
The PTE is 32 bits in size. The processor used in the computer has a 1 MB 16-way set
associative virtually indexed physically tagged cache. The cache block size is 64 bytes.
En

Q. 52 What is the size of a page in KB in this computer?

(A) 2 (B) 4
(C) 8 (D) 16
arn

Q. 53 What is the minimum number of page colours needed to guarantee that no two
synonyms map to different sets in the processor cache of this computer?
(A) 2 (B) 4
.Le

(C) 8 (D) 16

Statement For Linked Q. 54 and 55 :

w

Relation R has eight attributes ABCDEFGH . Fields of R contain only atomic values.
F = "CH " G, A " BC, B " CFG, E " A, F " EG , is a set of functional dependencies
ww

(FDs) so that F +is exactly the set of FDs that hold for R.
Q. 54 How many candidate keys does the relation R have?
(A) 3 (B) 4
(C) 5 (D) 6

Q. 55 The relation R is
(A) in 1 NF , but not in 2 NF
(B) in 2 NF , but not in 3 NF
(C) in 3 NF , but not in BCNF
(D) in BCNF

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

General Aptitude (GA) Questions

Q. 56 to Q. 60 carry one mark each.

Q. 56 Which one of the following options is the closest in meaning to the word given
below?
Nadir
(A) Highest
(B) Lowest

n
(C) Medium

g.i
(D) Integration

Q. 57 Complete the sentence:

Universalism is to particularism as diffuseness is to ________.

n
(A) specificity

eri
(B) neutrality
(C) generality
(D) adaptation
e
Q. 58 What will be the maximum sum of 44, 42, 40, ....?
gin
(A) 502 (B) 504
(C) 506 (D) 500

Q. 59 Were you a bird, you ________ in the sky.

En

(A) would fly (B) shall fly

(C) should fly (D) shall have flown
arn

Q. 60 Choose the grammatically INCORRECT sentence:

(A) He is of Asian origin
(B) They belonged to Africa
(C) She is an European
.Le

(D) They migrated from India to Australia

Q. 61 to Q. 65 carry two marks each.

w

Q. 61 Find the sum of the expression

ww

1 + 1 + 1 ... + 1 +
1 +2 2 +3 3 +4 80 +81
(A) 7 (B) 8
(C) 9 (D) 10

Q. 62 Out of all the 2-digit integers between 1 and 100, a 2-digit number has to be
selected at random. What is the probability that the selected number is not
divisible by 7?
(A) 13/90 (B) 12/90
(C) 78/90 (D) 77/90

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

Q. 63 After several defeats in wars, Robert Bruce went in exile and wanted to commit
suicide. Just before committing suicide, he came across a spider attempting
tirelessly to have its net. Time and again, the spider failed but that did not deter
it to refrain from making attempts. Such attempts by the spider made Bruce
curious. Thus, Bruce started observing the near-impossible goal of the spider to
have the net. Ultimately, the spider succeeded in having its net despite several
failures. Such act of the spider encouraged Bruce not to commit suicide. And
then, Bruce went back again and won many a battle, and the rest is history.
Which one of the following assertions is best supported by the above information?
(A) Failure is the pillar of success

n
(B) Honesty is the best policy

g.i
(C) Life begins and ends with adventures
(D) No adversity justifies giving up hope

Q. 64 A tourist covers half of his journey by train at 60 km/h , half of the remainder

n
by bus at 30 km/h and the rest by cycle at 10 km/h . The average speed of the

eri
tourist in km/h during his entire journey is
(A) 36 (B) 30
(C) 24 (D) 18
e
Q. 65 The current erection cost of a structure is Rs 13200. If the labour wages per day
gin
increase by 1/5 of the current wages and the working hours decrease by 1/24 of
the current period, then the new cost of erection in Rs. is
(A) 16500 (B) 15180
En

(C) 11000 (D) 10120

arn

**********
w .Le
ww

www.LearnEngineering.in
 www.LearnEngineering.in

GATE SOLVED PAPER - CS 2013

ANSWER KEY
2013
1 2 3 4 5 6 7 8 9 10
(A) (C) (A) (B) (A) (B) (C) (A) (C) (B)
11 12 13 14 15 16 17 18 19 20
(C) (C) (D) (C) (C) (B) (C) (A) (C) (B)
21 22 23 24 25 26 27 28 29 30
(D) (A) (D) (C) (C) (B) (D) (D) (D) (A)

n
31 32 33 34 35 36 37 38 39 40

g.i
(B) (D) (D) (D) (A) (B) (C) (B) (B) (D)
41 42 43 44 45 46 47 48 49 50
(D) (B) (D) (C) (C) (B) (A) (C) (B) (B)

n
51 52 53 54 55 56 57 58 59 60
(C)
61
(B)
(B)
62
(D)
(*)
63
(D)
(B)
64
(C)
(A)
65
(B)
e eri
(B) (A) (C) (A) (C)
gin
En
arn
w .Le
ww

www.LearnEngineering.in