 Sample Questions, Previous Year Solved Papers, Study Materials For Competitive Examinations Like UGC NET, SET And GATE Computer Science.

## Tuesday, 25 November 2014

11.       Match the following :
(a) UDP                  (i) Message Transfer Protocol
(b) OSPF    (ii) Bit-oriented Protocol
(c) SMTP    (iii) Interior Gateway Routing Protocol
(d) HDLC    (iv) Connectionless Transport Protocol
Codes :
(a)   (b)  (c)  (d)
(A) (iii)  (iv)  (ii)  (i)
(B) (iv)  (iii)  (ii)  (i)
(C) (iv)  (iii)  (i)  (ii)
(D) (iii)  (iv)  (i)  (ii)
12.       Given the IP address 201.14.78.65 and the subnet mask 255.255.255.224. What is the subnet address?
(A) 201.14.78.32
(B) 201.14.78.64
(C) 201.14.78.65
(D) 201.14.78.224
13.       If an artificial variable is present in the ‘basic variable’ of optimal simplex table then the solution is .................
(A) Alternative solution
(B) Infeasible solution
(C) Unbounded solution
(D) Degenerate solution
14.       An optimal assignment requires that the minimum number of horizontal and vertical lines that can be drawn to cover all zeros be equal to the number of
(A) rows or columns
(B) rows + columns
(C) rows + columns – 1
(D) rows + columns + 1
15.       Which of the following is the minimum cost for an assignment problem given below?

16.       Assume, L is regular language. Let statements S1 and S2 be defined as :
S1 : SQRT(L) = { x| for some y with |y| = |x|2, xy L}
S2 : LOG(L) = { x| for some y with |y| = 2|x|, xy L}
Which of the following is true?
(A) S1 is correct and S2 is not correct.
(B) Both S1 and S2 are correct.
(C) Both S1 and S2 are not correct.
(D) S1 is not correct and S2 is correct.
17.       A regular grammar for the language L = {anbm | n is even and m is even}is given by
(A) S→aSb | S1; S1 → bS1a | λ
(B) S→aaS | S1; S1 → bSb | λ
(C) S→aSb | S1; S1 → S1ab | λ
(D) S→aaS | S1; S1 → bbS1 | λ
18.       Given the following productions of a grammar :
S→ aA| aBB;
A→aaA |λ ;
B→ bB| bbC;
C→ B
Which of the following is true?
(A) The language corresponding to the given grammar is a set of even number of a’s.
(B) The language corresponding to the given grammar is a set of odd number of a’s.
(C) The language corresponding to the given grammar is a set of even number of a’s followed by odd number of b’s.
(D) The language corresponding to the given grammar is a set of odd number of a’s followed by even number of b’s.
19.       The language accepted by the nondeterministic pushdown automaton
M= ({q0, q1, q2}, {a, b}, {a, b, z}, δ, q0, z, {q2}) with transitions
δ (q0 a, z) = { (q1 a), (q2 λ)};
δ (q1, b, a) = { (q1, b)}
δ (q1, b, b) ={ (q1 b)}, δ (q1, a, b) = { (q2, λ)}
is
(A) L(abb*a)
(B) {a} U L(abb*a)
(C) L(ab*a)
(D) {a} U L(ab*a)