GATE-2015 AnswerKeys

:2:
GATE 2015_ Afternoon Session
GATE 2015
Computer Science & Information Technology (CSIT)
DATE: 07/02/2015
01.
01.
02.
02.
03.
03.
04.
04.
Choose the statement where underlined

word is used correctly.
(A) The industrialist had a personnel jet.
(B) I write my experience in my personnel
diary.
(C) All personnel are being given the day
off.
(D) Being religious is a personnel aspect.
Ans: (C)
Consider a function f(x) = 1|x| on 1x 1.
The value of x at which the function attains
a maximum, and the maximum value of the
function are:
(A) 0, 1 (B) 1, 0 (C) 0, 1 (D) 1, 2
Ans: (C)
We ________ our friends birthday and we
________ how to make it up to him.
(A) completely forget dont just know
(B) forgot completely dont just know
(C) completely forget just dont know
(D) forgot completely just dont know
Ans: (C)
A generic term that includes various items
of clothing such as a skirt, a pair of trousers
and a shirt is
(A) fabric
(B) textile
(C) fibre
(D) apparel
Ans: (D)
ACE Engineering Academy
Time: 2:00 PM - 5:00 PM

05.
05.
06.
06.
07.
Based on the given statements, select the

most appropriate option to solve the given
question.
What will be the total weight of 10 poles
each of same weight?
Statements:
(I) One fourth of the weight of a pole is 5
Kg.
(II) The total weight of these poles is 160 kg
more than the total weight of two poles.
(A) Statement I alone is not sufficient.
(B) Statement II alone is not sufficient.
(C) Either I or II is sufficient.
(D) Both statements I and II together are not
sufficient.
Ans: (C)
If the list of letters, P, R, S, T, U is an
arithmetic sequence, which of the following
are also in arithmetic sequence?
I. 2P, 2R, 2S, 2T, 2U
II. P3, R3, S3, T3, U3
III. P2, R2, S2, T2, U2
(A) I only
(B) I and II
(C) II and III
(C) I and III
Ans: (B)
In a triangle PQR, PS is the angle bisector
of QPR and QPS = 60. What is the
length of PS?
Hyderabad | New Delhi | Bhopal| Bengaluru | Bhubaneswar | Vijayawada | Visakhapatnam | Tirupati | Pune | Chennai
:3:
09.
P
r
q
s
(A)
(C)
07.
q r
(B)
qr
(D)
qr
q r
q r 2
qr
Ans: (B)
09.
08.
08.
Out of the following four sentences, select

the most suitable sentence with respect to
grammar and usage:
(A) Since the report lacked needed
information, it was of no use to them.
(B) The report was useless to them because
there were no needed information in it.
(C) Since the report did not contain the
needed information, it was not real
useful to them.
(D) Since the report lacked needed
information, it would not had been
useful to them.
Ans: (A)
10.
10.
If p, q, r, s are distinct integers such that:

f(p, q, r, s) = max(p, q, r, s)
g(p, q, r, s) = min(p, q, r, s)
h(p, q, r, s) = remainder of (pq)/(rs) if
(pq)> (rs) or remainder of (rs)/(pq) if
(rs) > (pq)
Also a function fgh(p, q, r, s) = f(p, q, r, s)
g(p, q, r, s) h(p, q, r, s)
Also the same operations are valid with two
variable functions of the form f(p, q).
What is the value of fg(h(2,5,7,3), 4,6,8)?
Ans: 1
Four branches of company are located at M,
N, O, and P. M is north of N at a distance of
4 km; P is south of O at a distance of 2 km;
N is southeast of O by 1 km. What is the
distance between M and P in km?
(A) 5.34 (b) 6.74
(c) 28.5
(d) 45.49
Ans: (A)
:4:
:5:
01.
01.
The number of divisors of 2100 is _____.

Ans: 36
02.
Consider the following C function.

int fun(int n)

05.
06.
Ans: (A)
With reference to the B+ tree index of order
1 shown below, the minimum number of
nodes (including the Root node) that must
be fetched in order to satisfy the following
query: Get all records a search key greater
than or equal to 7 and less than 15 is ____.
{
int x = 1, k;
if (n = = 1) return x;
for (k =1; k<n; ++k)
x = x + fun(k) * fun(nk);
return x;
02.
03.
03.
04.
04.
05.
}
The return value of fun(5) is _____.
Ans: 51
An unordered list contains n distinct
elements. The number of comparisons to
find an element in this list that is neither
maximum nor minimum is
(A) O(n log n)
(B) O(n)
(C) O(log n)
(D) O(1)
Ans: (D)
The cardinality of the power set of
{0, 1, 2,, 10} is _______.
Ans: 2048
Consider two decision problems Q1, Q2
such that Q1 reduces in polynomial time to
3SAT and 3SAT reduces in polynomial
time to Q2. Then which one of the following
is consistent with the above statement?
(A) Q1 is in NP, Q2 is NP hard.
(B) Q2 is in NP, Q1 is NP hard.
(C) Both Q1 and Q2 in NP.
(D) Both Q1 and Q2 are NP hard.
9
5
1
13 17
5
9 11
13 15
17
06.
Ans: 5
07.
Consider a complete binary tree where the

left and the right subtrees of the root are
max-heaps. The lower bound for the
number operations to convert the tree to a
heap is
(A) (log n)
(B) (n)
(C) (n log n)
(D) (n2)
Ans: (A)
07.
08.
08.
Assume that for a certain processor, a read

request takes 50 nanoseconds on a cache
miss and 5 nanoseconds on a cache hit.
Suppose while running a program, it was
observed that 80% of the processors read
requests result in a cache hit. The average
read access time in nanoseconds is ______.
Ans: 14
09.
A link has a transmission speed of 106

bits/sec. It uses data packets of size 1000
bytes
each.
Assume
that
the
:6:
acknowledgement
has
negligible

11.
transmission delay, and that its propagation

delay is the same as the data propagation
delay. Also assume that the processing
delays
at
nodes
are
negligible.
The
efficiency of the stop-and-wait protocol in
11.
this setup is exactly 25%. The value of the
12.
one-way propagation delay(in milliseconds)

is _______.
09.
Ans: 12
10.
Consider
the
following
transaction
involving two bank accounts x and y.

read(x); x : = x50; write(x); read(y);
y:=y+50; write(y)
The constraint that the sum of the accounts
x and y should remain constant is that of
10.
(A) Atomicity
(C) Isolation
Ans: (B)
(B) Consistency
(D) Durability
12.
A software requirements specification

(SRS) document should avoid discussing
which one of the following?
(A) User interface issues
(B) Non-functional requirements
(C) Design specification
(D) Interfaces with third party software
Ans: (C)
Consider the following function written in
the C programming languages.
void foo(char *a)
{
if(*a && *a != )
{
foo(a+1);
putchar(*a);
}
}
The output of the above function on input
ABCD EFGH is
(A) ABCD EFCH
(B) ABCD
(C) HGFE DCBA
(D) DCBA
Ans: (D)
:7:
13.
13.
14.
14.
15.
15.
16.
A system has 6 identical resources and N

processes competing for them. Each process
can request atmost 2 resources. Which one
of the following values of N could lead to a
deadlock?
(A) 1
(B) 2
(C) 3
(D) 4
Ans: (*)
Consider the basic COCOMO model where
E is the effort applied in person-months, D
is the development time in chronological
months, KLOC is the estimated number of
delivered lines of code(in thousands) and ab,
bb, cb, db have their usual meanings. The
basic COCOMO equations are of the form
(A) E=ab(KLOC) exp(bb), D = cb (E)exp(db)
(B) D=ab(KLOC) exp(bb), E=cb(D) exp(db)
(C) E=ab exp(bb), D = cb(KLOC) exp(db)
(D) E=ab exp(db), D=cb(KLOC) exp(bb)
Ans: (A)
Identify the correct order in which a server
process must invoke the function calls
accept, bind, listen, and recv according to
UNIX socket APL.
(A) listen, accept, bind, recv
(B) bind, listen, accept, recv
(C) bind, accept, listen, recv
(D) accept, listen, bind, recv
Ans: (B)
In the context of abstract-systax-tree (AST)
and control-flow-graph (CFG), which one
of the following is TRUE?
(A) In both AST and CFG, let node N2 be
the successor of node N1. In the input
16.
17.
17.
18.
18.
19.
19.
program, the code corresponding to N2

is present after the code corresponding
to N1
(B) For any input program, neither AST nor
CFG will contain a cycle
(C) The maximum number of successors of
a node in an AST and a CFG depends
on the input program
(D) Each node in AST and CFG corresponds
to at most one statement in the input
program.
Ans: (C)
A binary tree T has 20 leaves. The number
of nodes in T having two children is _____.
Ans: 19
A computer system implements a 40-bit
virtual address, page size of 8 kilobytes, and
a 128-entry translation look-aside buffer
(TLB) organized into 32 sets each having
four ways. Assume that the TLB tag does
not store any process id. The minimum
length of the TLB tag in bits is _______.
Ans: 22
Match the following:
List I
List II
P. Lexical analysis
1. Graph coloring
Q. Parsing
2. DFA minimization
R. Register allocation 3. Post-order traversal
S. Expression evaluation 4. Production tree
(A) P-2, Q-3, R-1, S-4
(B) P-2, Q-1, R-4, S-3
(C) P-2, Q-4, R-1, S-3
(D) P-2, Q-3, R-4, S-1
Ans: (C)
:8:
:9:
20.
20.
Which one of the following statements is

NOT correct about HTTP cookies?
(A) A cookie is a piece of code that has the
potential to compromise the security of
an Internet user
(B) A cookie gains entry to the users work
area through an HTTP header
(C) A cookie has an expiry date and time
(D) Cookies can be used to track the
browsing pattern of a user at a particular
site
Ans: (B)

23.
23.
21.
The larger
4
matrix
2
of the two eigenvalues of the

5
is _____.
1
21.
Ans: 6
22.
Consider the following two statements.

S1: If a candidate is known to be corrupt,
then he will not be elected
S2: If a candidate is kind, he will be elected
Which one of the following statements
follows from S1 and s2 as per sound
inference rules of logic?
22.
(A) If a person is known to be corrupt, he is

kind
(B) If a person is not known to be corrupt,
he is not kind
(C) If a person is kind, he is not known to be
corrupt
(D) If a person is not kind, he is not known
to be corrupt
Ans: (C)
24.
24.
25.
25.
26.
Let R be the relation on the set of positive

integers such that aRb if and only if a and b
distinct and have a common divisor other
than 1. Which one of the following
statements about R is true?
(A) R is symmetric and reflexive but not
transitive
(B) R is reflexive but not symmetric and not
transitive
(C) R is transitive but not reflexive and not
symmetric
(D) R is symmetric but not reflexive and not
transitive
Ans: (D)
Consider the following statements.
I. The complement of every Turing
decidable language is Turing decidable
II. There exists some language which is in
NP but is not Turing decidable
III. If L is a language in NP, L is Turing
decidable
Which of the above statements is/are true?
(A) Only II
(B) Only III
(C) Only I and II
(D) Only I and III
Ans: (D)
The minimum number of JK flip-flops
required to construct a synchronous counter
with the count sequence (0, 0, 1, 1, 2, 2, 3,
3, 0, 0,.) is _______.
Ans: 2
The secant method is used to find the root
of an equation f(x) = 0. It is started from
two distinct estimates xa and xb for the root.
It is an iterative procedure involving linear
interpolation to a root. The iteration stops if
f(xb) is very small and then xb is the
: 10 :
solution. The procedure is given below.

Observe that there is an expression which is
missing and is marked by? Which is the
suitable expression that is to be put in place
of ? so that it follows all steps of the secant
method?
Secant
Initialize: xa, xb, , N
128.96.164.0
0.0.0.0
Group I
(i) 128.96.171.92
(ii) 128.96.167.151
(iii) 128.96.163.151
(iv) 128.96.165.121
// N = maximum number of iterations

fb =f(xb)
i=0
while (i < N and |fb| > ) do
27.
28.
if |fb| > then // loop is terminated with i=N
26.
27.
write Non-convergence
else
write return xb
end if
(A) xb (fb f(xa)) fb/ (xb xa)
(B) xa (fa f(xa)) fa/ xb xa)
(C) xb (xb xa)fb/ (fb f(xa))
(D) xa (xb xa) fa/ (fb f(xa))
Ans: (C)
Consider the following routing table at an
IP router.
Network No.
128.96.170.0
128.96.168.0
128.96.166.0
Net Mask
255.255.254.0
255.255.254.0
255.255.254.0
Next Hop
Interface 0
Interface 1
R2
R3
R4
For each IP address in Group I identify the

correct choice of the next hop form Group II
using the entries from the routing table
above.
// = convergence indicator
i = i + 1 // update counter
xt = ? // missing expression for
xa = xb
xb = xt // intermediate value
fb = f(xb) // function value at new xb
end while
255.255.252.0
Default
28.
29.
29.
Group II
(a) Interface 0
(b) Interface 1
(c) R2
(d) R3
(e) R4
(A) i-a, ii-c, iii-e, iv-d

(B) i-a, ii-d, iii-b, iv-e
(C) i-b, ii-c, iii-d, iv-e
(D) i-b, ii-c, iii-e, iv-d
Ans: (A)
Consider two relations R1(A,B) with the
tuples(1, 5), (3, 7) and R2(A, C) = (1, 7),
(4, 9). Assume that R(A,B,C) is the full
natural outer join of R1 and R2. Consider the
following tuples of the form (A, B, C):
a =(1, 5, null), b=(1, null, 7), c = (3, null, 9),
d = (4, 7, null), e = (1, 5, 7), f = (3, 7, null),
g = (4, null, 9). Which one of the following
statements is correct?
(A) R contains a, b, e, f, g but not c, d.
(B) R contains all of a, b, c, d, e, f, g.
(C) R contains e, f, g but not a, b.
(D) R contains e but not f,g.
Ans: (C)
The number of states in the minimal
deterministic
finite
automaton
corresponding to the regular expression
(0 + 1) * (10) is _______.
Ans: 3
: 11 :
30.
Which one of the following well formed

formulae is a tautology?
(A) x y R(x, y) x R(x, y)
(B) x [y R(x,y) S(x,y)]) xyS(x,y)
(C) [xy (P(x,y) R(x,y)] [xy

32.
( P(x,y) R(x,y)]
30.
31.
31.
(D) xy P(x,y) xyP(y,x)

Ans: (D)
Consider the C program below.
#include <stdio.h>
int *A, stkTop;
int stkFunC(int opcode, int val)
{
static int size = 0, stkTop = 0;
switch (opcode)
{
case 1: size = val; break;
case 0: if(stkTop < size) A[stkTop++]=
val; break;
default: if (stkTop) return A[ stkTop];
}
return 1;
}
int main( )
{
int B[20]; A = B; stkTop = 1;
stkFunc(1, 10);
stkFunc(0, 5);
stkFunc(0, 10);
printf(%d\n, stkFunc(1,0)+stkFun(1,0);
}
The value printed by the above program is
______.
Ans: 2
32.
33.
33.
34.
34.
35.
Which one of the following hash functions

on integers will distribute keys most
uniformly over 10 buckets numbered 0 to 9
for i ranging from 0 to 2020?
(A) h(i) = i2 mod 10
(B) h(i) = i3 mod 10
(C) h(i) = (11 * i2) mod 10
(D) h(i) = (12 * i) mod 10
Ans: (B)
Consider the alphabet = {0, 1}, the
null/empty string and the sets of strings
X0, X1, and X2 generated by the
corresponding non-terminals of a regular
grammar X0, X1, and X2 are related as
follows.
X0 = 1 X1
X1 = 0 X1 + 1 X2
X2 = 0 X1 + {}
Which one of the following choices
precisely represents the strings in X0?
(A) 10(0*+(10)*)1
(B) 10(0*+(10*)*1
(C) 1(0+10)*1
(D) 10(0+10)*1+110(0+10)*1
Ans: (C)
The number of min-term after minimizing
the following Boolean expression is _____.
[D1+ AB1 + A1C + AC1D + A1C1D]1
Ans: 1
Consider the intermediate code given
below.
(1) i = 1
(2) j = 1
(3) t1 = 5 * i
: 12 :
35.
36.
36.
(4) t2 = t1+ j
(5) t3 = 4 * t2
(6) t4 = t3
(7) a[t4] = 1
(8) j = j + 1
(9) if j < = 5 goto (3)
(10) i = i + 1
(11) if i < 5 goto (2)
The number of nodes and edges in the
control-flow-graph constructed for the
above code, respectively, are
(A) 5 and 7
(B) 6 and 7
(C) 5 and 5
(D) 7 and 8
Ans: (B)
37.
Which one of the following assertions

concerning code inspection and code
walkthrough is true?
(A) Code inspection is carried out once the
code has been unit tested
(B) Code inspection and code walkthrough
are synonyms
(C) Adherence to coding standards is
checked during code inspection
(D) Code walkthrough is usually carried out
by an independent test team
Ans: (C)
39.
37.
38.
38.
39.
The number of onto functions (surjective

functions) from set X = {1, 2, 3, 4,} to set Y
= {a, b, c} is _______.
Ans: 36
A graph is self-complementary if it is
isomorphic to its complement. For all selfcomplementary graphs on n vertices, n is
(A) A multiple of 4
(B) Even
(C) Odd
(D) Congruent to 0 mod 4, 1 mod 4.
Ans: (D)
Perform the following operations on the
3 4 45
maxtrix 7 9 105
13 2 195
(i) Add the third row to the second row
(ii) Subtract the third column from the first
column.
The determinant of the resultant matrix is
_______.
Ans: 0
: 13 :
40.
40.
41.
41.
Assume that the bandwidth for a TCP

connection is 1048560 bits/sec. Let be the
value of RIT in milliseconds (rounded off to
the nearest integer) after which the TCP
window scale option is needed. Let be the
maximum possible window size with
window scale option. Then the values of
and are
(A) 63 milliseconds, 65535 214
(B) 63 milliseconds, 65535 216
(C) 500 milliseconds, 65535 214
(D) 500 milliseconds, 65535 216
Ans: (C)
Let f(x) = x(1/3) and A denote the area of the
region bounded by f(x) and the Xaxis,
when x varies from 1 to 1. Which of the
following statements is/are TRUE?
I. f is continuous in [1, 1]
II. f is not bounded in [1, 1]
III. A is nonzero and finite
(A) II only
(B) III only
(C) II and III only
(D) I, II and III
Ans: (C)
42.
43.
43.
42.
Consider the sequence of machine

instructions given below.
MUL R5, R0, R1
DIV R6, R2, R3
ADD R7, R5, R6
SUB R8, R7, R4
In the above sequence, R0 to R8 are general
purpose registers. In the instruction shown,
the first register stores the result of the
operation performed on the second and the
third registers. This sequence of instructions
44.
44.
is to be executed in a pipelined instruction

processor with the following 4 stages: (1)
Instruction Fetch and Decode(IF), (2)
Operand Fetch (OF), (3) Perform
Operation(PO) and (4) Write back the result
(WB). The IF, OF and WB stages take 1
clock cycle each for any instruction and 5
clock cycles for DIV instruction. The
pipelined
processor
uses
operand
forwarding from the PO stage to the OF
stage. The number of clock cycles taken for
the execution of the above sequence of
instructions is _________.
Ans: 13
Which of the following languages is/are
regular?
L1:{wxwR|w, x {a,b}* and |w|, |x| > 0},
wR is the reverse of string w
L2: {anbm | m n and m, n 0}
L3: {apbqcr | p, q, r 0}
(A) L1 and L3 only
(C) L2 and L3 only
Ans: (A)
(B) L2 only
(D) L3 only
Consider a typical disk that rotates at

150000 rotations per minute (RPM) and has
a transfer rate of 50106 bytes/sec. If the
average seek time of the disk is twice the
average rotation delay and the controllers
transfer time is 10 times the disk transfer
time, the average time(in milliseconds) to
read or write a 512-byte sector of the disk is
_____.
Ans: 6.1
: 14 :
45.
45.
46.
46.
47.
47.
48.
A computer system implements 8 kilobyte

pages and a 32-bit physical address space.
Each page table entry contains a valid bit, a
dirty bit, three permission bits, and the
translation. If the maximum size of the page
table of a process is 24 magabytes, the
length of the virtual address supported by
the system is _______ bits.
Ans: 36
48.
49.
Consider six memory partitions of sizes 200

KB, 400KB, 600 KB, 500 KB, 300 KB and
250 KB, where KB refers to kilobyte. These
partitions need to be allotted to four
processes of sizes 357 KB, 210 KB, 468 KB
and 491 KB in that order. If the best fit
algorithm is used, which partitions are NOT
allotted to any process?
(A) 200 KB and 300 KB
(B) 200 KB and 250 KB
(C) 250 KB and 300 KB
(D) 300 KB and 400 KB
Ans: (A)
Let X and Y denote the sets containing 2
and 20 distinct objects respectively and F
denote the set of all possible functions
defined from X to Y. Let f be randomly
chosen from F. The probability of f being
one-to-one is ________.
Ans: 19/20 (or) 0.95
Host A sends a UDP datagram containing
8880 bytes of user data to host B over an
Ethernet LAN. Ethernet frames may carry
data up to 1500 bytes (i.e. MTU = 1500
bytes).Size of UDP header is 8 bytes and
size of IP header is 20 bytes. There is no
49.
option field in IP header. How many total

number of IP fragments will be transmitted
and what will be the contents of offset field
in the last fragment?
(A) 6 and 925
(b) 6 and 7400
(C) 7 and 1110
(d) 7 and 8880
Ans: (A)
Consider a processor with byte-addressable
memory. Assume that all registers,
including Program Counter (PC) and
Program Status Word (PSW), are of size 2
bytes. A stack in the main memory is
implemented from memory location
(0100)16 and it grows upward. The stack
pointer(SP) points to the top element of the
stack. The current value of SP is (016E)16.
The CALL instruction is of two words, the
first is the op-code and the second word is
the starting address of the subroutine(one
word = 2 bytes). The CALL instruction is
implemented as follows.
Store the current value of PC in the
stack
Store the value of PSW register in the
stack
Load the starting address of the
subroutine in PC
The content of PC just before the fetch of
CALL instruction is (5FA0)16. After
execution of the CALL instruction, the
value of the stack pointer is
(A) (016A)16
(B) (016C)16
(C) (0170)16
(D) (0172)16
Ans: (D)
: 15 :
50.
Suppose you are provided with the

following function declaration in the C
programming language.
int partition(int a[ ], int n);
The function treats the first element of a[ ]
as s pivot, and rearranges the array so that
all elements less than or equal to the pivot is
in the left part of the array, and all elements
greater than the pivot is in the right part. In
addition, it moves the pivot so that the pivot
is the last element of the left part. The return
value is the number of elements in the left
part.
The following partially given function in the
C programming language is used to find the
kth smallest element in an array a[ ] of size
n using the partition function. We assume k
n.
int kth_smallest(int a[ ], int n, int k)
50.
51.
If a crash happens now the system tries to

recover using both undo and redo
operations, what are the contents of the
undo list and the redo list?
{
int left_end = partition(a, n);
if (left_end+1 = =k)
{
Return a[left_end];
}
if(left_end+1) > k)
{
return kth_smallest(________);
}
else
51.
52.
{
return kth_smallest(________);
}
}
The missing argument lists are respectively
(A) (a, left_end, k) and (a+left_end+1,

nleft_end1, kleft_end1)
(B) (a, left_end, k) and (a, nleft_end1,
kleft_end1)
(C) (a+left_end+1,nleft_end1,
kleft_end1) and (a, left_end, k)
(D) (a, nleft_end1, kleft_end1) and
(a, left_end, k)
Ans: (A)
Consider a simple checkpointing protocol
and the following set of operations in the
log.
(start, T4); (write, T4, y, 2, 3); (start, T1);
(commit, T4); (write, T1, z, 5, 7);
(checkpoint);
(start, T2); (write, T2, x, 1, 9);
(commit, T2); (start, T3),
(write, T3, z, 7, 2);
52.
(A) Undo: T3, T1; Redo: T2)

(B) Undo: T3, T1; Redo: T2, T4
(C) Undo: none; Redo; T2, T4, T3, T1
(D) Undo: T3, T1, T4; Redo: T2)
Ans: (A)
A half adder is implemented with XOR and
AND gates. A full adder is implemented
with two half adders and one OR gate. The
propagation delay of an XOR gate is twice
that of and AND/OR gate. The propagation
delay of an AND/OR gate is 1.2
microseconds. A 4-bit ripple-carry binary
adder is implemented by using four full
adders. The total propagation time of this 4bit binary adder in microseconds is _____
Ans: 12
: 16 :
53.
53.
54.
In a connected graph, a bridge is an edge

whose removal disconnects a graph. Which
one of the following statements is true?
(A) A tree has no bridge
(B) a bridge cannot be part of a simple cycle
(C) Every edge of a clique with size 3 is a
bridge (A clique is any complete
subgraph of a graph
(D) A graph with bridge cannot have a cycle
Ans: (B)
1
3
10
31
5
6
18
14
23
25
When an element is removed from a Young

tableau, other elements should be moved
into its place so that the resulting table is
still a Young tableau(unfilled entries may be
filled in with a ). The minimum number of
entries (other than 1) to be shifted, to
remove 1 from the given Young tableau is
________.
Given below are some algorithms, and some

algorithm design paradigms.
List I
1. Dijkstras Shortest Path
2. Floyd-Warshall algorithm to compute
all paris shortest path
3. Binary search on a sorted array
4. Backtracking search on a graph
2
4
12
55.
Ans: 5
ListII
(i) Divide and Conquer
(ii) Dynamic Programming
(iii)Greedy design
(iv)Depth-first search
(v) Breadh-first search
Match the above algorithms on the left to
the corresponding design paradigm they
follow.
(A) 1-i, 2-iii, 3-i, 4-v (B) 1-iii, 2-ii, 3-i, 4-v
(C) 1-iii, 2-ii, 3-i, 4-iv (D) 1-iii, 2-ii, 3-i, 4-v
54.
Ans: (C)
55.
A Young tableau is a 2D array of integers

increasing from left to right and from top to
bottom. Any unfilled entries are marked
with , and hence there cannot be any entry
to the right of, or below a . The following
Young tableau consists of unique entries.

GATE-2015 AnswerKeys

Uploaded by

Copyright:

Available Formats

GATE-2015 AnswerKeys

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

GATE-2015 AnswerKeys

Uploaded by

Copyright:

Available Formats

:2:

GATE 2015_ Afternoon Session

Choose the statement where underlined

ACE Engineering Academy

Time: 2:00 PM - 5:00 PM

Based on the given statements, select the

GATE 2015_ Afternoon Session

Out of the following four sentences, select

ACE Engineering Academy

If p, q, r, s are distinct integers such that:

ACE Engineering Academy

GATE 2015_ Afternoon Session

The number of divisors of 2100 is _____.

Consider the following C function.

GATE 2015_ Afternoon Session

ACE Engineering Academy

Consider a complete binary tree where the

Assume that for a certain processor, a read

A link has a transmission speed of 106

GATE 2015_ Afternoon Session

transmission delay, and that its propagation

efficiency of the stop-and-wait protocol in

this setup is exactly 25%. The value of the

one-way propagation delay(in milliseconds)

involving two bank accounts x and y.

ACE Engineering Academy

A software requirements specification

GATE 2015_ Afternoon Session

A system has 6 identical resources and N

ACE Engineering Academy

program, the code corresponding to N2

ACE Engineering Academy

GATE 2015_ Afternoon Session

Which one of the following statements is

GATE 2015_ Afternoon Session

of the two eigenvalues of the

Consider the following two statements.

(A) If a person is known to be corrupt, he is

ACE Engineering Academy

Let R be the relation on the set of positive

GATE 2015_ Afternoon Session

solution. The procedure is given below.

// N = maximum number of iterations

if |fb| > then // loop is terminated with i=N

ACE Engineering Academy

For each IP address in Group I identify the

(A) i-a, ii-c, iii-e, iv-d

Which one of the following well formed

GATE 2015_ Afternoon Session

(D) xy P(x,y) xyP(y,x)

ACE Engineering Academy

Which one of the following hash functions

GATE 2015_ Afternoon Session

Which one of the following assertions

ACE Engineering Academy

The number of onto functions (surjective

Assume that the bandwidth for a TCP

GATE 2015_ Afternoon Session

Consider the sequence of machine