Targate'16: Answer Keys: General Ability: 1 2 3 4 5 6 7 8 9 10

CSTest ID: 162270
TarGATE16
www.gateforum.com
Answer Keys:
General Ability:
1
60
10
Computer Science Engineering
36
15
15
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
625
38
39
40
-14
41
42
43
152
44
173
45
46
260
47
48
250
49
50
1250
51
52
53
54
55
Explanations:1.
Harry disrupted the meeting hence interloped is the appropriate word. Interlope means to
intrude or encroach.
2.
Evidence means proof or confirmation.
4.
2r = 264
22
r = 264
7
264 7
r=
= 42cm
22 2
2
Area of the circle = r 2

22
42 42 = 5544 Sq.cm
7
ICPIntensive Classroom Program eGATE-Live Internet Based Classes DLP TarGATE-All India Test Series
Leaders in GATE Preparations 65+ Centers across India
All rights reserved by Gateforum Educational Services Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission.
CSTest ID: 162270

5.
TarGATE16
www.gateforum.com
The pattern of the number series is
17 + 92
98 + 7
147 + 5
= 98
= 98 + 49
= 147
= 147 + 25 = 172
172 + 32 = 172 + 9
= 181
181 + 1
= 182
8.
= 17 + 81
= 181 + 1
40% of the 200 like Raspberry (I'm assuming you got 80 by simply taking 40% of 200).
However, there are people who like other jams as well.
In general, when we're asked to maximize one thing in a GMAT question, we want to
minimize everything else.
In this question, to maximize the number of people who like just raspberry, we need to
minimize the number of people who like strawberry and/or apple PLUS raspberry.
Here's what we know about Strawberry/Apple:
112 people like Strawberry
88 people like Apple.
60 people like both of them.
Since only 60 people like both of them, this means that:
52 people like only strawberry;
28 people like only apple; and
60 people like both.
That's already 140 people. We only started with 200, so the maximum possible number of
people who could dislike both apple and strawberry is 60.
9.
The difference between C and D is that D says II will decrease.

II. -10 - 1/(x^2)
The -10 is a constant so don't worry about that. Let's take it one step at a time. When x
increases, x^2 increases. Since x^2 is in the denominator, the entire term 1/(x^2)
DECREASES. Since that entire term is being subtracted from the constant, the entire
expression -10 - 1/(x^2) INCREASES. If you subtract a smaller number, then your result is
higher. An increase in x results in increase in II, so C. III only is correct
10.
Solution Y is 3/10 liquid X and 7/10 water.

We start with 8kg of the solution.
So the solution is 3/10 * 8 = 2.4kg of liquid X.
Therefore there are 8-2.4 = 5.6kg water.
From this we subtract the 2kg water that has evaporated, leaving 5.6-2= 3.6 kg water.
We now have 2.4 kg liquid X and 3.6 kg water.
CSTest ID: 162270
TarGATE16
www.gateforum.com
To this we now add 2kg of solution. So that would be 0.6kg of liquid X and 1.4 kg of water
that we are adding (solution is 3/10 liquid X and 7/10 water).
So we now have 2.4 +0.6 = 3 kg of liquid X.
And 3.6+1.4=5kg of water.
And we have 8kg in total.
So the percent of this new solution that is liquid X is: 3/8 =37.5%
2.
4
( F)
8
( F)
2
( F)
Hit ratio =
3.
3
( F)
2
(H)
8
(H)
3
(H)
1
( F)
2
(H)
6
( F)
7
( F)
number of hits
4
= = 0.36 ( or ) 36%
number of references 11
5 + 10 = 15bits
1024 words page 2

32 pages 25
10
5.
The max function can be used to return the maximum salary in a department where each group
is formed by a department.
6.
Number of subnets 10 2n n = 4
Number of hosts/subnet 2n 2 = 10 2n = 12 16 = 24
255.255.255.240
7.
WS+WR ASN
If N is the maximum number then
+
wS
8.
ASN
wR
0.145 214 = 0.00100101 214

14 + 64 = 7810 = 10011102
The value is stored as

0
100 111 0 0 0 1 0 0 1 0 1
4
CSTest ID: 162270

9.
128 K bytes cache contains
TarGATE16
www.gateforum.com
128 K
= 16 K blocks.
8
3 (Q 23 = 8 ) bits are required for byte offset.
14 (Q 214 = 16 K blocks ) bits are required for cache index.

Remaining 32 (14 + 3) = 15 bits are used for tag.
10.
11.
( A '+ C )( A '+ C')( A '+ B + C'D ) = ( A '+ A 'C + A 'C'+ CC')( A '+ B + C'D )
= A '+ A 'B + A 'C'D = A '[1 + B + C'D'] = A
Since NAND bubbled OR gate, the given circuit can be considered as
A
D
B
C
F = AD + BC + BD
13.
Time complexity of Kruskals algorithm is ( E log E )

Where E is the number of edges. As it is complete graph E=O (n2)
So ( n 2 log n 2 )
15.
At lexical Analysis
16.
We are not performing swapping operation in insertion sort.
21.
The grammers have the property that no production night side is (or) has two adjacent nonterminals. A grammer with those properties is called shift-reduce grammers. A grammer with
latter property is called and operator grammar.
S E
E E + E E E E E E E E ^ E ( E ) id has not two adjacent non terminals.
So this is operator grammer.
CSTest ID: 162270

23.
TarGATE16
2.
1
f (x) = 2 x + 1 is not differentiable at x = ( 1,0)
2
f(x)=[x] is not continuous at x=-1,0,1
3.
f (0) f(1)
4.
Check the derivative of f(x) at x=2
1.
www.gateforum.com
f (x) f(2)
(x 2 1) (3)
= Lt
x 2
x 2
x2
x2
x<2
Lf (2) = Lt
= Lt (x + 2) = 4 and
x 2
Rf (2) = Lt
x 2
x >2
f (x) f (2)
(9 3x) (3)
= Lt
= 3
x
2
x2
x2
f (x) is not differentiable at x = 2 (1,3)

24.
lim x(t) = limS.X(s)

t
s 0
limSx(s) = lim
s 0
s 0
25.
s(808)
s(s + 2s + 101)
2
808
=8
101
Let X be am exponential random variable
f ( x ) dx = 1
0
e 6 dx = 1
0
ex 6
=1

1
6 0
6 e e0 = 1
6 = 1 = 1
P ( x > 8) =
f ( x ) dx =
8
27.
1 x6
6
e
dx
=
e
= 0.2635
8 6
As k is fixed (constant), consider for any n > K:
CSTest ID: 162270
TarGATE16
www.gateforum.com
S ab n B b n c ab n b b n c
S ab n +1 B b n +1 c ab n +1 b b n +1 c
By LR(K) definition
= ab n
y = ab n +1
= b w = bn c
= b y = b n +1 c
Although W [1: K ] = y [1: K ] , we have
!= y
(The handle cannot be localized with only limited look ahead size K.)
The grammar is not LR(k)
64
= 16
4
Word offset=7 bits, Set offset=4 bit, Tag offset=19-(4+7)=8 bits
29.
Number of sets =
30.
Total No of Resource Types = 1 =R

Total No of instances of Resource Type R = 10 instances
Total No of processes = n = {P1, P2,,Pn}
No of instances of R required for each process = 4
P1 = 4-1=3
P2= 4-1=3
P3= 4-1=3
P1, P2, and P3 have taken 3 instances of R and waiting for 1-instance of R and 1- instance of R
is available. So the system to be deadlock free, the maximum no of processes allowed must be
3.
32.
Total 4 tables & 12Attributes

Student ( frame, lname, Addr, Rolln o )
Sty-Phone No. Roll no, phone No
takes Roll no, Cid, Marks
colour ( C id, CName, Dept )

34.
For keeping track of number of b s we would be losing n and cant check for c and d.
35.
[a, b,e,f ][c,d,g]
CSTest ID: 162270
TarGATE16
www.gateforum.com
[a,e][ b,f ][c,d,g ]

0
a, e
c, d, g
36.
g/p is read from MSB.
37.
625
Cycle time =
0,1
109
1
=
ns
2.5 2.5
One instruction = 4
1
ns = 1.6 ns
2.5
1.6 ns 1 Instruction;1sec
38.
b, f
109
Instructions = 625 MIPS
1.6
Main memory cost = C m 8 106 = 105 8 106 = $80

Cache cost = CC 8 106 = 104 8 106 = $800
39.
32 8 + 24 ; 224 = 16 M Bytes
40.
Since MSB is 1 the number is negative.

2s compliment of 10010 is 01110 = +14.Therefore 10010 is -14
100%7 = 2, after 100 cycles the state will be 111.
41.
42.
AB + A'C + BC = AB + A'C
A
B
A '+ B '
A + C'
AB + A 'C
T ( n ) = T ( n 1) + log n
CSTest ID: 162270
TarGATE16
www.gateforum.com
T ( n 2 ) + log ( n 1) + log n
T ( n k ) + log ( n ( k 1) ) + log n
T (1) + log 2 + log n

1 + log 2 + log n
log (1 2 n ) = log ( n!) ( n log n )

Q n k = 1
k = n 1
43.
In column major order,

addr a[i][j] = BA + [ ( j LB2) * ( UB1 LB1 + 1 ) + ( i LB1 ) ] * size
In the given case, i=7, j=8, LB1=1, UB1=10, LB2=1, UB2=10, size=2, BA=0
Addr of a[7][8] = 0 + [ (8 1) * (10 1 + 1) + (7 - 1) ] * 2
= (7*10 + 6 ) * 2
= 152
44.
Every quadratic polynomial f(x) satisfies the conditions of lagranges mean value theorem in
a+b
[a,b] and c =
C doesnt depends on P, Q
.
2
Hence, p and q are real numbers
46.
E.A.T = 0.6 (200) + 0.4(50+300)

= 120+ 140 = 260
47.
First (s) = first ( S) = first ( BC ) U first ( X )

= {a,} {} U first ( C ) U {a}
=
48.
{a} U {b,e} U{a}
= {a, b,e}
B = 10 mbps
Tp = 100 s
d
L = 2 B L = 2 100 106 10 106
v
= 2000 bits = 250 Bytes
CSTest ID: 162270

49.
TarGATE16
www.gateforum.com
IP :
192.84.7.0
SNMA :255.255.255.248
192.84.7.0
192.84.7.00000000
NID SID HID
50.
Last but one subnet Address
192.84.7.11110 000 192.84.7.240
Broadcast Address of one subnet address
192.84.7.11110111 192.84.7.247
= 50% L = BR
In stop and wait
L = 100 106 100 106 1000 bits for1250Bytes

51.
(i)
RTT = 10 s
(ii) B D product ( w bits ) = 10 106 10 106 = 100 bits

B D 100
=
= 10
L
10
(iii) w packets =
(iv) w packets = 2 n 2 n = 10 2 n = 10 16 = 2 4 n = 4
52.
53.
(D)
input Q3
Q2
Q1
Q0
0
1
0
0
1
1
0
0
1
1
0
0
1
1
0
1
0
1
1
0
0
1
0
0
The characteristic equation is A I = 0

3 2 + ( 10 + 8 + 0 ) 0 = 0
3 2 2 = 0
= 0, 1, 2
1 2 3 & 1 = 1; 2 = 0; 3 = 2
CSTest ID: 162270

54.
TarGATE16
A may win in the first round with the probability=
www.gateforum.com
1
.
2
He may win in the second round after A and B failed is the first round with probability=
2
1 1
. continue like this.
2 2
The probability of A wins the game is

1
2
4
1 1 1 1 1
1 4 2
2
+ + + =
= =
2
2 2 2 2 2
1 2 3 3
1
2
Hence the chances of B success are = 1
55.
2 1
= .
3 3
z = a (singularity of the integral) lies inside C
By Cauchys integral formula,

z2 + z 1
2
C z a dz = 2i ( z + z 1) z = a
= 2i ( a 2 + a 1) = 2i
2i ( a 2 + a 1) = 2i
a2 + a 1 = 1
a2 + a 2 = 0
a = 2 or1
10

Targate'16: Answer Keys: General Ability: 1 2 3 4 5 6 7 8 9 10

Uploaded by

Document Information

Original Title

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

Targate'16: Answer Keys: General Ability: 1 2 3 4 5 6 7 8 9 10

Uploaded by

Copyright:

Available Formats

CSTest ID: 162270

Computer Science Engineering

Evidence means proof or confirmation.

Area of the circle = r 2

CSTest ID: 162270

The pattern of the number series is

The difference between C and D is that D says II will decrease.

Solution Y is 3/10 liquid X and 7/10 water.

CSTest ID: 162270

1024 words page 2

0.145 214 = 0.00100101 214

The value is stored as

CSTest ID: 162270

128 K bytes cache contains

3 (Q 23 = 8 ) bits are required for byte offset.

14 (Q 214 = 16 K blocks ) bits are required for cache index.

Time complexity of Kruskals algorithm is ( E log E )

We are not performing swapping operation in insertion sort.

CSTest ID: 162270

Check the derivative of f(x) at x=2

f (x) is not differentiable at x = 2 (1,3)

lim x(t) = limS.X(s)

Let X be am exponential random variable

As k is fixed (constant), consider for any n > K:

CSTest ID: 162270

Although W [1: K ] = y [1: K ] , we have

Total No of Resource Types = 1 =R

Total 4 tables & 12Attributes

Sty-Phone No. Roll no, phone No

takes Roll no, Cid, Marks

colour ( C id, CName, Dept )

[a, b,e,f ][c,d,g]

CSTest ID: 162270

[a,e][ b,f ][c,d,g ]

g/p is read from MSB.

Main memory cost = C m 8 106 = 105 8 106 = $80

Since MSB is 1 the number is negative.

CSTest ID: 162270

T (1) + log 2 + log n

log (1 2 n ) = log ( n!) ( n log n )

In column major order,

E.A.T = 0.6 (200) + 0.4(50+300)

First (s) = first ( S) = first ( BC ) U first ( X )

{a} U {b,e} U{a}

CSTest ID: 162270

Last but one subnet Address

192.84.7.11110 000 192.84.7.240

Broadcast Address of one subnet address

In stop and wait

L = 100 106 100 106 1000 bits for1250Bytes

(ii) B D product ( w bits ) = 10 106 10 106 = 100 bits

The characteristic equation is A I = 0

CSTest ID: 162270

A may win in the first round with the probability=

The probability of A wins the game is

Hence the chances of B success are = 1

z = a (singularity of the integral) lies inside C

By Cauchys integral formula,

You might also like