Table of Content

UGC NET Computer Science : June 2012 - Paper 2 (Solved Papers)


Question 1
Resources are allocated to the process on non-sharable basis is
A
hold and wait
B
circular wait
C
mutual exclusion
D
no pre-emption
Question 2
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 ?
  1. Cached memory is best suited for small loops.
  2. Interleaved memory is best suited for small loops
  3. Interleaved memory is best suited for large sequential code.
  4. Cached memory is best suited for large sequential code.
A
(i) and (iii) are true.
B
(i) and (ii) are true.
C
(iv) and (iii) are true.
D
(iv) and (ii) are true.
Question 3
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
12
B
10
C
8
D
9
Question 4
Check sum used along with each packet computes the sum of the data, where data is treated as a sequence of
A
Bits
B
Real numbers
C
Integer
D
Character
Question 5
If an integer needs two bytes of storage, then the maximum value of a signed integer is
A
215 – 1
B
215
C
216 – 1
D
216

Pages: Page 1, Page 2, Page 3, Page 4, Page 5, Page 6, Page 7, Page 8, Page 9, Page 10