UGC NET Computer Science Solved Paper II December 2006 - Part 1

1.       Which of the regular expressions corresponds to this grammar ?

S → AB / AS, A → a / aA, B → b

(A) aa*b+           (B) aa*b

(C) (ab)*             (D) a(ab)*

Answer: B

2.       The proposition ~q∨p is equivalent to:

(A)          (B)       (C)      (D)

Answer:

3.       The number of edges in a complete graph with N vertices is equal to:

(A) N(N−1)        (B) 2N−1

(C) N−1              (D) N(N−1)/2

Answer: D

4.       Which of the following is not true ?

(A)

(B) A−B = A∩~B

(C)

(D)

Answer:

5.       If (a²−b²) is a prime number where a and bϵN, then:

(A) a²−b² = 3                 (B) a²−b² = a−b

(C) a²−b² = a+b             (D) a²−b² = 5

Answer: C

6.       The hexadecimal equivalent of (10111)₂×(1110)₂ is:

(A) 150               (B) 241

(C) 142              (D) 101011110

Answer: C

7.       An example of a self complementing code is:

(A) 8421 code               (B) Gray code

(C) Excess-3 code       (D) 7421 code

Answer: C

8.       A sum of products expression can be implemented with...............logic gates.

(A) AND – OR              (B) NAND − OR

(C) AND – NOT            (D) OR – AND

Answer: A

9.       The characteristic equation of the D flip-flop is:

(A) Q_n+1 = D       (B) Q = D

(C) Q = 1            (D) Q = 0

Answer: A

10.    Which of the following logic is the fastest ?

(A) RTL              (B) ECL          (C) HTL          (D) HCL

Answer: B

---

  Part 1   Part 2   Part 3   Part 4   Part 5 

---