# computersciencepaper II june-2007

UGC NET Previous Year Papers

Computer Science – Paper II

June-2007

1.   The following deterministic finite automata recognizes:

(A) Set of all strings containing ‘ab’

(B) Set of all strings containing ‘aab’

(C) Set of all strings ending in ‘abab’

(D) None of the above

Ans: (D)

2. Depth ion travels of the following directed graph is:

(A) ABCDEF

(B) ABDEFC

(C) ACEBDF

(D) None of the above

Ans: (B)

3. The maximum number of nodes in a binary tree of depth 10 is:

(A) 1024

(B) 210-1

(C) 1000

(D) None of the above

Ans: (D)

4. The regular expression given below describes:

r=(1+01)*(0+λ)

(A) Set of all string not containing ‘11’

(B) Set of all string not containing ‘00’

(C) Set of all string containing ‘01’

(D) Set of all string ending in ‘0’

Ans: (D)

5. Which of the following language is regular?

(A) L={anbn|n≥1}

(B) L={anbmcndm|n,m≥1}

(C) L={anbm|n,m≥1}

(D) L={anbmcn|n,m≥1}

Ans: (C)

6. 2’s complement of -100 is:

(A) 00011100

(B) 10011101

(C) 10011100

(D) 11100100

Ans: (C)

7. Which of the following expression remove hazard form: $xy+z\bar{x}$ ?

(A)   $xy+z \bar{x}$

(B)   $xy+z\bar{x}$

(C)   $xy+z\bar{x}+yz$

(D) $xy+z\bar{x}+wz$

Ans: (C)

8. How many 1’s are present in the binary representation of 15 x  256 + 5 x 16 + 3:

(A) 8

(B) 9

(C) 10

(D) 11

Ans: (A)

9. If A⊕B=C, then:

(A) A⊕C=B

(B) B⊕C=A

(C) A⊕B⊕C=1

(D) A⊕B⊕C=0

Ans: (A,B,D)

10. What is the maximum counting speed of a 4-bit binary counter which is composed of Flip-Flop with a propagation delay of 25ns?

(A) 1MHz

(B) 10MHz

(C) 100MHz

(D) 4MHz

Ans: (B)

Pages: 1 2 3 4 5