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.

Friday, 3 April 2015

UGC NET Computer Science Paper II December 2009 - Part 1 Solved Questions

1.       If she is my friend and you are her friend, then we are friends. Given this, the friend relationship in this context is …………...
(i) commutative
(ii) transitive
(iii) implicative
(iv) equivalence
(A) (i) and (ii)
(B) (iii)
(C) (i), (ii), (iii) and (iv)
(D) None of these
Answer: D
2.       Circle has …………….
(A) No vertices
(B) Only 1 vertex
(C) ∞ vertices
(D) None of these
Answer: A
3.       If in an error detection and correction code a message M : “You are good students” is stored as M' : Youare areyou aregood goodare goodstudents studentsgood. What is the space required to store M' in general? (assume that ‘n’ is the length of M)
(A) 2n
(B) 3n
(C) 4n
(D) less than 4n
Answer: D
4.       P: “Program is a step by step execution of the instructions”. Given P, which of the following is true?
(A) Program is a subset of an instruction set.
(B) Program is a sequence of a subset of an instruction set.
(C) Program is a partially ordered set of an instruction set.
(D) All of the above
Answer: B
5.       In a MIU puzzle, either of the letters M, I or U could go as a start symbol. Production rules are given below :
R1 : U→IU
R2 : M.x→M.x.x where ːˑ is string concatenation operator. Given this, which of the following holds for
(i) MIUIUIUIUIU
(ii) MIUIUIUIUIUIUIUIU
(A) Either (i) or (ii) but not both of these are valid words.
(B) Both (i) and (ii) are valid words and they take identical number of transformations for the production.
(C) Both (i) and (ii) are valid words but they involve different number of transformations in the production.
(D) None of these
Answer: C

6.       The simplified form of the Boolean expression (X+Y+XY)(X+Z) is
(A) X + Y + ZX + Y
(B) XY – YZ
(C) X + YZ
(D) XZ + Y
Answer: C
7.       Identify the logic function performed by the circuit shown
(A) exclusive OR
(B) exclusive NOR
(C) NAND
(D) NOR
Answer: B
8.       The highest noise margin is offered by
(A) BICMOS
(B) TTL
(C) ECL
(D) CMOS
Answer: B
9.       The answer of the operation (10111)2*(1110)2 in hex equivalence is
(A) 150
(B) 241
(C) 142
(D) 101011110
Answer: C
10.    How many 1’s are present in the binary representation of
3 × 512 + 7 × 64 + 5 × 8 + 3
(A) 8
(B) 9
(C) 10
(D) 11
Answer: B

Pages   2   3   4   5 

No comments:

Post a Comment