61. A
context free grammar for L={w|n

_{0}(w)>n_{1}(w)} is given by:
(A) S→0|0S|1SS (B)
S→0S|1S|0SS|1SS|0|1

(C) S→0|0S|1SS|S1S|SS1 (D) S→0S|1S|0|1

Answer: C

62. Given
the following two statements:

S

_{1}: If L_{1}and L_{2}are recursively enumerable languages over ∑, then L_{1}⋃L_{2}and L_{1}⋂L_{2}are also recursively enumerable.
S

_{2}: The set of recursively enumerable languages is countable.
Which of the following is correct?

(A) S

_{1}is correct and S_{2}is not correct
(B) S

_{1}is not correct and S_{2}is correct
(C) Both S

_{1}and S_{2}are not correct
(D) Both S

_{1}and S_{2}are correct
Answer: D

63. Given
the following grammars:

G

_{1}: S→AB|aaB
A→aA|Ïµ

B→bB|Ïµ

G

_{2}: S→A|B
A→aAb|ab

B→abB|Ïµ

Which of the following is correct?

(A) G

_{1}is ambiguous and G_{2}is unambiguous grammars
(B) G

_{1}is unambiguous and G_{2}is ambiguous grammars
(C) Both G

_{1}and G_{2}are ambiguous grammars
(D) Both G

_{1}and G_{2}are unambiguous grammars
Answer: C

64. Given
the symbols A, B, C, D, E, F, G and H with the probabilities 1/30, 1/30, 1/30,
2/30, 3/30, 5/30, 5/30 and 12/30 respectively. The average Huffman code size in
bits per symbol is:

(A) 67/30 (B)
70/34

(C) 76/30 (D)
78/30

Answer: C

65. The
redundancy in images stems from:

(A) pixel decorrelation (B) pixel correlation

(C) pixel quantization (D) image size

Answer: B

66. In
a binary Hamming code the number of check digits is r then number of message
digits is equal to:

(A) 2

^{r}-1 (B) 2^{r}-r-1
(C) 2

^{r}-r+1 (D) 2^{r}+r-1
Answer: B

67. In
the Hungarian method for solving assignment problem, an optimal assignment
requires that the maximum number of lines that can be drawn through squares
with zero opportunity cost be equal to the number of:

(A) rows or columns (B) rows+columns

(C) rows+columns-1 (D) rows+columns+1

Answer: A

68. Consider
the following transportation problem:

The initial basic feasible solution of the
above transportation problem using Vogel’s Approximation Method(VAM) is given
below:

The solution of the above problem:

(A) is degenerate solution (B) is optimum solution

(C) needs to improve (D) is infeasible solution

Answer: B

69. Given
the following statements with respect to linear programming problem:

S

_{1}: The dual of the dual linear programming problem is again the primal problem
S

_{2}: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution
S

_{3}: If either the primal or dual problem has a finite optimal solution, the other one also possesses the same, and the optimal value of the objective functions of the two problems are equal.
Which of the following is true?

(A) S

_{1}and S_{2 }(B) S_{1}and S_{3}
(B) S

_{2}and S_{3}(D) S_{1}, S_{2}and S_{2}
Answer: D

70. Consider
the two class classification task that consists of the following points:

Class C

_{1}: [1 1.5] [1 -1.5]
Class C

_{2}: [-2 2.5] [-2 -2.5]
The decision boundary between the two classes
using single perceptron is given by:

(A) x

_{1}+x_{2}+1.5=0 (B) x_{1}+x_{2}-1.5=0
(C) x

_{1}+1.5=0 (D) x_{1}-1.5=0
Answer: C

## 0 Comments