Monday, 24 November 2014

UGC NET Computer Science Paper II Previous Questions December 2012 - Part 2

11.       In compiler design ‘reducing the strength’ refers to
(A) reducing the range of values of input variables.
(B) code optimization using cheaper machine instructions.
(C) reducing efficiency of program.
(D) None of the above
Answer: B
12.       In which addressing mode, the effective address of the operand is generated by adding a constant value to the contents of register?
(A) Absolute                 (B) Indirect
(C) Immediate               (D) Index
Answer: D
13.       Which of the following is true ?
(A) A relation in BCNF is always in 3NF.
(B) A relation in 3NF is always in BCNF.
(C) BCNF and 3NF are same.
(D) A relation in BCNF is not in 3NF.
Answer: A
14.       Given memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K (in order) and processes of 212 K, 417 K, 112 K, and 426 K (in order), using the first-fit algorithm, in which partition would the process requiring 426 K be placed ?
(A) 500 K                       (B) 200 K
(C) 300 K                       (D) 600 K
Answer: Marks given to all
15.       What is the size of the Unicode character in Windows Operating System ?
(A) 8-Bits                       (B) 16-Bits
(C) 32-Bits                     (D) 64-Bits
Answer: B

16.       In which tree, for every node the height of its left subtree and right subtree differ almost by one ?
(A) Binary search tree             (B) AVL tree
(C) Threaded Binary Tree      (D) Complete Binary Tree
Answer: B
17.       The design issue of Datalink Layer in OSI Reference Model is
(A) Framing
(B) Representation of bits
(C) Synchronization of bits
(D) Connection control
Answer: A
18.       Given the following expressions of a grammar
E→E*F/F+E/F
F→F–F/id
Which of the following is true ?
(A) * has higher precedence than +
(B) – has higher precedence than *
(C) + and – have same precedence
(D) + has higher precedence than *
Answer: B
19.       The maturity levels used to measure a process are
(A) Initial, Repeatable, Defined, Managed, Optimized.
(B) Primary, Secondary, Defined, Managed, Optimized.
(C) Initial, Stating, Defined, Managed, Optimized.
(D) None of the above
Answer: A
20.    The problem of indefinite blockage of low-priority jobs in general priority scheduling algorithm can be solved using :
(A) Parity bit                  (B) Aging
(C) Compaction           (D) Timer
Answer: B

Pages   2   3   4   5 

0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App