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

CSTest ID: 162268
TarGATE16
www.gateforum.com
Answer Keys:
General Ability:
1
10
15.5
Computer Science Engineering

1
3072
10
17
11
12
11
13
14
15
16
240
17
18
19
20
21
22
1580
23
24
25
26
452
27
28
29
30
31
32
72
33
34
35
36
37
9.2
38
0.75
39
40
41
42
43
44
45
46
47
48
49
50
51
33
52
53
54
55
Explanations:1.
4 men can go in five hotels in 54 ways.

Number of ways in which 4 men can go into different hotel = 5P 4 =
Re quired proability =
2.
5!
= 5!
( 5 4 )!
5! 120
24
=
=
4
5
625 125
N = 110Q + r
= 110r + r
(q = r)
= 111r
r can be1,2,........109
111(1 + 2 + 3 + ..........109 )
Sum =
109 110 111

2
4.
The given pair is that of synonyms. Altercation or row means quarrel. Similarly, in option D,
nefarious and wicked are synonyms.
5.
The phrase death blow means an event that leads to failure of something.
ICPIntensive Classroom Program eGATE-Live Internet Based Classes DLP TarGATE-All India Test Series
Leaders in GATE Preparation 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: 162268
TarGATE16
www.gateforum.com
6.
Area of the circle = r2

Area of the square = one of its sides squared
Perimeter of the square is 40 - (the perimeter of the circle = 2r)
One of the sides of the square = 40-2r/4 or 10-1/2r
Total area: r2 + (10-1/2r)2
7.
We know that the new solution is 3% vinegar and has a total of 62 ounces of liquid.
Using the percent equation:
% = part/whole
3/100 = ounces vinegar/62
(3/100)62 = ounces of vinegar
Now, before we actually calculate, let's think about what we're doing next. We want to know
the % vinegar in the original solution. So, once again:
% = part/whole 100%
= (3/100) (62)/12 100%
= (186)(1/12) %
= 15.5%
8.
Birbal is gaining on Tansen at a rate of 1 kmh (7 kmh - 6 kmh). In 30 minutes, Tansen was
able to run 3 kilometers. We need to determine how long it will take for Birbal to overcome
Tansen 's 30-minute (3 km) advantage.
distance = rate time
3 km = 1 kmh time
time = 3 km / 1 kmh
time = 3 hours
Birba will overtake Tansen in 3 hours.
The answer is B.
10.
Conclusion I is correct since the statements clearly depicts that terrain and cramped are two
separate circles. Conclusion II is incorrect because the circle of turf intersects terrain which
means there is some relationship between the two. Conclusion III is incorrect because
cramped and terrains are two completely different circles which do not meet at any point and
have no relationship in any way.
1.
Source is M[500] Memory direct.

Destination is Ax Register direct.
2.
SHR A, n;
3.
210 = 1024 words
divide the value of A by 2n
1024 24byte
= 3072 bytes
8
CSTest ID: 162268
TarGATE16
www.gateforum.com
T ( n ) = T ( n 1) + log n
8.
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 )
n k = 1
k = n 1
10.
Page size = page offset = 224 /27 = 217

17 bits
11.
It introduces an intermediate level of scheduling
12.
Worst case A has acquired 1 B-2, C-3 and D -4, total 10. If one or more is enough to resolve
deadlock
13.
Option a) is TRUE.
If a relation is in 3NF, then it is also in 2NF, and 1NF.
Option b) is TRUE.
If all keys are simple then the relation is in 2NF.
Option c) is TRUE.
FD: Non Prime Attribute Non Prime Attribute is Valid in 2NF. Since Non Prime
Attribute is not a Part of Key.
An FD: XY will violate 2NF only if X is part of key and Y is non prime.
Option d) is FALSE.
FD: Non Prime Attribute Non Prime Attribute is Not Valid in 3NF. Since Non
Prime Attribute is not a key.
An FD: XY will violate 3NF only if X is non key and Y is non prime.
15.
If there are n devices connected using mesh technology, then total number of duplex links
between the devices is n*(n-1)/2.
Bus topology is easier to install than star topology.
Ring topology is less secured than mesh topology.
Fault isolation is tougher in Bus topology than ring topology.
CSTest ID: 162268
16.
TarGATE16
www.gateforum.com
Total length = ( 00 F8 )H Bytes

= ( 248 )10 Bytes
Data length = Total packet length header length

= ( 248 8 ) Bytes
= 240 Bytes.
17.
Since 2421 is self complementing code.
18.
Let us first create the truth table for this diagram.

x
F(x,y,z)
Now we write out the expression.

f ( x, y, z ) = x y z + x y z + x y z + x y z = xz + x y + x y z
+
19.
The given grammar generates the regular expression (0011) . So L is regular but not (0 + 1)*
20.
S A / ab
A cAb / B
Ba
Construct LR(1) state diagram, it requires 14 states (O to 13)
LR (1) Table is :
TarGATE16
CSTest ID: 162268
www.gateforum.com
0
1
2
.
.
.
13
21.
(14 7)
we know that in a simple graph of order n ( 2) , no of edges cannot exceed

In a graph of order 5, no of edges cannot exceed
n(n 1)
.
2
1
5(5 1) = 10
2
I only true.
22.
we know that if G is a simple graph of size n is isomorphic to G then size of G is

size of G =
23.
n(n 1)
.
4
80 (80 1)
= 1580
4
4 5 36
Let A = 3 8 27
12 4 108
R3 R3 + R2
4 5 36
A ~ 3 8 27
15 12 135
C1 C1 C2
1 5 36
A ~ 5 8 27 = (Resultant matrix)
3 12 135
Sum of the Eigen values of R = -1 + 8 +135 = 142 [Trace of R]
Product of the Eigen values of R =Determinant of R = Original matrix = 0 ;

Since determinant is Unaltered by the operation (i) and (ii) & in the given matrix C1, C3 are
proportional i.e, C3 = 4C1
TarGATE16
CSTest ID: 162268
24.
www.gateforum.com
cos
cos
1
1
A=
; AT =
1
1
cos
cos
1 + cos 2 cos + cos
2
cos + cos cos + 1
2
A A T = 1 + cos 2 4 cos 2 = 1 + cos 4 + 2 cos 2 4 cos 2
= 1 + cos 4 2cos 2
2
= 1 cos 2 = sin 2
= sin 4
25.
L[sint] =
1
s2 + 1
L[t 3 sin t] = (1)3

=
d3 1
( u sin g multiplication by 't n ' formula )
ds3 s 2 + 1
24s (1 s 2 )
(1 + s 2 ) 4
e t ( t 3 sin t ) dt = L t 3 sin t
s =1
( usin g definition of Laplace transform )

=
24s(1 s 2 )
(1 + s 2 ) 4 s =1
=0
26.
Effective access time = .65 200 + .35 .95 600 + .05{.40 10 1000 + .60 5 1000}
= 130 + .35 570 + .05{4000 + 3000} = 452 sec
27.
Tag = 19
Offset = log2 (256) = 8
So set No = 40 (19+8) = 13 bit
Then = 213 = 8192 sets
16384
= 2 way set associates
8192
TarGATE16
CSTest ID: 162268
28.
www.gateforum.com
Suppose string is then ( q 0 , B ) = ( q 4 , B, R )
is final State
Suppose string is ab then
abB
q0
BBB
q1
BbB
q1
BbB
q2
BbB
q1
BBB
q4
BBB
q3
Final state
29.
Even through ends with 01 means 01 substring is present, ends with 01 is correct. 1011 is
not accepted. [(a) is false, is false] 1001 is accepted [ (c) is false ]
30.
Left Side Constraint of Relation = No Constraint = (min=0, max=n)

As min=0, Free Employee Allowed
Right Side Constraint of Relation = Key & Participation Constraint = (min=1,max=1)
As min=1 & max = 1, Free Dependent Not Allowed [Dependent exists only if dependent
has exactly one employee]
Dependent is a Weak Entity with pname being the partial key.
POLICY is an Identifying relationship set.
Cardinality of the Relationship Set = 1:N
Total No of Tables = 2
1. EMP(eno, ename)
2. DEPENDENT(pname, eno, age, cost) with a key=(pname, eno) and eno as foreign
referring to EMP(eno).
31.
key
The prefix binary tree constructed is given below.

100
0
f
45
55
0
25
0
c
12
30
1
1
d
12
16
c
14
0
a
5
1
b
9
CSTest ID: 162268
32.
TarGATE16
Value of f(16) = 16 + f(14)
Value of f(14) = 14 + f(12)
Value of f(12) = 12 + f(10)
Value of f(10) = 10 + f(8)
Value of f(8) = 8 + f(6)
Value of f(6) = 6 + f(4)
Value of f(4) = 4 + f(2)
Value of f(2) = 2
www.gateforum.com
Total returned value = 16+14+12+10+8+6+4+2 = 72

33.
In the first call, p=4, q=7, r=5. Also q,r are referred by y,z.
When x=4, then y=12, z=5
The values printed are: 4 7 5
In the second call, p=5, q=7, r=5. Also q,r are referred by y,z.
When x=5, then y=2 i.e. (7-5), z=5
The value printed are: 5 2 5
34.
( 643)12
( 6 12 2 + 4 121 + 3 120 )
= ( 864 + 48 + 3)
= 915
= (1,01110010011) 2 sign magnitude notation
= (1,10001101100 )2
C
37.
AWT = (0 + 3+ 7 + 11+ 25) / 5=9.2 ms
38.
1st round means n = 0 k = {0}

2nd round means n = 1 k = {0,1}
3rd round means n = 2 k = {0,1,2,3} for both A and B
TarGATE16
CSTest ID: 162268
{0,1, 2,3}
{0,1, 2,3}
the probability for no collision is
39.
www.gateforum.com
12 3
=
16 4
Semaphore = mutex
Type of Semaphore = Binary Possible Values = {0, 1}
As initial value of mutex =0, only P3 can execute and enters critical section by making
mutex=1, which will allow another process among {P1, P2, and P3} to enter the critical
section.
Maximum no of processes that can be in Critical Section = 2
40.
Exact solution :
2
2
x3
x2
2
f
(x)dx
=
(3x
+
4
x
2)
=
3
+
4
2x
0
0
2
3
0
2
= x 3 + 2x 2 2x
2
0
= 8 + 8 4 = 12
Trapezoidal rule:
x
y 2 18
,h=2
2
[(2 + 18)] = 16
0
2
Difference between trapezoidal rule value & exact value is 16 12 = 4
41.
f (x)dx =
Where t is a free tuple and d is a bounded tuple.

Where d Formulae selects t.eno, if it has atleast one dependent in DEPENDENT
relation.
42.
Given that the output sequences generated for the given circuit is 00-01-10-01.
The input x is check with options. Consider option (b). Q2+Q1.
O P sequence
Q2
Q1
i p of T F.F
T2
T1
0
0
0
1
0
1
1
1
1
0
0
1
TarGATE16
CSTest ID: 162268
www.gateforum.com
Above table describes, left hand side is the output sequence and right hand side will decide
(consider) the values. For the next O/P based on T flip-flop functionality.
T2 Q
1
0 1
Q2
0 0 1
1 1 x
If we observe above table the output sequence 11 is does not be occur. So it is dont care
x and all ready T1 is designed with NAND gate and finding the equalent ckt for T2.
So T2 may write it as (Q1+Q2)
T2 Q
1
0 1
Q2
0 0 1
1 1 x
43.
IP Address : 172.60.48.20
48.20 00110000.00010100
Subnet mask :255.255.224.0 224.0 11100000.00000000

Subnet Add :172.60.32.0
32.0 00100000.0
So, First Address is
172.60.32.1
(Assignable)
and last Address is
172.60.001 11111. 11111111

172.60.63.255
So last Assignable Address is 172.60.63.254
Assignable range is
172.60.32.1 to 172.60.63.254
44.
The first byte no is 200 8 = 1600, the total length is 200 bytes and the header length is 20
bytes ( 5 4 = 20 ) which means there are 180 bytes in this datagram. If the first byte numbers
is 1600 the last byte number must be 1779.
45.
K = 10
Q G = ( 7 + 10 ) mod 26 = 17
F = ( 6 + 10 ) mod 26 = 16 ( P )
K A = (1 + 10 ) mod 26 = 11
O = (15 + 10 ) mod 26 = 25 ( Y )
D T = ( 20 + 10 ) mod 26 = 4
R = (18 + 10 ) mod 26 = 2 ( B )
O E = ( 5 + 10 ) mod 26 = 15
U = ( 21 + 10 ) mod 26 = 5 ( E )
M = (13 + 10 ) Mod 26 = 23 ( W )
10
TarGATE16
CSTest ID: 162268
46.
www.gateforum.com
d = 9Gm
d 9 109
=
=
= 30s
T
P
v 3 108
V = 3 108 m / s
L = 32KB
32 103 8
= 8ms = 0.008s
Tx =
B = 32 Mbps
32 106
Stop & wait channel utilization ( ) =
47.
a=
TP
30
=
= 3750
Tx 0.008
1
= 0.013%
1 + 2 ( 3750 )
1
1 + 2a
The output of D-flip-flop should be 1 if P = 0 and X = 1. So the flip flop should be reset, i.e.
P = 0 and TRST = 0 to get a 0 on X.
48.
BA
00
01
11
10
C
0
1
1
The Boolean equation is, C A B + C ( A B )
49.
1.
f ( z ) = z 3z = ( x + iy ) 3 ( x iy ) = 2x + i(4y )
u = 2x; v = 4y
u
v
= 2;
= 4 i.e., C R equations not satisfied : - Not analytic
x
y
2.
f ( z ) = ( x 2 y 2 + x ) + i ( 2xy + y )
= {x 2 y 2 + i ( 2xy )} + ( x + iy )
= ( x + iy ) + ( x + iy ) = z 2 + z, is analytic everywhere
2
3.
f ( z ) = ( e x cos y y ) + i ( e x sin y + x )
= e x ( cos y + isin y ) + i ( x + iy )
= e x eiy + iz
= e z + iz, is analytic every where
11
CSTest ID: 162268
TarGATE16
www.gateforum.com
f ( z ) = xy + iy u + iv
4.
u = xy; v = y
u
v
=y&
= 1 i.e., C R equations not satisifed anywhere inz plane
x
y
u
v
= x,
= 0 : Not analytic
y
x
50.
R = {(a, b), (b, c), (b, d)}

R2 = {(a, b), (b, c) (b, d)} {(a, b) (b, c) (b, d)} = {(a, c) (a, d)}
R3 = R2 R= {(a, c) (a, d)} {(a, b), (b, c), (b, d)} =
Parallely,
R 4 = R 5 ,...... =
R + = R R 2 R 3 ...... = {(a, b), (b, c), (b, d)}
{(a,
c), (a, d)}
= {(a, b), (b, c), (b, d), (a, c), (a, d)}
Hence (a, c) and (a, d) should be added to the above relation to get the transitive closure.
52.
The number of paths of length 2 that pass through v1= the number of pairs of edges incident
on v1.
= c(3, 2) ( three edges are incident on v1 )
Similarly the number of paths of length 2 that pass through v3=c(4,2) =6
53.
We know that f ( x ) =
1
a < x < a, a > 0
2a
Given that P ( x 1) =
1
3
f ( x ) dx = 3
1
2a dx = 3
1
1
1 1
1
(x)1a = = (a 1) =
2a
3 2a
3
3(a 1) = 2a a = 3
54.
y = sin x y = cos x, y = sin x, y = cos x

All D.E satisfied by y = sin x
12
TarGATE16
CSTest ID: 162268
55.
www.gateforum.com
y
A
(0,1)
y = 1 x
R1
O
R2
(0, 1)
C
(1,0)
y = 1+ x
A = (0, 1), B = (1,0) and C = (0,-1)

Divide the region R in two sub regions R1(OAB) and R2 (OBC)
After the change of order of integration, (i.e., horizontal strip),
x limits = 0 to 1 y
for region R1
y limits = 0 to 1
x limits = 0 to y 1
and
for region R 2
y limits = 1 to 0
1
1 y
xydxdy +
y 1
1 0
xydxdy
13

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: 162268

Computer Science Engineering

4 men can go in five hotels in 54 ways.

109 110 111

CSTest ID: 162268

Area of the circle = r2

Source is M[500] Memory direct.

210 = 1024 words

divide the value of A by 2n

CSTest ID: 162268

Page size = page offset = 224 /27 = 217

It introduces an intermediate level of scheduling

CSTest ID: 162268

Total length = ( 00 F8 )H Bytes

Data length = Total packet length header length

Since 2421 is self complementing code.

Let us first create the truth table for this diagram.

Now we write out the expression.

CSTest ID: 162268

we know that in a simple graph of order n ( 2) , no of edges cannot exceed

we know that if G is a simple graph of size n is isomorphic to G then size of G is

Product of the Eigen values of R =Determinant of R = Original matrix = 0 ;

CSTest ID: 162268

A A T = 1 + cos 2 4 cos 2 = 1 + cos 4 + 2 cos 2 4 cos 2

L[t 3 sin t] = (1)3

( usin g definition of Laplace transform )

CSTest ID: 162268

Suppose string is then ( q 0 , B ) = ( q 4 , B, R )

Left Side Constraint of Relation = No Constraint = (min=0, max=n)

The prefix binary tree constructed is given below.

CSTest ID: 162268

Value of f(16) = 16 + f(14)

Value of f(14) = 14 + f(12)

Value of f(12) = 12 + f(10)

Value of f(10) = 10 + f(8)

Value of f(8) = 8 + f(6)

Value of f(6) = 6 + f(4)

Value of f(4) = 4 + f(2)

Total returned value = 16+14+12+10+8+6+4+2 = 72

AWT = (0 + 3+ 7 + 11+ 25) / 5=9.2 ms

1st round means n = 0 k = {0}

CSTest ID: 162268

the probability for no collision is

Where t is a free tuple and d is a bounded tuple.

CSTest ID: 162268

Subnet mask :255.255.224.0 224.0 11100000.00000000

So, First Address is

and last Address is

172.60.001 11111. 11111111

So last Assignable Address is 172.60.63.254

CSTest ID: 162268

The Boolean equation is, C A B + C ( A B )

CSTest ID: 162268

R = {(a, b), (b, c), (b, d)}

R + = R R 2 R 3 ...... = {(a, b), (b, c), (b, d)}

c), (a, d)}

y = sin x y = cos x, y = sin x, y = cos x

CSTest ID: 162268

A = (0, 1), B = (1,0) and C = (0,-1)

You might also like