Sunteți pe pagina 1din 7

CSTest ID: 2260 Free Sample Test www.gateforum.

com
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.
1
Answer Keys
1 D 2 A 3 D 4 D 5 C 6 C 7 B
8 C 9 C 10 B 11 C 12 D 13 D 14 A
15 B 16 D 17 D 18 50 19 6 20 16 21 31
22 15 23 A 24 B 25 B 26 A 27 B 28 D
29 C 30 D 31 B 32 A 33 C 34 5 35 1712
36 5 37 5 38 0 39 C 40 C 41 C 42 C
43 C 44 A 45 D 46 414 47 511 48 B 49 C
50 A 51 A 52 C 53 A 54 A 55 C 56 D
57 A 58 B 59 D 60 C 61 A 62 B 63 A
64 C 65 D
Explanations:-

1. Find the largest element which needs n-1 comparisons
Discard the largest element
Again find the largest element which needs n-2 comparisons
Total comparisons= n-1+n-2=2n-3

2. Apply case (i) of Masters theorem

3. 3-SAT is NP-Complete, so it is NP, NP-Hard and also NP complete

4. From the given options except Merge sort, all others have
( )
2
O n in the worst
case, whereas Merge sort has
( )
O nlogn in the worst case.

5. For each of the n times of outer loop, inner loop executes log n times. Hence
O(n logn)

7. abS will give
( )
ab * sequence, baS with give
( )
ba *, so it generates
( )
ab ba * +

8. Recursive enumerable languages are not closed under complementation but
recursive languages are closed.

11.





1 0
A A
1 0
B B
00 01 11 10
00
01
11
10
1 1 1
1 0
1
0 1 1
1
1 1
0 0 0
0
CSTest ID: 2260 Free Sample Test www.gateforum.com
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.
2

( ) ( ) ( )
1 1 1 0 0 0 1 0
F A B A A B A B B = + + + + +

12. C of first HA : xy
"S" of sec ond HA : xy z
( )
xyz x y z xyz xz yz = + + = + +

14.
9
9
10 1
ns ns
5 5 10
=



15. II: not possible since x can be printed at most 4 times
IV: not possible since consecutive z cannot be printed

16. Frame transmission time: 1 ms
The first frame is transmitted at t = 1ms. The first frame reaches the destination
at t = 251 ms.
The transmission time of acknowledgement frame is 1 ms
The acknowledgement frame arrives at source at t 251 251 502ms = + =

3
Total 2 1 7 = frames are sent in 502ms.
Channel utilization
7
100% 1.4%
502
=

17. 212.88.22. 00000001


18.
( ) ( )
n S s 150 16 12
S 16, s 12,n 150 undet ected errors 50
s 12

= = = = = =
19.
( )
( )
( )
( )
n
n n 1
E G E G E K 8 7 n 6
2

+ = + = =


20. AF is the only candidate key of R. Any superset of {A,B,C,D,E,F} containing AF
will form superkey. Hence number of superkeys =2
4
=16

21.
1 2 3 4 5
C C C C C
Required number of ways is 5 5 5 5 5 31 + + + + =


22. Number of perfect matchings of
( )
2n n
2n !
6!
K 15
8 3! 2 n!
= = =



24.
( )
( )
n t
n 1 n
n
f x
Let x a x x
f x
+
= =

( )
( )
( )
t
t n
n t 1
n
t t
t n n
t 1
n
t
n t 1
t 1
n
x a
x a x
t x
t x x a
f x x a
t x
x t 1 a
f ' x t x
t x

= =
+
= =
+
= =

CSTest ID: 2260 Free Sample Test www.gateforum.com
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.
3
25.
( )
( )
-1 -1
1
-1
1 1
Let x,y G; Given, x x and y y
xy G by closure property
Now, xy xy x x
y x xy xy = yx xy = yx x,y G


= =

( = =

=


Hence,
( )
G, is an abelian group.

26. Only
2 4
L and L can be accepted by PDA

27. The probability that contention ends at round 4

( ) ( )
( ) ( )
3
i 1 3
i 1
2 3 6
1 1
1
2 2
P collision at round 1 P collision at round 2
P collision at round 3 P no collision at round 4
1 1 1 7 7
1 1
2 64 2 2 2

=
(
(
=
(
(

=

| |
= = =
|
\



28. According the traversal given in option(D), 55 is at right sub tree of 65 which
violates the BST condition.

30. For loop will never be executed and there wont be any error, hence no output.

31. FA of TM given is




33. Exponential operator has higher precedence than multiplication. Exponential
operator is right associative where as multiplication is left associative.

34.



Waiting time for P3 is (11-6) = 5ms

35. 1500+[(5-1)*(5-(-5)+1)+4-(-5)]*4=1712

36.





1
q
2
q
1
0
1
0
q
0
a
a
b c
c
c
a
b, c
a| b
a| b | c
b
P1

P2

P1

0

P3

5

9

11

16

RR:

P3

18

CSTest ID: 2260 Free Sample Test www.gateforum.com
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.
4
37. m-n+1 = 13-9+1=5 where m is number of edges(links) and n is number of
vertices(stations)

38. Here, x and y are two eigen vectors of matrix corresponding to different eigen
values. x and y follow the property that
T
x y 0 = , which can be verified as follows:

( ) ( )
1 2
2 3
0
3 6
2 6 9 0
3, 7

=

+ =
= =

Eigen vector corresponding to
1
is

1
2
1 2
a 1 3 0
3 9 a 0
a 3a
3t
x , t R
t
( ( (
=
( ( (


=
(
=
(


Eigen vector corresponding to
2
is

1
2
1 2
a 9 3 0
3 1 a 0
3a a
s
y , s R
3
s
( ( (
=
( ( (

=
(

(
=
(
(


Take values of t and s and verify
T
x y 0 =

40.
9 3
9 months yrs yr
12 4
=

( ) ( )
3 3
4 4
2
0 0
3 2 2
P t t 3 t dt 3t t dt
4 9 9
(
| | (
< = =
| (
\
(




3
2 3
4
0
2 3t t 2 3 9 1 27 2 45 10 5
9 2 3 9 2 16 3 64 9 64 64 32
(
(
= = = = =
(
(



The expected number of children under 9 months
5
160 25
32
= =

41.
( )
( )
( ) ( )
( ) ( )
Given: a,b R a is a factor of b
a,a R, since a is a factor of a; R is reflexive
a,b R but b,a R, since if a is a factor of b, b is a
multiple of a but not factor. R is not symmetric
But a,b R and b,c


( )
R, then a,c R. R is transitive

CSTest ID: 2260 Free Sample Test www.gateforum.com
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.
5
42.
( ) ( )
ABC CDE C C
+ +
= = . Hence lossy. B D & E A are lost

43. It is allowed under MVTS, but
2
T is rolled back under TWR and BTS.

44. Number of sets =
64
16
4
=
Word offset=7 bits, Set offset=4 bit, Tag offset=19-(4+7)=8 bits

46. Step1: Sort the file sizes in ascending order.
Step2: Repeat the following until there is only one file:
a. Take first two elements(smallest) X and Y.
b. Merge X and Y and insert this new file in the sorted list.

47.
s e m
0 1 0 0 1 0 0 0 1 1 1 1 1 1 1 1



( ) ( )
( ) ( )
( )
2 10
8
2
10
8 8 9
e 1001000 72
original exponent 72 64 8
original mantissa 1.11111111 2 2
The corresponding decimal number is 2 2 2 2 1 511

= =
= =
= =
= + = =

48, 49.
Excitation table of the flip-fop
( ) ( )
Q t Q t 1 +
A B
0 0
0 1
1 0
1 1

X 0
X 1
0 X
1 X


( )
2 1
P.S.
Q Q

( )
2 1
N.S.
Q Q
+ +

2 2 1 1
FF inputs
A B A B

1 0
0 1
1 1

0 1
1 1
1 0

0 X X 1
X 1 1 X
1 X 0 X








1
Q
1
0
1 0
2
Q 0 1
X X
1
Q
1
0
1
0
2
Q 0 1
X
X
2 1
A Q =
1 2
A Q =
CSTest ID: 2260 Free Sample Test www.gateforum.com
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.
6
50. 100 10 128 8 128 4 129028 + + =

51. 51 10 128 0 128 5 65285 + + =

52 & 53. Total number of bits used to store the data in the original file is
160 3 480 =

Letter Code
a 0011
b 00101
c 00100
d 000
e 01
f 1
After encoding, the file size is
10 4 6 5 3 5 15 3 43 2 83 1 299 + + + + + =
Number of bits saved = 480-299=181
% of space saved =
181
100 37.7
480
=

54 & 55 We know that,
( )
5
i
i 1
P x x 1
=
= =

1
k 2k 3k 4k 5k 1 k
15
+ + + + = =
Now,
55
mean 1 k 2 2k 3 3k 4 4k 5 5k 55k 3.67
15
= + + + + = = =
Variance =
( ) ( ) ( )
2
2
E x E x

( )
2 2 2 2 2
1 k 2 2k 3 3k 4 4k 5 5k = + + + + -
( )
2
3.67 1.53 =

60. l-------D--------l---L/3--l------2L/3-------l
Initial position Tunnel initial pos. Tunnel
of train end 1 of man end 2

Now, from the given information

D L / 3 D+L 2L / 3
1, and 2
60 s 60 s
20L
L
20L 2L / 3
3s
D
3s 60 s
Solving, we get s = 20 kmph
= =
+
=> = => =

61. Split 36 into 3 factors. When we add all the 3 factors, what we find is all the sums
are uniquely different except 2 combinations that give 13. They are 6, 6,1& 9,2,2
160
77
34
19
9
f 83
e 43
a 10
c 3 b 6
d 15
1
1
1
1
1
0
0
0
0
0
CSTest ID: 2260 Free Sample Test www.gateforum.com
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.
7
62. Let us assume x and y are total no. of students from BTech and MSc background
respectively

75000x 75000y 81000x 45000y 6000x 30000y
x
5 x 5y
y
5 250
Percentage with BTech 100 83.33%
6 3
1
Percentage with MSc 100 16.67%
6
+ = + =
= =
= = =
= =


63. Percentage growth in FDI in 2005 (over 2004)

500 350 150
( )X100 x100 42.8%
350 350

= =
Percentage growth in FDI in 2005 (over 2004

250 175 75
( )x100 x100 42.8%
175 175

= =
Hence change in the both growth rates = 0
(Even if we take the FDI in 2002 as 80, the final change in growth rates would
come to ~4% which is closer to 0.

64.








100 24 = 76 had read at least one issue. If x people read all the three papers,
then
( )
8 x people read only the TOI and ET papers. 23 people read the TOI but
not the Hindu
18 8 x 23 x 3 + = =

18
10 x
8 x
x
ET 48 =
= TOI 28
Hindu

S-ar putea să vă placă și