UGC NET COMPUTER SCIENCE SOLVED MODEL PAPER FOR
DECEMER 2016
1.
Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths
submitted at the same time to a computer system. Which one of the following
process scheduling algorithms would
minimize the average waiting time in the ready queue?
(a)
Shortest remaining time first
(b)
Round-robin with time quantum less than the shortest CPU burst
(c)
Uniform random
(d)
Highest priority first with priority proportional to CPU burst length
Ans.:
a
2.
Match the following :
List – I
List - II
(A)
Boot block (i) Information about file system
(B)
Super block (ii) Information about file
(C)
Inode table (iii) Storage space
(D)
Data block (iv) Code for making OS ready
Which
one is true?
(a)
(A)-(iv), (B)-(i), (C)-(ii), (D)-(iii)
(b)
(A)-(i), (B)-(ii), (C)-(iv), (D)-(iii)
(c)
(A)-(iv), (B)-(ii), (C)-(i), (D)-(iii)
(d)
(A)-(i), (B)-(iii), (C)-(ii), (D)-(iv)
Ans.:a
3.
A page fault means that we referenced a page
(a)
outside the memory boundaries (b) with an incorrect I/O request
(c)
that was not insecondary storage (d) that was not in main memory
Ans.:d
