Targate'16: Cs Test Id: 162267

TarGATE16
CSTest ID: 162267
www.gateforum.com
Answer Keys:
General Aptitude
1
0.625
10
154
Computer Science Engineering

1
10
11
12
13
14
80
15
100
16
17
18
19
10
20
431
21
22
23
24
25
26
27
28
29
30
31
5500
32
68
33
34
128
35
36
37
38
39
40
41
42
43
44
45
46
47
48
14
49
50
24
51
-2
52
53
54
55
Explanations:General Aptitude
1.
The phrase sob oneself to sleep means to cry until one falls asleep.
2.
Repudiate means abandon or discard.
3.
There is an analogy of degree given; nibble means to eat in small pieces while gobble means
to gulp down huge pieces of food. Likewise, mizzle means drizzle or light showers of rain
while downpour means heavy rains.
4.
Diameter of circle = 24-10=14cm

Radius = 7cm
Area of circle = r 2 =
22
7 7 = 154Sq.cm
7
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: 162267
5.
X
1
B
2
C
3
D
4
F
5
G
6
H
7
J
8
K
9
L
www.gateforum.com
10 11
M N
12 13 14 15 16
17 18 19 20 21
X P Q R S T X V W X Y Z
C 2
D3
F 4 2 4 = 8
G 5 3 5 = 15
B 1
X 19 1 19 = 19
8.
Let the 5 black balls be BBBBB and 3 Red Balls be RRR

They can be arranged in 8 slots _ _ _ _ _ _ _ _
in (8!)/ (5!x3!)
If the fourth slot is Black ball then the arrangement will be to fill
___B____
we have 7 slots and 4 Black (BBBB) and 3 Red (RRR)
They can be arranged in (7!)/ (4!x3!)
Hence required probability = [(7!)/ (4!x3!)] / [(8!)/ (5!x3!)]
= 5/8
9.
C done the work half of ( A + B )

A+B
..................... (1)
2
1
But given C alone work =
80
2C is the 1 days work of ( A + B )
C's one day 's work =
( A + B ) 's one day work =
1
40
( A + B + C ) 's one day work =
1
1
3
+
=
80 40 80
CSTest ID: 162267
10.
Strength of 1st Jar

60%
TarGATE16
www.gateforum.com
Strength of 2nd Jar

18%
Mean Strength
25%
35%
7%
Ratio of 1st and 2nd jar quantity = 7 : 35 = 1:5
1
Required quantities replaced =
5
1.
(i) is false because if tree with right nodes only have same inorder & preorder
(ii) is false because if tree with left nodes only have same inorder & postorder
(iii) is true
3.
1 + a 2 > 0 a aRa
1 + ab > 0 1 + ba > 0 i.e aRb bRa
R is reflexive and symmetric
1
1
1, R and , 1 R but (1, 1)

/ R.
2
2
(1 + (1)(1) = 0 >/ 0 )
5.
Pipelining improves instruction throughput.
6.
The size of instruction is equal to one word size of control memory.

Minimum bit for groups are respectively ( 4 + 4 + 5 + 5 + 3) 21 bits
8.
There is a chance of deadlock, when process switches.
10.
If grammar contain { S t} then we cant design equivalent CNF form.
12.
E E + T has left Recursion So + is left Associative

T T * F has left Recursion So is left Associative(i.e left most fistly evaluated)
13.
Divide by zero & array index out of bound is check at run time so they are dynamic
14.
Total = (n-1) ( 1 + n + .... + n h-1 + n h ) = ( n - 1)
(n
h +1
- 1)
n -1
= n h +1 - 1
CSTest ID: 162267
TarGATE16
15.
Since there are NULL values in 2 rows so average is computed by
17.
If control input is 0, then
www.gateforum.com
300
= 100
3
F1 = x y
Half adder
F2 = xy
if control input is 1, then
F1 = x y
Half substractor
F2 = xy
18.
Excitation table of T flip flop
D Qn
0 0
0 1
1 0
1 1
Q n +1
0
0
1
1
T
0
1
1
0
T = D Qn + D Qn
= D Qn
Characteristic table of D flip flop
19.
Given Distance = 2 km
L = 100 bytes
Tp =
d 2 108 2000
=
=
106 = 10 s
v 2 108
200
RTT = 2 Tp = 20 s
Bandwidth Delay product = 100 bytes
Bandwidth =
100 8
= 10 MBps
10 106
CSTest ID: 162267
20.
TarGATE16
www.gateforum.com
Throughput of Pure Aloha = G * e(-2G) where G is the average no. of frames generated by the
system during one frame transmission time.
The maximum throughput is achieved when G=1/2. So, max throughput = 0.5(e-1) =0.184
This is the maximum utilization of the bandwidth.
Therefore total utilization of the bandwidth = 0.184 * Bandwidth of channel
No. of stations * capacity of each station = 0.184 * Capacity of channel
N*b = 0.184*B
N = 0.184*B/b
Given Channel capacity is B = 48Kbps = 48*1000bps (Data size is represented in powers of 2
and signal speed is represented in powers of 10)
Capacity of each station is b = 1024bits/50 sec
= 20.48bps
N = 0.184*48*1000bps/(20.48 bps)
So, No. of stations = 431.25 (431 approximately).
21.
SWS occurs when small amount of data re exchanges instead of fall-sized segments.
To avoid SWS
Receiver should not advertise small segments.

Sands should avoid sending small segments.
22.
The greatest element is 20

the least element is 1.
There is no element a such that
2va=20 and 2 a = 1
2 has no complement.
23.
We know that ( z + , / ) has no greatest element. so not bounded
( P(s), )
is bounded and distributive also every chain is always distribute lattice.
III only true.

24.
We have
f (t)(t a)dt = L ( f (t) ) ; where s = 0
t(t 3)dt = L(t(t 3))

0
= e3s .3 = 3 ( s = 0)
CSTest ID: 162267
25.
TarGATE16
www.gateforum.com
For x and y
V ( ax by ) = a 2 V ( x ) + b 2 V ( y ) 2ab COV ( x, y )
If x and y are independent then COV (x,y) = 0
V ( ax by ) = a 2 V ( x ) + b 2 V ( y )
26.
Graph is
V1
V1 ,V2 ,V3 ,V6 ,V4 ,V5

V2 ,V1 ,V6 ,V3 ,V5 ,V4
V3
V4
V2
V5
BFS
V2 ,V6 ,V1 ,V5 ,V3 ,V4
V6
V2 ,V1 ,V6 ,V5 ,V3 ,V4is not BFS

27.
Minimum height means complete binary tree. So

0
1
A.V.L with 7 Nodes.

Height 2
29.
Put n = 2k
T(2k ) = T(2k/2 ) + 22k
Put T(2k ) to S(K )
S(K) = S(K/2) +22k

using master
1
K log2 <22K
So ( 22K ) ( n 2 )
CSTest ID: 162267
30.
www.gateforum.com
: Let n =3, required DFA is

0
31.
TarGATE16
1
5500
R 1 5500
Ans 5500
32.
11
block offset
TAG
Bytes
11
24
LineNo log 2 2 log 2 ( 22 ) 2bit
2
Tag entry tag bit + (valid/invalid + 4 Modified bit)
7 + 2 + 4 2 17bit
Tag Array = Tag entry No of lines.
17 22 68bits
33.
16M 8bit
= 6DRAM required to design M.M
1M 8bit
Refresh time for one DRAM 2K 1ns
So refresh time for complete M.M 32Kns
TarGATE16
CSTest ID: 162267
L.A.S = 32 MB= 225

P.A.S = 512 MB= 229
Number of pages = 8K = 213
Page size = frame size = 225 / 213 = 212
Number of frames = 229 / 212 = 217 = 128K
Inverted page Table, The number of entries in page table=
34.
www.gateforum.com
number of frames
=128K
35.
FIFO
3
F1
F2
F3
F4
F5
F6
F7
F8
F9
F1
F2
F3
F4
F5
F6
F7
F8
F9
MM = 3
PF = 9
MM = 4
37.
For I/P 0010 Machine Halt at Final state
40.
Let n(A)=m, n(B)=n

n ( P(A) ) = 2m and n ( P(B) ) = 2n.
CSTest ID: 162267
TarGATE16
www.gateforum.com
Given n ( P(A) ) = n ( P(B) ) + 15
2m = 2m + 15 2m 2n = 15
m = 4, n = 0
41.
Print i
100
10
i = 100
g()
i = 10
main( )
f()
Print
(i)
g()
42.
Precedence graph for the given schedule is
T
1
T
2
T
3
44.
We know that in ( Z6 ,+ 6 ) , 0 is the identity element and 2 + 6 4 = 0, 4 + 6 2 = 0

4 is the inverse of 2.
45.
O P for M1 : 101101 (Read from LSB to MSB)

O/P of M1 : -
111010
Now O/P of M1 is used as I/P for M2

TarGATE16
CSTest ID: 162267
www.gateforum.com
111010 ( Re ad from MSB to LSB )
O P of M 2 : 111101
46.
(2)
(1)
Qn
Qn
JK
Qn
Qn
Qn
JK
Qn
Qn
Qn
Clock
Clock
For SR flip-flop S=R=1 will never occur, hence it can be used as slave
47.
x
0
0
0
0
y Qn
0 0
0 1
1 0
1 1
1
1
1
1
0
0
1
1
0
1
0
1
Q n +1
1
0
1
1
0
0
0
1
S R
1 0
0 1
1 0
x 0
0
0
0
x
x
1
x
0
R
yQ n
00
0
01
11
10
S = x Qn
= x + Qn
yQ n
00
11
10
0
1
01
R = y Qn
= y + Qn
S = x + Qn , y + Qn
48.
P=3, q=11, e=l=7, m=5, d=?

n=pq=33
10
CSTest ID: 162267
TarGATE16
www.gateforum.com
(n) = (p 1)(q 1) = 2 10 = 20
ed = 1mod (n)
7 d = 1 mod 20
So (d=3)
Choose lowest value that satisfies the condition.
Now
C=Me mod n= 57 mod 33
c = 14
49.
Option( A) is True, Since In packet switching resources are allocated only on demand,
whereas in Circuit Switching resources are reserved in advance.
Option (B) and Option C) are True, Since in Packet Switching routing has to be done for
every packet, where as in Circuit Switching routing will be done only once during circuit
setup.
50.
Header length field is 7.

So Header length is 7 4 = 28 bytes
20 bytes Header is fixed
8 Bytes is part of option and padding.
Out of 8 bytes 5 bytes are option
3bytes are left for padding that means 24 bits
51.
Let e be the identity element

a *e = a
a +e+2=a
e = 2
52.
We know that every graph with n vertices and m edges has atleast n-m components
The given graph has atleast 5 components.
53.
0 2 3
Let A = 2 0 8
3 8 0
The characteristic equation of A is 3 + 77 = 0 = 0; i 77
The incorrect statement is option (c)
11
CSTest ID: 162267
54.
TarGATE16
www.gateforum.com
We have the set of functions {f(x),g(x),h(x)} are linearly dependent solutions, if their
f (x) g(x) h(x)
Wronskian is zero i.e., f '(x) g '(x) h '(x) = 0
f ''(x) g ''(x) h ''(x)
From the options, the set of functions
{e x ,ex ,cosh x} are linearly dependent, sin ce their wronskian = 0.
55.
Given triple integral =
x =1
1
dz dydx
y=0
z = 0 (x + y + z)
1
=
dydx
x =1 y = 0 2(x + y + z) 2
0
2
x =1 y = 0
1
1
+
dydx
2
2
2(x + y)
2(x + y + 1)
1
1 2
1
1
1 2 1
1 1
1
dx =
=
dx
2 x =1 x + y + 1 x + y y = 0
2 1 x + 2 x + 1 x + 1 x
1
2
( ln(x + 2) 2 ln(x + 1) + ln x )1
2
1 32
= ln
2 27
=
12

Targate'16: Cs Test Id: 162267

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: Cs Test Id: 162267

Uploaded by

Copyright:

Available Formats

TarGATE16

CSTest ID: 162267

Computer Science Engineering

Repudiate means abandon or discard.

Diameter of circle = 24-10=14cm

CSTest ID: 162267

Let the 5 black balls be BBBBB and 3 Red Balls be RRR

C done the work half of ( A + B )

( A + B ) 's one day work =

( A + B + C ) 's one day work =

CSTest ID: 162267

Strength of 1st Jar

Strength of 2nd Jar

1, R and , 1 R but (1, 1)

Pipelining improves instruction throughput.

The size of instruction is equal to one word size of control memory.

There is a chance of deadlock, when process switches.

If grammar contain { S t} then we cant design equivalent CNF form.

E E + T has left Recursion So + is left Associative

Total = (n-1) ( 1 + n + .... + n h-1 + n h ) = ( n - 1)

CSTest ID: 162267

Since there are NULL values in 2 rows so average is computed by

If control input is 0, then

Characteristic table of D flip flop

CSTest ID: 162267

Receiver should not advertise small segments.

The greatest element is 20

We know that ( z + , / ) has no greatest element. so not bounded

is bounded and distributive also every chain is always distribute lattice.

III only true.

f (t)(t a)dt = L ( f (t) ) ; where s = 0

t(t 3)dt = L(t(t 3))

CSTest ID: 162267

V1 ,V2 ,V3 ,V6 ,V4 ,V5

V2 ,V6 ,V1 ,V5 ,V3 ,V4

V2 ,V1 ,V6 ,V5 ,V3 ,V4is not BFS

Minimum height means complete binary tree. So

A.V.L with 7 Nodes.

S(K) = S(K/2) +22k

CSTest ID: 162267

: Let n =3, required DFA is

CSTest ID: 162267

L.A.S = 32 MB= 225

For I/P 0010 Machine Halt at Final state

Let n(A)=m, n(B)=n

CSTest ID: 162267

Given n ( P(A) ) = n ( P(B) ) + 15

Precedence graph for the given schedule is

We know that in ( Z6 ,+ 6 ) , 0 is the identity element and 2 + 6 4 = 0, 4 + 6 2 = 0

O P for M1 : 101101 (Read from LSB to MSB)

Now O/P of M1 is used as I/P for M2

CSTest ID: 162267

111010 ( Re ad from MSB to LSB )

P=3, q=11, e=l=7, m=5, d=?

CSTest ID: 162267

Header length field is 7.

Let e be the identity element

CSTest ID: 162267

Given triple integral =

You might also like