GATE

TarGATE16
CSTest ID: 162265
www.gateforum.com
Answer Keys
10
13
14
19
20
21
26
27
42
28
32
33
34
35
16
39
40
99
41
42
45
46
80
47
48
49
9.2
52
53
54
55
688
10
2074
10
11
12
15
110
16
17
18
22
23
24
25
29
30
31
34
36
37
38
43
44
50
51
660
Explanations:General Aptitude
1.
Creek, lagoon and prairie are water bodies while haystack is not one.
2.
The context mentions despite, which means that the two ideas in the sentence are in contrast
to one another. The second idea is about being true to oneself hence the first idea has to be
negative. Hence, knavery (trickery) and skullduggery (dishonesty) complete the sentence.
3.
Immutable means unchangeable whereas alterable refers to change.
4.
4
7
3
= 0.44; = 0.583; = 0.43
9
12
7
12
1
= 0.706; = 0.5
17
2
12 7 1 4 3
> > > >
17 12 2 9 7
5.
Let A=x, B=x+2, C=x+4

D=x+6 and E=x+8
ICPIntensive Classroom Program eGATE-Live Internet Based Classes DLP TarGATE-All India Test Series
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.
TarGATE16
CSTest ID: 162265
www.gateforum.com
x + x + 2 + x + 4 + x + 6 + x + 8 = 130
5x + 20 = 130
5x = 130 20
5x = 110
x=
110
= 22
5
A = 22 and E = x + 8 = 22 + 8 = 30
A E = 22 30 = 660
6.
Conclusion I is extreme since we have no information about other plants. Conclusion 2 is

correct because the statement explicitly mentions that cactus requires little water and it can be
concluded that cactus can sustain in arid or dry deserts.
R
A = P 1 +
100
8.
= 3600 1 +
100
= 3600 1 +
50
=
3600 53 53 53
= Rs.4287.7
50 50 50
cl = Amount Pr incipal
= Rs(4287.7 3600)
= Rs.687.7 Rs.688
In two throws of a dice, n ( s ) = 6 6 = 36
9.
E= Event of getting a sum = {( 3,6 ) , ( 4,5 ) , ( 5, 4 ) , ( 6,3)}
P (E) =
10.
n (E)
n ( S)
4 1
=
36 9
Q = T-5
S = P-10 = Q-8
Putting the value of T, Q = 15 years
S = Q-8 = 7 years
P -10 = Q
P = 17 years
But there is no data provided about R. So we cannot find Rs age.
CSTest ID: 162265
TarGATE16
1.
! Has higher precedence than >. so !k is 0 and 0>100 is false
2.
2010+(26+4)4=2074
3.
The pivot could be either the 7 or the 9
9.
www.gateforum.com
Given no of vertices =n
no of edges =m
no of vertices of degree k =p
no of vertices of degree k+1=n-p
we know that sum of degree of vertices =2 no of edges
pk + (n p) ( k + 1) = 2m
pk + nk + n pk p = 2m
n(k + 1) p = 2 m
p = n(k + 1) 2m
10.
We know that if G has n vertices and k components then G has atleast n-k number of edges.
11.
Given xRy x 2 4xy + 3y 2 = 0
1. if y=x then x 2 4x 2 + 3x 2 = 0 xRx

R is reflexive
2. R is not symmetric,
For example 3R1, because (3) 2 4(3)(1) + 3(1) 2 = 0
But (1)2 4(1)(3) + 3(3) 2 0 1R 3
3. R is not transitive
since 9R3 because (9)2 4(9)(3) + 3(3) 2 = 0
and 3R1 because (3) 2 4(3)(1) + 3(1) 2 = 0
But 92 4(9)(1) + 3(1)2 0 a 9 R1
i.e., 9R3 and 3R1 but 9 R 1
12.
Process
Arrival time
CPU time needed in (ms)
Priority
P1
P2
TarGATE16
CSTest ID: 162265
P3
P4
15
P5
20
www.gateforum.com
Note smaller the number higher the priority

AWT = (0 + 4+ 10 + 11+ 25 ) / 5
15.
16.
E.A.T = 1 ( 200 ms ) + 1 1 100 ms

10
10
= 20 + 90 = 110 ms.
A
B
F = AB + CD
C
D
17.
S A A aA bB b
The first (S) {a, b}
First (A) {a, b}
So table has following entry
a
b
$
S SA
SA
A A aA A bB b
18.
i-Q, ii-Q, iii-S, iv-P
19.
Explanation: First(S) = First(A) = First(B) = {a,b, }

Follow(A)={a,b}
Follow(B) ={a,b,$}
Follow(S)={a,b,$}
20.
F = BC + BD + AC'+ AD
= C ( A + B) + D ( A + B)
= ( A + B) C + D
TarGATE16
CSTest ID: 162265
www.gateforum.com
A
B
F
C
D
is equivalent to
So,
A
B
F
C
D
21.
For Half adder

Sum S = A Band carry,C = A.B
S= AB
AB
C = AB
22.
MOSPF: Multicast open shortest Path First is a multicast routing protocol.
23.
Stack status : 5 3 2
Stack status with + : 5 5
Stack status with - : 0
Stack status : 0 2 4 4
Stack status with / : 0 2 1
Stack status with + : 0 3
Stack status with * : 0
Stack status : 0 2
Stack status with $ : 0
Stack status : 0 4
Stack status with + : 4
CSTest ID: 162265
TarGATE16
www.gateforum.com
There are 19 observations, so the middle term is 10th
24.
After including 8 and 32 i.e., 8 will come before

30 and 32 will come after 30
Here, new median will remain 30
t
s
We have L1 2
= sinh at
2 2
(s a ) 2a
25.
t
s
L1 2
= sinh 2t
2
(s 4) 4
28.
0
39
48
69
3
4
24
5
6
7
8
18
89
18 is placed at position 8 without any collision while placing 48 one collision will occur at
position 8
29.
T(n)=2T(n/2)+nlogn
n=2k
T(2k)=2T(2k-1)+k.2k
=2[2T(2k-2)+(k-1).2k-1]+k.2k
=2kT(2k-k)+2k[1+2+..+k]
=2kk(k+1)/2
=O(n(logn)2)
31.
n6+(n-1)9<=512
n<=34
TarGATE16
CSTest ID: 162265
32.
2 1 1
[AB] = 1 2 1
1 1 2
www.gateforum.com
p
q
r
Applying R 3 2R 2 + R 1 & R 3 2R 3 + R 1 ;
p
2 1 1
[ AB] ~ 0 3 3 2q + p
0 3 3 2r + p
Applying R 3 R 3 + R 2 ;
p
2 1 1
[ A B] ~ 0 3 3 2q + p
0 0 0 2p + 2q + 2r
Given that the system has an infinite no of solutions.
2P + 2q + 2r must be zero
2[p + q + r ] = 0
p + q + r = 0
34.
Given that probability density function of a continuous random variable x is
x
;
f(x) = 2
0;
if 0 < x < 2
otherwise
2
x
1 x3
8 4
E ( x ) = x dx = = =
2
2 3 0 6 3
0
2
x
1 x4
E ( x ) = x dx = = 2
2
2 4 0
0
2
( )
Variance V(x) = E x 2 { E ( x )} = 2
2
16 2
=
9 9
35.
T2s update is lost.
36.
Message passing is useful for exchanging smaller amounts of data
CSTest ID: 162265
TarGATE16
www.gateforum.com
37.
P0
P1
Turn
P1 is blocking P0 Indirectly.
CS
Turn is given to P1 because Turn value is 1. But P1 is not interested to enter and also it is not
changing the turn value. Unless and until P1 changes the turn, P0 will not enter.
So indirectly P1 is blocking P0 .
38.
N = 2k
page table entry size ( e ) = 4B
m = 512
Page size = 2k pages 211 = 11 bits
Frame size = 512 = 29 = 9 bits
Physical Address Space = 4 mB
= 222
Physical Address = 22 bits

Logical Address = 24 bits
f d
9 13
p d
11 13
Logical Address Space = 224 = 16 mB
39.
( 312 )6 = 36 3 + 6 1 + 2 1 = (116 )10

( XY1)5 = 25 X + 5 Y + 1
by trial and error
X = 4 and Y = 3
40.
Availability = MTTF/(MTTF + MTTR) and MTBF = MTTF + MTTR
TarGATE16
CSTest ID: 162265
41.
16
www.gateforum.com
10
tag set No. offset

30
offset
Block size = 2 4 words
No. of sets =
cache size
216
216
= 4 2 = 6 210
line size No. of ways 2 2
2
tag = ( 30 10 4 ) 16 bits.
42.
Relative address of A [ i1 ,i 2 ] is
= base + ( ( no. of columns ) No. of rows upto ( i1 1) + no.of elements upto i 2 ) word length
= base+ ( ( i1 low1 ) ( high 2 low 2 ) + 1) + ( i 2 low 2 ) w
43.
I0
I1
1
0
I2
1
1
I3
4
A
44.
F = m ( 3,4,5,6,7 )
BC
A
00
01
So, F = A+BC
11
10
CSTest ID: 162265
TarGATE16
www.gateforum.com
45.
Step No.
Vertices
D ( B ) , P ( B ) D ( C ) , P ( C ) D ( D ) , P ( D ) D ( E ) ,P ( E ) D ( F ) , P ( F )
dis cov ered
1
2
3
4
A
AB
ABC
ABCD
2, A
2, A
2, A
2, A
5,A
5,A
5,A
4, D
1, A
1, A
1, A
1, A
,
,
6,C
2,D
,
,
10,C
9,C
5
6
STOP
ABCDE
ABCDEF
2, A
2, A
3, E
3, E
1, A
1, A
2,D
2,D
4, E
4, E
Note: (1) Vertices discovered means those vertices whose all neighbours have been found.
(2) P ( x ) means parent of vertex x.
(3) D ( x ) means cos t to reach x from source.
So, from above table, which shows iterations of Dijkstra algorithm for the given graph, we
can see that parent of C is E. And parent of E is D. So, to reach C from A, the next hop in As
table will be D.
46.
Throughput
1+ 5*
TPM
Ttrans
50% =
1+ 5*
Tp
200ms
TP = 40ms So RTT = 2 *TP

R TT = 80ms
47.
49
173
33
(AND operation)
and no. of subnet is 8.

Directed Broadcast Address is one where all
10
TarGATE16
CSTest ID: 162265
www.gateforum.com
HID bits in that subnet is replaced with 1

48.
Given B = 4 mbps
L = 1kB
d = 1000 km
TP = 10 s km
1km 10 s
1000 km 10 106 103 = 10 ms
(i) RTT = 20 ms
(ii)
(iii)
Bandwidth Delay product ( Wbits )

B D = 4 106 20 103 = 80 k bits
Wpackets ( V ) ows ( optimal window size )
Wpackets =
80 103
= 10
8 103
(iv) Wpackets = 2n
2n = 10 2n = 10 = 24 n = 4
49.
Process
Arrival time
CPU time needed in (ms)
Priority
P1
P2
P3
P4
15
P5
20
AWT = (0 + 3 + 7 + 11+ 25 ) / 5
50.
When we delete 1st element at root i.e. 11, we have to perform 2 swaps (70~25), (70~41).
Level order traversal is: 25,35, 41, 42,49, 70, 80, 55
When we delete 2nd element at root i.e. 25, we have to perform 2 swaps (55~35), (55~42).
Level order traversal is: 35, 42, 41, 55, 49, 70, 80
11
CSTest ID: 162265
51.
TarGATE16
www.gateforum.com
Since |a-a|=0<1, for any a S
aRa R is reflexive
If a b < 1 then b a < 1
R is symmetric
If a b < 1 and b c < 1 then a c < 1 for a, b,c S
R is transitive.
Hence R is an equivalence relation.
52.
3 4 doesnot exist
{1,3, 4,6,12} is not a sublattice.
53.
Clearly the identity element is 2.
a2
= aa G
a * 2 =
2
2*b = 2
2b
=2
2
2b = 4
4
=2
2
Inverse of 2 is2.
b=
54.
n
G is a bipartite graph of order n and size m thus m .
2
14
i.e., m
2
m 49
55.
By Gauss divergence theorem,
F.Nds = divFdv
v
e i + 3yj ze x k .n dA = ( e x + 3 e x ) dv
s
12
CSTest ID: 162265
TarGATE16
www.gateforum.com
= 3V
4
= 3 r 3
3
= 4( r = 1)
13

GATE

Diunggah oleh

Informasi Dokumen

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

GATE

Diunggah oleh

Hak Cipta:

Format Tersedia

TarGATE16

CSTest ID: 162265

Immutable means unchangeable whereas alterable refers to change.

Let A=x, B=x+2, C=x+4

CSTest ID: 162265

Conclusion I is extreme since we have no information about other plants. Conclusion 2 is

E= Event of getting a sum = {( 3,6 ) , ( 4,5 ) , ( 5, 4 ) , ( 6,3)}

CSTest ID: 162265

! Has higher precedence than >. so !k is 0 and 0>100 is false

The pivot could be either the 7 or the 9

Given xRy x 2 4xy + 3y 2 = 0

1. if y=x then x 2 4x 2 + 3x 2 = 0 xRx

CPU time needed in (ms)

CSTest ID: 162265

Note smaller the number higher the priority

E.A.T = 1 ( 200 ms ) + 1 1 100 ms

i-Q, ii-Q, iii-S, iv-P

Explanation: First(S) = First(A) = First(B) = {a,b, }

CSTest ID: 162265

For Half adder

MOSPF: Multicast open shortest Path First is a multicast routing protocol.

CSTest ID: 162265

There are 19 observations, so the middle term is 10th

After including 8 and 32 i.e., 8 will come before

CSTest ID: 162265

Given that probability density function of a continuous random variable x is

T2s update is lost.

Message passing is useful for exchanging smaller amounts of data

CSTest ID: 162265

page table entry size ( e ) = 4B

Physical Address = 22 bits

Logical Address Space = 224 = 16 mB

( 312 )6 = 36 3 + 6 1 + 2 1 = (116 )10

Availability = MTTF/(MTTF + MTTR) and MTBF = MTTF + MTTR

CSTest ID: 162265

tag set No. offset

Block size = 2 4 words

CSTest ID: 162265

TP = 40ms So RTT = 2 *TP

and no. of subnet is 8.

CSTest ID: 162265

HID bits in that subnet is replaced with 1

Bandwidth Delay product ( Wbits )

CPU time needed in (ms)

CSTest ID: 162265

Since |a-a|=0<1, for any a S

Clearly the identity element is 2.

By Gauss divergence theorem,

CSTest ID: 162265

Anda mungkin juga menyukai