CS GATE Paper 2009

Answer Keys 1 8 15 22 29 36 43 50 57 A C C C D C B B D 2 9 16 23 30 37* 44* 51 58 A A D D A B/C A/B C 3 10 17 24 31 38 45 52 59 C C B B B D B 4 11 18 25 32 39 46 53 60 D C B D C B B C D 5 12 19 26 33 40 47 54 B B A B A C 6 13 20 27 34 41 48 55* A B C C A

www.gateforum.com

7 14 21 28 35 42 49 56

C C

D A B C B

A/D

Explanations:4.

( x, y ) R but ( y, x ) R
R is not symmetric.It is also not antisymmetric
1 2 1 7 111

5.
2

(1217)8 = (028F )16

F

0 0 1 0 1 0 0 0 1

7. 8.

256 8 K = 64 32K 1
cd ab
ef
gh
ik

22.

c*c = b

c*c*c = b*c = d c *c *c *c = d*c = a c * c * c * c * c = a* c = c c is generator Similar d * d = b d*d*d = b*d = c d*d*d*d = c *d = a d* d* d* d* d = a* d = d d is another generator

All rights reserved by GATE Forum Educational Services Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission. Discuss this questions paper at www.gateforum.com. Page 1 of 4

CS GATE Paper 2009

4

www.gateforum.com

25.

1 + tan x dx
0

1 tan x
4

I=

cos x + sin x dx
0

cos x sin x

Let cos x + sin x = t

( sin x + cos x ) dx = dt

I=

dt 4 = lnt t 0
0 4

= ln ( cos x + sin x ) = ln 2 = 1 ln2 2

27.

0 /1 1/0

00
1 /1 1 /1 1 /1

01

0 /0

11
0/0

10

28.

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 I1 F F D E W I2 F D D D E E W W
I3

F F

I4
S1 = Fetch (F )

E D D

W W W E W W

15 2 = 30 (for i = 1 & i = 2)

S2 = Decode (D)

S3 = Execute (E)

S4 = Write back ( W )

All rights reserved by GATE Forum Educational Services Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission. Discuss this questions paper at www.gateforum.com. Page 2 of 4

CS GATE Paper 2009

29. Total 4 sets are there in the cache and each set contains 4 blocks 0 48 4 32 set0 8 216 92 1 133 set1 73 129

www.gateforum.com

set2 255 155 3 set3 159 63

4
6 7 10 15 19 20 34 50 73

31.

Total 119 moves 35. 36. Applying Masters theorem

0 1

4 5

12 13 2 3 23 5 18 15

12 mod 10 = 2; 13 mod 10 = 3;

18 mod 10 = 8

(2 + 1) mod 10 = 3 ( collision ) (u sin g linear probing) (3 + 1) mod 10 = 4.Like this continue.

37. Maximum height of any AVT tree with n nodes

2 mod 10 = 2 ( co llision)

1.44 logn

n = 7, hmax
40.

1.44 log7 4

L1 I L 2 = anbnc / n 0 , which is context free but not regular

All rights reserved by GATE Forum Educational Services Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission. Discuss this questions paper at www.gateforum.com. Page 3 of 4

CS GATE Paper 2009

44.
6 3

www.gateforum.com

6
10

One split

8, 4
3, 4

6
8,10

3,6

One more split 8,10

2 1
1,2

3,6 4
8,10

51. 57.

Sector number is ( 400 20 63) + (16 63) + 29 = 505037

103 ms .......106 bits
1000 = 20bits 50 Minimum number of bits required is 5 50 " .........

60.
14
13

25

16
10 8

12

Delete 25 : Replace it by 12
12

14 13 10 8

16

After heapifying:
14 13

16

12 10 8

Delete 16:
14 13

12 10

After heapifying:
13

14 12 10

{14,13,12,8,10}

All rights reserved by GATE Forum Educational Services Pvt. Ltd. No part of this booklet may be reproduced or utilized in any form without the written permission. Discuss this questions paper at www.gateforum.com. Page 4 of 4