Friday, 21 October 2016

NET Computer Science June 2012 Questions and Answers Paper II - Part 4

31.       Resources are allocated to the process on non-sharable basis is
(A) mutual exclusion              (B) hold and wait
(C) no pre-emption                  (D) circular wait
Answer: A
32.       Cached and interleaved memories are ways of speeding up memory access between CPU’s and slower RAM. Which memory models are best suited (i.e. improves the performance most) for which programs ?
(i) Cached memory is best suited for small loops.
(ii) Interleaved memory is best suited for small loops
(iii) Interleaved memory is best suited for large sequential code.
(iv) Cached memory is best suited for large sequential code.
(A) (i) and (ii) are true.
(B) (i) and (iii) are true.
(C) (iv) and (ii) are true.
(D) (iv) and (iii) are true.
Answer: B
33.       Consider the following page trace : 4,3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5. Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB m=4 will be
(A) 8                   (B) 9
(C) 10                 (D) 12
Answer: C
34.       Check sum used along with each packet computes the sum of the data, where data is treated as a sequence of
(A) Integer                     (B) Character
(C) Real numbers        (D) Bits
Answer: D
35.       If an integer needs two bytes of storage, then the maximum value of a signed integer is
(A) 216 – 1        (B) 215 – 1
(C) 216              (D) 215
Answer: B

36.       Which of the following logic families is well suited for high-speed operations ?
(A) TTL               (B) ECL
(C) MOS            (D) CMOS
Answer: B
37.       Interrupts which are initiated by an instruction are
(A) Internal                    (B) External
(C) Hardware                (D) Software
Answer: D
38.       printf(“%c”, 100);
(A) prints 100
(B) prints ASCII equivalent of 100
(C) prints garbage
(D) none of the above
Answer: B
39.       For the transmission of the signal, Bluetooth wireless technology uses
(A) time division multiplexing
(B) frequency division multiplexing
(C) time division duplex
(D) frequency division duplex
Answer: C
40.    Consider the following statements :
I. Recursive languages are closed under complementation.
II. Recursively enumerable languages are closed under union.
III. Recursively enumerable languages are closed under complementation.
Which of the above statements are true ?
(A) I only                        (B) I and II
(C) I and III                    (D) II and III
Answer: B

Pages   2   3   4   5 

0 comments:

Post a Comment

UGC NET Computer Science

Computer GK App