Computer Science Study Materials for Competitive Exams

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

Thursday, 16 April 2015

UGC NET Computer Science Solved Question Paper II June 2006 - Part 1

1.       Which of the following strings is in the language defined by grammar S→0A, A→1A/0A/1
(A) 01100
(B) 00101
(C) 10011
(D) 11111
Answer: B
2.       For a complete graph with N vertices, the total number of spanning trees is given by:
(A) 2N-1
(B) NN-1
(C) NN-2 
(D) 2N+1
Answer: C
3.       The preposition (p→q) ˄ (~q˅p) is equivalent to:
(A) q→p
(B) p→q
(C) (q→p) ˄ (p→q)
(D) (p→q) ˅ (q→p)
Answer: C
4.       The logic of pumping lemma is a good example of:
(A) pigeon hole principle                  
(B) recursion
(C) divide and conquer technique  
(D) iteration
Answer: A
5.       Let A = {x | -1<x<1} = B. The function f(x)=x/2 from A to B is:
(A) injective      
(B) surjective
(C) both injective and surjective
(D) neither injective nor surjective
Answer: C

6.       The number of 1’s present in the binary representation of (3x512 + 7x64 + 5x8 + 3)10 is:
(A) 8
(B) 9
(C) 10
(D) 11
Answer: B
7.       Which of the following expression removes static hazard from a two level AND-OR gate implementation of xy + zx’
(A) xy + zx’
(B) xy + zx’ + wyz
(C) xy + zx’ + yz
(D) xy + zx’ + wz
Answer: C
8.       Which of the following logic has the maximum fan out ?
(A) RTL
(B) ECL
(C) NMOS
(D) CMOS
Answer: D
9.       In a weighted code with weight 6, 4, 2 ,-3 the decimal 5 is represented by:
(A) 0101
(B) 0111
(C) 1011
(D) 1000
Answer: C
10.    Upto how many variables, can the Karnaugh map be used ?
(A) 3
(B) 4
(C) 5
(D) 6
Answer: D

Pages   2   3   4   5 

1 comment:

  1. Question 11, answer provided is wrong. as output:
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11

    ReplyDelete