Gate CN

TarGATE16
CSTest ID: 162266
www.gateforum.com
Answer Keys:
100
10
71
10
11
12
13
14
15
35
16
17
18
19
20
21
22
23
24
25
26
1024
27
3.936
28
24
29
30
31
32
33
34
35
36
37
38
39
40
41
10000000
42
43
44
45
46
47
48
49
50
51
52
53
54
55
13
Explanations:1.
59 59 = 3481
60 60 = 3600
Required number = 3600 3500 = 100
2.
log 27
2 = 27log 2
= 27 0.3010 = 8.127
Number of digits = 8 + 1 = 9
6.
Number of ways of selecting 5 different letters = 5c5 = 1

Number of ways of selecting 2 similar & 3 different letters = 4c1 4c3 = 16
Number of ways of selecting 2 similar letters + 2 more similar letters and
1 different letter = 4c2 34 = 18
Number of ways of selecting 3 similar letters and another 2 other similar letters = 3c1 3c1 = 9
Number of ways of selecting 4 similar letters and 1 different letter = 2c1 4c1 = 8
Number of ways of selecting 5 similar letters = 1c1 = 1
Total number of ways = 1 + 16+18+18+9+8+1 = 71
7.
While buying
He buys 1100 grams instead of 1000 gms.
Suppose he bought 1100 grams for Rs. 1000
While selling
He sell only 900 grams when he takes the money for 1 kg.
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: 162266
www.gateforum.com
Now as per question he sells at a 8% profit. (20% markup & 10 % discount)

Hence his selling price is Rs.1080 for 900 grams, to calculate profit percentage we will equate the
money.
1100 grams for Rs. 1000 (Buying)
1188 grams for Rs. 1080
900 grams for Rs. 1080 (selling)
288
= 32%
Hence profit % =
900
8.
Rakeshs birthday has to fall between the 12th & the 28th of July. Anil remembers it to be after
the 20th, while Rahul remember it to be before the 22nd . Hence to satisfy both conditions,
simultaneously, Rakesh birthday must be on the 21st of July.
1.
A.M.
opcode
Address
32 bit
32 Add. mod e 25 5bit for A.M.

100 one A.I. 27 7 'bit for opcode
20
32 bit
No. in 7 bit we can store 27 = 128 operation 100 1 Add. So 28 is free and for zero Add. We
Need not any Address field so we can use extension opcode technique & share opcode also in
add.
So No of zero A.I. 28 2 20 instruction
2.
All statements are correct.

Anti dependency WAR true dependency RAW
O P dependency WAW
3.
Complexity of heap sort in all cases ( n log n ) .

{n = No of elements.
TarGATE16
CSTest ID: 162266
www.gateforum.com
So for n log n it would be
n log n log ( n log n )

n log n [ log n + log log n ]
n ( log n ) + n logn * log logn
2
n ( logn )
4.
a,b,c all are true.
5.
Right Skew BST

A
In order = ABCD
Preorder = ABCD
Post order = DCBA
6.
Code segment of thread is same as Processs code segment
7.
( P0 ,
P1 ,
P0 , P1 , P2 , P3 , P2 , P3 )
RR2
PO
0
P1
2
PO
4
P1
5
P3
P2
7
P2
11
P3
13
14
Total context switching = 7 (lst & last is ignored)

8.
Always process Q at least runs two time then process P can run one time so all combination are
first 8 letter of o/p.
CSTest ID: 162266
9.
TarGATE16
www.gateforum.com
Expression can be reduced to
F1 = AC + AB
F2 = AB + BC + CA
F3 = BC + AB
10.
YZ
00
WX
00
01
11
1
10
1
01
11
10
13.
{AD}
1
1
is c.k So A & D are
Prime Attribute
A C
has partial functional dependency so not in 2NF
D B
14.
option (d) is not commutative
since a * b = a b b a = b *a
a * (b * c) = a * (b c) = a (b c) = a b + c
(a * b) * c = (a b) * c = (a b) c
(a * b) * c a * (b* c)
not associative
15.
O(a)=f O(b) = 5 O (ab) =35
16.
the sum of degrees = 14

= 2 no of edges
No of edges =7.
17.
A B A|A &B|B
B B# B | C@ B | C
Ci
CSTest ID: 162266
TarGATE16
www.gateforum.com
&
(# > & )
18.
(i) Null is used to represent a missing value, but that it usually has one of the three different
interpretations value unknown (Exits but is not known), value not available (exists but is
purposely with held) or attribute not applicable (undefined for this tuple)
It is often not possible to determine which of the three meaning is intended; for example, a NULL
for the home phone of a person can have any of the three meanings. Hence, SQL does not
distinguish between the different meanings of NULL.
(ii) SQL allows a table (relations) to have two or more tuples that are identical in all their
attribute values. Hence in general an SQL table is not a set of tuples because a set does not allow
two identical members, rather it is a multiset of tuples.
19.
Only S is true and R is false. Because in ripple carry adder sum bit is not valid until carry bit of
all the preceding stages to generate. That is why it is slower than look ahead carry adder.
21.
In Ethernet Manchester encoding, the relationship between bit rate and baud rate is,
baud rate = 2 Bit rate
Given bit rate = 10 Mbps
Baud rate = 2 Bitrate = 2 10 Mega = 20Mega baud
22.
HLEN = 1010 the HLEN value is (10)10, which means the total no. of bytes in the header is
10 4 = 40 bytes Among these, the first 20 bytes are the base header and the rest 20 bytes are
options.
23.
a ii,
b iii, c v, d i
( a ii )
Physical, Data Link layer and NL are referred as network friendly layers
( b iii )
Application, presentation and session layers are referred as user friendly layers
(d i)
A transfer layer is responsible for process to process delivery.
TarGATE16
CSTest ID: 162266
24.
www.gateforum.com
Add the 1st column to the 2nd column, then

1 1
2
5
3 2
15 9 5
Now subtract the 3rd row from the 1st row, then
17 10 6
5
3 2
15 9 5
Determinant of resultant matrix = 17 [ 15 + 18] 10 [ 25 + 30] + 6 [ 45 + 45]

= 51 50 = 1
25.
(B) We have L [ f (t)(t a)] = e as .f (a)

L t 2 (t 2) = e2s .4
26.
Size of Micro instruction = 1 word of memory
flag
condition
e.c.s
C.S.
Address
32 bit
32 flag condition so 5 bit req. 128 C.S so in vertical microprogramming we use decoder. So we
need 3/p of 7bit 1024 words so Address is 10 bit long.
5
.c.s
10
32
bits for E.C.S is (32 ( 5 + 7 + 10 )) = 10

So 210 1024 extra control signal.
27.
Branch penalty for conditional branch

Whose satisfy the conditional is 3 C.C
Whose not satisfy the condition is 2 C.C
TarGATE16
CSTest ID: 162266
www.gateforum.com
100% instn
70%
30%
( 0.7 *1)
60% 0.6*0.3* (1 + 0 )
40%
60%
40%
( 0.3 0.4 0.4 (1 + 2 ) )
( 0.3 0.4 0.6 (1 + 3) )
So Average C.C. required to execute one instruction is
0.7 *1 + 0.3 0.4 0.6* ( 4 ) + 0.3 0.4 0.4*3
+0.3 0.6*1.
0.7 + 0.288 + 0.144 + 0.18
1.312 C.C.
1C.C. is equal to (set to maximum delay)
1.C.C. = 3.n s.
Time to execute 1 instruction 1.312 *3ns
3.936 ns .
time to execute 109 instruction
3.936 109 n sec
So 3.936 sec
28.
Size of Tag entry Tag bits + modified bits + Valid/Invalid bits.

20
Tag
8
Set No
4
Offset
32 bit
offset line size 8 2 = 16byte = 2

4 bit long.
circle size
Set No. log 2
line size * No. of way

TarGATE16
CSTest ID: 162266
www.gateforum.com
214
log 2 4 2 8 bit
2 *2
Tag entry = 20 + 2 + 2 24 bits
29.
Front
Rear
Item X
P
1
5
2
31.
Tree is
A
B
Pre order is ABFCDE

32.
output is aK.
33.
The value is increase by one only when right child is not NULL.
34.
No. of address in block
2kB
29 address
4B
Total size of file is

8 direct block + 1 singly indirect block + 1 doubly
Size + 1 triply.
8 direct block So 8 2kB = 16B
1 singly indirect so 29 2kB 1MB
1 doubly indirect so ( 29 ) * 2kB 512 MB
2
TarGATE16
CSTest ID: 162266
www.gateforum.com
1 triply indirect so ( 29 ) * 2kB 256 GB

3
So size is (16kB + 1MB + 512MB + 256GB )
Approximate ( 256 GB)
35.
Physical Add log 2 ( 221 ) 21bit

Logical is also 21 bit
P.N
Offset
10
11
lA = 2 1
21
Offset log 2 ( 210 ) 10 bit

So in logical Add. First 11 bit represent P.N. So in decimal it is 4.
In table Page NO. 4 is store at frame No. 650
So P.A is Frame No offset
01010001010 0111011010
F.N. 650
offset
37.
All string generated by (b) is accepted by DFA & Vice versa is also true.
38.
L1 is C.F.L, L2 is Recursive language L3 is R.L.

Now ( L 2 L3 ) ' also Recursive
So, ( L2 L3 ) ' L1 ( L 2 L3 ) ' L'1
Re c. lang Re c. lang
Is also Recursive lang
So L is Recursive
CSTest ID: 162266
39.
40.
TarGATE16
www.gateforum.com
Triple is
1
(1)
( 2)
( 3)
Assume string is aacaa
E.len = 3 + 2 = 5
E.len = 1 + 2 = 3
E.len = B.len = 1
B B.len = 0 + 1 = 1
B B.len = 0
So total 5 i.e. No of terminals.
41.
1 index is (16 + 4) bit long
2000
100 index in one block.
20
So for storing 109 index we require.
So we can store
109
10000000
100
So 10000000 blocks.
42.
Here aggregate function count should be performed on Sid but not on Sname as Sid is the primary
key.
10
CSTest ID: 162266
43.
TarGATE16
www.gateforum.com
1 1 1 1
[ AB] = 1 2 4
1 4 10 2
Applying R 2 R 2 R 1 ; R 3 R 3 R 1
1 1 1 1
= [ AB] ~ 0 1 3 1
0 3 9 2 1
Applying R 3 R 3 3R 2 , then
1 1 1
1
1
[ AB] ~ 0 1 3
0 0 0 2 3 + 2
( A ) = 2 and ( AB) = 3 if 2 3 + 2 0
( A ) ( B ) if 2 3 + 2 0
The given system has no solution if 1, 2
44.
Let A and A x are two productions

First ( A ) = First ( ) First ( x )
First ( ) contains in First ( A )
45.
Difference = X Y
Borrow = XY
46.
( 0 BA ) + ( 0.B A ) + BA + AB = F
47.
Given L = 2kB
L
2 10 3
= 200msec
Tn = =
B = 10KBPS
B 10 103 3
R = 100m sec Tp = 50 msec a =
Tp
Tn
50ms 1
= = 0.25
200ms 4
n = 50%
11
TarGATE16
CSTest ID: 162266
Go back efficiency =
www.gateforum.com
w
2a + 1
1
w
=
2w = 2 ( 0.25 ) + 1
2 2a + 1
2w = 1.5
1.5 15 3
=
= = 0.75
2 20 4
2n 1 = 0.75 / 2
w=
2n = 1.375 2n = 21 (approx)
n =1
48.
Given IP Address SID 192.168.1.13

Subnet Mask Address 255.255.255.248 255.255.255.11111000
_________________
192.168.1.8
_________________
The length of subnet ID 5-bit and number of subnets = 2n = 25 = 32
49.
Total data sent is (15 3 + 6 2 + 5 3) = 72 Mb during (3 + 2 + 2 + 2 + 3) = 12seconds . So,

output data rate is
50.
72
= 6 Mbps
12
Subnet mask for given network is
11111111.11111111.11110000.00000000
255.255.240.0
Network Address for given subnet is
10101100.00010000.10110000.00000000
172 .16. 176. 0
Broad cast address can be generate by placing 1s for all the host id bits
10101100.00010000.10111111.11111111
Host ID
Net ID
172 . 16.
191.
255
12
CSTest ID: 162266
51.
TarGATE16
www.gateforum.com
(A) = 8, = 4
We know that
Z =
58
P ( x 5) = P Z
= P ( Z 0.75 )
4
< 0.5 (from diagram)
0.5
x =5
Z = 0.75
52.
x =8
Z=0
(D) since e x cos x and e x sin x are L.I solutions of

the D.E y + py + qy = 0 ...(1)
C.Fof (1)is e x [ c1 cos x + c 2 sin x ]

1 i i are the roots of the A.E
D.E is y y{(1 + i) + (1 i)} + {(1 + i)(1 i)} y = 0
sec ond order

y 2y + 2y = 0
p = 2, q = 2.
53.
we know that no of vertices is K m,n = m + n

and no of edges in K m,n = mn
11 and 30 is correct answer.
54.
We know that in a simple graph of order n ( 2) , no of edges cannot exceed
n(n 1)
.
2
13
CSTest ID: 162266
TarGATE16
In a graph of order 5, no of edges cannot exceed
www.gateforum.com
1
5(5 1) = 10
2
I only true.
55.
n(R) = 20, n(P) = 17, n ( R P ) = 24

n ( R P ) = 20 + 17 24 = 13
14

Gate CN

Загружено:

Сведения о документе

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Gate CN

Загружено:

Авторское право:

Доступные форматы

TarGATE16

CSTest ID: 162266

Number of ways of selecting 5 different letters = 5c5 = 1

CSTest ID: 162266

Now as per question he sells at a 8% profit. (20% markup & 10 % discount)

32 Add. mod e 25 5bit for A.M.

All statements are correct.

Complexity of heap sort in all cases ( n log n ) .

CSTest ID: 162266

So for n log n it would be

n log n log ( n log n )

a,b,c all are true.

Right Skew BST

Code segment of thread is same as Processs code segment

Total context switching = 7 (lst & last is ignored)

CSTest ID: 162266

Expression can be reduced to

is c.k So A & D are

option (d) is not commutative

O(a)=f O(b) = 5 O (ab) =35

the sum of degrees = 14

CSTest ID: 162266

A transfer layer is responsible for process to process delivery.

CSTest ID: 162266

Add the 1st column to the 2nd column, then

Determinant of resultant matrix = 17 [ 15 + 18] 10 [ 25 + 30] + 6 [ 45 + 45]

(B) We have L [ f (t)(t a)] = e as .f (a)

Size of Micro instruction = 1 word of memory

bits for E.C.S is (32 ( 5 + 7 + 10 )) = 10

Branch penalty for conditional branch

CSTest ID: 162266

( 0.3 0.4 0.6 (1 + 3) )

So Average C.C. required to execute one instruction is

0.7 *1 + 0.3 0.4 0.6* ( 4 ) + 0.3 0.4 0.4*3

3.936 109 n sec

Size of Tag entry Tag bits + modified bits + Valid/Invalid bits.

offset line size 8 2 = 16byte = 2

line size * No. of way

CSTest ID: 162266

Pre order is ABFCDE

No. of address in block

Total size of file is

CSTest ID: 162266

1 triply indirect so ( 29 ) * 2kB 256 GB

So size is (16kB + 1MB + 512MB + 256GB )

Approximate ( 256 GB)

Physical Add log 2 ( 221 ) 21bit

Offset log 2 ( 210 ) 10 bit

L1 is C.F.L, L2 is Recursive language L3 is R.L.

CSTest ID: 162266

Assume string is aacaa

So total 5 i.e. No of terminals.

1 index is (16 + 4) bit long

CSTest ID: 162266

Let A and A x are two productions

CSTest ID: 162266

Given IP Address SID 192.168.1.13

Total data sent is (15 3 + 6 2 + 5 3) = 72 Mb during (3 + 2 + 2 + 2 + 3) = 12seconds . So,

Subnet mask for given network is

CSTest ID: 162266

< 0.5 (from diagram)

(D) since e x cos x and e x sin x are L.I solutions of

C.Fof (1)is e x [ c1 cos x + c 2 sin x ]

sec ond order

0.7 1 + 0.3 0.4 0.6 ( 4 ) + 0.3 0.4 0.4*3