MOCK GATE –II - 2011

CSE

Q01. (C)
Hint: The Eigen vector for λ =2 is given by the system (A – 2I )X = 0
Solve ant two equations of the system by cross multiplication rule.
Q02. (C)
Hint: The mean value c of Cauchy’s theorem is given by the formula
{ f '(c) / g '(c) } = {f(b)- f(a)}/{g(b)-g(a)}
Q03. (B)
Hint: Error due to trapezoidal rule is given by
E ≤ │M2 (b-a)3/12 n2 │ where M2 = max. value of f''(x) in (0,1).

Q04. (C)
Hint: If n is even, then number of palindromes = 2 n/2
If n is odd, then number of palindromes = 2 n+1/2

Q05. (B)
S → abc
S →a A b c
→ ab A c
→a b B bcc

→ a B bbcc
→ aa bb cc
→ a2 b2 c2
:
:
lly S → an bn cn / n ≥ 1
⇒ D + is a CSL

Q06. (A)
The Process of replacing an expression by their value is called content folding
Ex : n = y + 2 *3
⇒n = y + 6

Q07. (C)
LR (1) < SLR (1) < LALR(1) < CLR(1)

CLR(1)
LALR(1)
SKR(1)
LR(1)
 ⇒ from the given options. CLR(1) is Move poner ful than LALR (1).

Q08. Giving the parenthesis as per the evaluation is important, otherwise the precedence
overrides.
Ans : (C)

Q09. The code is written using Head Recursion. After reversing a given singly linked list, 
         the link field of last node should be NULL, so it is required to be passed as an 
         argument.
Ans : (C)

Q10. Ans: (B)

Q11. Ans: (C)

Q12. Ans: (C)

Q13. Ans: (B)

Q14. Minimum Average Waiting Time is with SJF.

Ans: (B)

Q15. The Amount of Memory accessible is 2^14 = 16KB

Ans: (B)

Q16. Include one byte for the NULL character.

Ans: (B)

Q17. The problem is similar to Knapsack Problem , the optimal solution for the same can
be obtained using Greedy Method.
Ans: (B)

Q18. Merge Sort is based on Divide and Conquer, for which the arrangement of input
keys is irrelevant.
Ans: (C)

Q19. Queries will list the name of employees who have a dependent with the same first
name as themselves.
Ans: (C)

Q20. Cardinality ratio =1 for partial participation and 1 for total participation. Here
student to course is total and Course to student is partial.
 Ans: (A)

Q21. Total sequence numbers required is 25 + 1= 26. 2 k<=26

Ans: (D)

Q22. Packet consists ID of each router + header.

Ans: (B)

Q23. Fragmentation is applicable for datagram data (2048 + 20)

Ans: (C)

Q24. Reliability = 120/60*24*365=0.9997

Ans: (A)

Q25. Table created by given HTML will be

A B
C
D E F

Cells in rows 2,2,3

Cells in columns 2,2,3

Q26. (A)

Q27. (A)
Hint: Total number of cases = n!
Favorable number of cases = n.Dn .
where Dn is number of derangements of n objects.
Q28. (B)
Hint: Construct composition table. Elements in each row and column should be
distinct.

Q29. (A)
a1 z0 /az0
A b1 z0/z0
a1 a /aa
b1 a /a
δ (A, a, z0) = (A, az0) – push
 δ (A, b, z 0 ) = (A, z 0 ) – skip
δ (A, a, a) = (A, aa) – push
δ (A, b, a ) = (A, a ) → skip
There transitions shows that, if the process symbol is a , then it is pushing into
stack, and if the processing symbol is b, then is skipping

Q30. RE : (1 + 01)*(0+01)*
* = 0 ⇒∈
* = 1 ⇒ (1 + 01) (0 + 01) = 10, 101, 010, 01010
:
:
⇒ 0 0 is Not followed by 11
Ans: (B)

Q31. Ans: (C)

S →a A b
A → a A b/a I4
I1 S→aAb.
I3
S1→S. I7
S S→aA.b
A
I6 A→aA.b
→
A→.aAb A
S →.S
1
a S .aAb
S →.aAb A →.aAb A→.aAb b
I8
I2 A →.a A→.a A→aAb.
a a
a I6
I5 A→a. I5
⇒ From the above DFA. It b free from both SR & RR Conslict
⇒ It is of LR (1) grammas.

Q32. (D)

Q33. (D) 
        The lexically ordered binary tree = Binary search tree(BST), so apply the definition.

Q34. (B)

Q35. (A)

Q36. Use the formula Disk I/O Time = Seek Time + Rotational Latency Time + Transfer
Time.
 Ans: (A)

Q37. When the Quantum Value is small, results in high context-switch

Ans: (D)

Q38. It makes use of the concept of Aliasing.

Ans: (B)

Q39. Use the precedence rules of C operators.

Ans: (D)

Q40. We can apply Binary Search on the array. Linked list manipulations is gen O(n).
Ans: (A)

Q41. Apply the definitions of Asymptotic and rate of growth of functions. The rate of
growth of exponential functions is faster than that of polynomial functions.
Ans: (D)

Q42. T2: W(x) needs write lock, so T1 should unlock x, again T should go for lock to
perform T1: W(x), whereas this operation is ignored in timestamp with Thomas
write rule.
Ans: (B)

Q43. T2: R(y), T3: W(y), …T2: R(y) because of the operations it is not conflict, also we
have dirty read T2: R(y)
Ans: (D)

Q44. Perform and operation between IP address and SM and compare result with subnet
number.
Ans: (D)

Q45. Products.html will be loaded as Coordinates (297,150) lies within a Circle shape
<AREA HREF = "products.html" ALT = "Products" TITLE = "Products"
SHAPE = CIRCLE COORDS = "251,143,47">
COORDS are CENTER = 251,143 and RADIUS = 47
Ans: (B)

Q46. Apply the fast exponential modular arithmetic algorithm for evaluation
         Ans: (D)

Q47. Boehm model E = 2.4(30)1.05 = 85 person-month

Waltson-felix model E = 5.2(30)0.91 = 115 person-month
Ans: (B)

Q48 & 49:   Apply Indirect recursion definition
 = ( 49 − a − b − c )
= 49 − 9 = 40
∴no .of teacherswh o own none of the items = ( 50 − 40 ) =10

50 & 51. Apply Binary Search with the suggested modifications and trace the algorithm.

Q52. In one second we consume 1 X 109/8 seqence numbers, calculate how much time it
takes to consume 2 32 sequence numbers.
Ans: (B)

Q53. Incrementing every 32 ms, it would take about 32 X 4X 109 ms i.e about 4 years.
Ans: (A)

Q54. (D)
Hint: Maximum number of regions = 2 (Number of vertices) – 4

Q55. (C)

Hint: Apply Euler Formula to find the number edges and sum of degrees of regions
theorem.

NUMERICAL ABILITY :

Q56. Ans: (C)

x
Let the required fraction be y . Then,
x 1
= ⇒2 x − y =1.......... ......( 1) and
x +1 2
x +1 1
= ⇒x − y = −1.......... ......( 2)
y 2
Solving (1) and (2) we get x=2, y=3
2
∴The Fraction is
3

Q57. Ans: (D)

Only son of Neena’s father-in-law Mahipal-Neena’s husband. So, Raman is
Neena’s husband and Anita and Bindu are his daughters. Thus, Bindu is the grand
daughter of Mahipal.

Q58. Ans: (B)

Clearly, We will consider the following matches:
(i) Matches of first player with other 5 players;
(ii) Matches of second player with 4 players other than first player,
 (iii) Matches of third player with 3 players other than the first and second player;
(iv) Matches of fourth player with 2 players other than the first and three players,
and
(v) Match of fifth player with the sixth one so, number of matches played during the
tournament = 5+4+3+2+1=15.

Q59. (A)

Q60. (D)

Q61. (D)

Q62. (D)

Q63. Ans: (D)

(i) A: From first two statements, the middle term is not distributed, but conversion
of first and second statements they become I+I⇒ No conclusion, there fore
third statement is not possible from first two statements.
(ii) B: After conversion of first statement, it became ‘E’ and from first and second
*
statements E+A⇒0
∴Therefore from first and second statements, the third one possible
(iii) C: After conversion of first and second statements, the middle term is
distributed, but I+I ⇒ NO Conclusion
∴Therefore third is not possible from first and second statements.
(iv) D: After conversion of first statement, the middle term is distributed, I+A⇒I
∴There fore the third statement is possible from first and second statements.

Q64. Ans: (D)

Eliminating the options. I must appear with N so, we can eliminate option (C). Also
K must appear with L so, we can eliminate option (A). Finally J (or) M must be
with H. So, we can eliminate option (B). Hence option (D) is the Answer.

Colour TV (22) VCR(15)

Q65. Ans: (C) 15-(1+a+b)

B
The given information
22-(1+a+b) can be represented in a venn diagram as follows:

a
1
C

14-(1+a+b)

Tape Recorder (14)

Now,
A+b+c=9
Number of teachers who own at least on iteam
= { 22 − (1 + a + b ) + 15 − (1 + b + c ) + 14 − (1 + a + c ) + a + b + c + i}
= ( 22 +14 +13 +1 − a − b − b − c − a − c + a + b + c )