IVth Year – Computer Science Engineering

Section-I: General Ability

1 B 2 C 3 C 4 D 5 B 6 A 7 B

8 A 9 D 10 B 11 B 12 C 13 C 14 A

15 A 16 D 17 A 18 C 19 A 20 D

Section-II: Technical

21 D 22 D 23 C 24 D 25 A 26 D 27 A

28 B 29 D 30 D 31 A 32 A 33 C 34 A

35 B 36 C 37 B 38 C 39 D 40 C 41 D

42 B 43 C 44 A 45 B 46 B 47 C 48 B

49 D 50 D

Section-I: General Ability

1. A  {2,5,8,11,14,17,20,23,26,29.......293,296,299}
B  {3,5,7,9,11,13,15,17,19, 21, 23, 25, 27, 29,......293, 295, 297, 299,301}
C  {91, 87,....  11, 3,1,5,9,13,17, 21, 25, 29.....293, 297,301,305}
 A  B  C  {5,17, 29,....293}
 Tn  5  12(n  1)
 T1  5, T2  5  12  17, T3  29,....,Tn  293 
 293  5  12(n  1)
 288  12(n  1)
288
 n 1   24
12
 n  25
 (A  B  C)  25

2. We know that

 r 
n
  1
r   r 
2
 r  
n 1

P 1    x 1  1    1    .......  1   
 100    100   100   100   

Email: info@engineeringolympiad.in, Website: www.engineeringolympiad.in 1 of 11

IEO-2018
Partners & Sponsors:
 IVth Year – Computer Science Engineering

Where, P  Principle
r = rate of interest
x  Instalment (EMI)
n  No.of years / instalments

 
 P(1.1)4  15000  1.1  1.1  1.1  1....... 
3 2

 
 P(1.4641)  15000  4.641
15000  4.641
P  47547.9  47548
1.4641
15% rate with 2 installments, we have
x(1.15  1)  P(1.15) 2
47548  1.3225
x  P  47548
2.15
x  29247.5
 2x  58495
Difference= 60000-58495=Rs.1505

3. Percentage area which is cropped but not irrigated

= % cropped area - % irrigated area
50  30
Area which is cropped but not irrigated for Orissa=  7,50,000km 2
100
 1,50,000  1.5 lakh km2

1
4. Original capacity of work per day=
91
1 1.2
Second day (20% more)  120% of  ,
91 91
1.4
Third day and so on
91
1 100 120 140  100  20(n  1)  
    ......     1
91 100 100 100  100 
1 1
  5  6  7  ......   5  (n  1)   1
91 5 
Let x  5   n  1  n  4,
(1  2  3  4)  (5  6.......  x)  (1  2  3  4)  455

Email: info@engineeringolympiad.in, Website: www.engineeringolympiad.in 2 of 11

IEO-2018
Partners & Sponsors:
 IVth Year – Computer Science Engineering

x(x  1)
  10  455
2
x(x  1)
  465
2
x(x  1)  465  2  30  31
 x  30  n  4  30  x  n  4
 n  26
 Minimum number of days required  26

20 20
5. When A runs yards, B runs 7 yards.  When B runs 1 yard, A runs yards
3 21
33
Next, When B runs yards, C runs 15 yards
2
30
 When B runs 1 yard, C runs yards
33
Speed A 20 30 22
  : 
Speed C 21 33 21
Let t be the time taken by C to run a mile.
1
Time 
speed
Speed A 22 Time C t
   
Speed C 21 Time A 5.25
22
t   5.25  5.5min
21

6. Let the four terms of A.P be

a  3d, a  d, a  d, a  3d
Sum  4a  124  a  31
Given
T2  T3  128   T1  T4 
 a 2  d 2  128  a 2  9d 2
 8d 2  128
 d 2  16
 d  4  d  4
The four terms are 19, 27, 35, 43
Sum of 1st and 3rd terms = 19+35 =54

Email: info@engineeringolympiad.in, Website: www.engineeringolympiad.in 3 of 11

IEO-2018
Partners & Sponsors:
 IVth Year – Computer Science Engineering

7. 20% -20%
10%
30% 10%
3 : 1
4500 1500

SP  120% of 4500  Rs.5400

8. Given,
HCF of two numbers is 14.
Choose the numbers be 14a, 14b [where a & b are co-prime numbers].
14a 14b  420
 a  b  30
So possible pairs are
1, 29  7, 23 11,19  13, 17 
Highest LCM  14 13 17  3094

9. We have unlimited jewels essentially. As there are exactly 5 different gems, there are 5
possibilities for the first slot, 5 for the second, and 5 for the third slot.
5  5  5  125  Total Number of possibilities.
However, at least two gems must be different. So we subtract out the possibilities where all the
gems are the same. There are five types of gems, so there are five possibilities where all the gems
would be the same.
125 - 5 = 120. The answer is D.

10. N  200, S  56%  112

A  44%  88
R  40%  80, S  A  30%  60
S  A  S  A  S  A  112  88  60  140 ?

As N  200, max R  S  A  200  140  60

11. The clues in the question are or ignored and navigate.

12. (A) Does not mention about the psychology of understanding human relationships.
(B) Cannot weaken the statement as the children represent wide sample set
(C) If the survey is conducted on a particular and defined category of children, results may not
reflect general characteristics.
(D) No way related to the premise

Email: info@engineeringolympiad.in, Website: www.engineeringolympiad.in 4 of 11

IEO-2018
Partners & Sponsors:
 IVth Year – Computer Science Engineering

13. It is mentioned in the statement Mr. Vivek has been declared successful in the preliminary
screening for the post of Director of an educational Institute. Therefore, either he will be selected
or will not be selected as Director of an educational Institute.

14. Vapid is uninspiring so the relationship is both the given words are antonyms. Similarly, hirsute
(hairy) is antonym of bald.

Section-II: Technical

21. The determinant of Skew- symmetric of even order is a perfect square (non-zero).
Hence, option (D). (i.e., 9 is a perfect square)
(or)
Using expansion, we get 9.

2x 2 2 ax  b 
 a b  a b
x
.
22. lim 1   2   lim 1  2  ax  b x
x  
 x x  x 
 x x 
2 ax  b 
lim
 x  x 2
 a b
x
  lim 1  2  ax  b   e2a ;
 x 
 x x  
 1

 lim 1  ax  b    x 2   e and lim 2  ax  b   2a 
ax  b

 x    x 2   x  x 
 
 a  1& b  R

1 x
0
1  2  e 1   1  2  e 1
P  X  1,Y  0    e dx  e y dy  
1
23.  .  
 2
 2  2  2 4

24. Trace of A  a11  a 22  ........  a nn

  a ii    2i  3i 2   2  i   3  i 
n n n n
2

i 1 i 1 i 1 i 1

n  n  1 n  n  1 2n  1
2 3
2 6
2n  n  1  n  n  1 2n  1

2
n  n  1  2   2n  1 n  n  1 2n  3
 
2 2

Email: info@engineeringolympiad.in, Website: www.engineeringolympiad.in 5 of 11

IEO-2018
Partners & Sponsors:
 IVth Year – Computer Science Engineering

25. f  x   xsin x  cos x, x 0  

f '  x   x cos x  sin x  sin x  x cos x

 f  x 0   f       0   1  1
 
 f  x 0   f       1   
' '
By Newton  Raphson method, we have
f  x0   1
x1  x 0  
f ' x0  
 3.1416  0.3183  2.8233

26. TCP assigns an unique no to each byte and groups multiple bytes as one segment.
Seq_No = First Byte No of the segment.
Ack_No = Next Byte expected
X = 100, Y = 100, and Z=300 is the correct option.

27. Propagation delay = 2.5 sec

Band width = 2 Mbps
Packet size  2000B  2000  8 bits
Round Trip time  RTT  2 * propagation delay
 2 * 2.5 sec  5sec
1sec  2  106 bits
5sec  ?
Wbits  2  106  5  107 bits
2  106  5 2  106  5
Wpackets    625
2000  8 2 3  8
 The min  number of sequence numbers that we need  625

28.
Allocation Need Available
R1 R2 R3 R1 R2 R3 R1 R2 R3
P1 0 0 0 0 1 1 1 1 0
P2 1 0 0 1 1 0
P3 0 0 1 0 0 1
P4 0 0 1 0 1 0

So, we execute P2, P4, P1 and P3. (Safe)

Email: info@engineeringolympiad.in, Website: www.engineeringolympiad.in 6 of 11

IEO-2018
Partners & Sponsors:
 IVth Year – Computer Science Engineering

242
29. No. of frames   230
212
246
No. of pages =  234
212
Frame number takes 30 bits (approx. 4 Bytes)
Page table size  234  4Bytes  236 B
236 B
No. of pages required for P.T   224
212 B

30. DFA accepting the language represented by the regular expression 01 10 * 111 * 0 *1 is
shown below which can’t be reduced further.
0

q0 q1 q2 q3
0 1 1

1 0 0

1
q4 0,1

31. Strings that go to final states ABE or ABCD i.e. 0*10(0+1)* - ABE
0*110(0+1)* - ABCD
ABE+ABCD = 0*10(0+1)* + 0*110(0+1)*
= 0*(10+110) (0+1)*

32. A Directed Acyclic Graph is a directed graph that has no cycles. Only Option (A) is correct.

33. G1  G2
Here is and isomorphism between G1 & G2.
f d   f f   z
f g  u f a   y
f e  t f c  x
f  b  s f  h   w
G2 and G3 are not isomorphic because G3 contains odd cycles, for example.
, , , , ,  is a cycle or length 5, but G1 & G2 do not contain any odd cycle.

Email: info@engineeringolympiad.in, Website: www.engineeringolympiad.in 7 of 11

IEO-2018
Partners & Sponsors:
 IVth Year – Computer Science Engineering

34. Let Xi be the indicator random variable which is 1 if A’ [i] = i otherwise it is 0 E[Xi] = 1/n ,
n
so E  X   E[Xi]  1
i 1

35.
Clks 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
I1 S1 S2 S3 S4 S5 S6
I2 S1 S2 S3 S4 S5 S6
I3 S1 S2 - - - S3 S4 S5 S6
I4 S1 S2 - - - - - - S3 S4 S5 S6
I5 S1 S2 S3 S4 S5 S6
I6 S1 S2 - - - S3 S4 S5 S6
I7 S1 S2 - - - - - - S3 S4 S5 S6

16  210 B 8
36. Total number of blocks =  2  256blocks
26 B
256
Total number of sets =  64
4
So division is TAG |SET| Byte, byte offset is 6 bit, 6 bit for set and 20 bit for TAG.
Total TAG size will be 22 bits
22  256
Total size of meta data will be =704 Bytes
8

38. Given function is f  A,B,C,D  B.C  A.BD  AC.D

Corresponding to this their min terms are f(A,B,C,D)=Σm(1,5,6,7,12,14,15)
I0 I1 I2 I3 I 4 I5 I 6 I 7
D  0 0 2 4 6 8 10 12 14
D 1 1 3 5 7 9 11 13 15
D 0 D 1 0 0 D 1

Email: info@engineeringolympiad.in, Website: www.engineeringolympiad.in 8 of 11

IEO-2018
Partners & Sponsors:
 IVth Year – Computer Science Engineering

39.
Present State Flip Flop Inputs Next state
Q2 Q1 Q0 J2 K2 J1 K1 J0 K0 Q 2 Q1 Q 0

(Q0Q1) 1 Q Q 
2 0 Q Q 
0 2 Q 
2 (1)

0 0 0 0 1 0 0 1 1 0 0 1
0 0 1 0 1 1 1 1 1 0 1 0
0 1 0 0 1 0 0 1 1 0 1 1
0 1 1 1 1 1 1 1 1 1 0 0
1 0 0 0 1 0 1 0 1 0 0 0
1 0 1 0 1 0 1 0 1 0 0 0
1 1 0 0 1 0 1 0 1 0 0 0
1 1 1 0 1 0 1 0 1 0 0 0
So the counting pattern is
000 → 001 → 010 →011→ 100 → 000
So, the MOD number of the counter is 5.
So, on 0th and 5th clock it will have 000.
So, on 8th clock it will have the state Q2 Q1 Q0  011
So option 'D' is correct.

40. The precedence graph is DAG (Directed Acyclic Graph), hence the topological sorting gives T1,
T2, T3, T4, T5 as a possible serial schedule.

41. Precedence graph is

T1 T2

T3

There is a cycle in the precedence graph hence it is not conflict serializable.

42. Both "f()" and "test()" can be used to call the function "test()". By using function pointer f, we can
call the function "test()" as (*f)() or f(). So test( ), (*f)( ), f( ) all these calls the same function
"test()".

Email: info@engineeringolympiad.in, Website: www.engineeringolympiad.in 9 of 11

IEO-2018
Partners & Sponsors:
 IVth Year – Computer Science Engineering

43. When we go through the sequence of option C,

925
202
911

240
912
245
365

In this BST, 912 is present in the left subtree of 911 which is not possible

44. n dequeue operations from Q1, n-1 enqueue operations on Q2, then those n-1 elements will be
brought it to Q1 by taking n-1 enqueue and dequeue operations each

45.
Array index 0 1 2 3 4 5 6 7 8 9 10 11
Key value 1 49 15 4 18 30 20 9 35

So 49 in slot number 2
6
46. 3 delete q;

1 2 3 4 5 x
P
1 P  8
P
q q  5
 4
 2  7  delete  q 
So finally delete every second node of link list.

47. Start return

1 2 3 4 x
f s  n 
 4 print  s  info 
o p  4 3 21

f s  n 
 3 print  s  info 

 2 f s  n 
print  s  info 

f s  n 
1 print  s  info 

Email: info@engineeringolympiad.in, Website: www.engineeringolympiad.in 10 of 11

IEO-2018
Partners & Sponsors:
 IVth Year – Computer Science Engineering

49. Explanation: First(S) = First(A) = First(B) = {a,b, ε}

Follow(A)={a,b}
Follow(B) ={a,b,$}
Follow(S)={a,b,$}

50. The weight of MST is 37.

8 7
b c d
4 9
2
a 4 e
i

h g f
1 2

Email: info@engineeringolympiad.in, Website: www.engineeringolympiad.in 11 of 11

IEO-2018
Partners & Sponsors: