11) Which operating system use write through catches
a) UNIX
b) XENIX
c) ULTRIX
d) DOS
12) Dynamic allocation of storage areas with VSAM files is accomplished by
a) hashing
b) control splits
c) over flow areas
d) relative recording
13)Dijkstra’s algorithm deals with
a) mutual exclusion
b) deadlock recovery
c) deadlock avoidance
d) cache coherence
14)A series of statements explaining how the data is to be processed is called
a) instruction
b) compiler
c) program
d) interpretor
15) Which of following is not a condition of Dead Lock ?
a) Mutual Exclusion
b) No Preemption
c) Hold and Wait
d) Data Transfer
16) Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will
a) Always decrease the number of page faults
b) Always increase the number of page faults
c) Some times increase the number of page faults
d) Never affect the number of page faults
17) Which of the following need not necessarily be saved on a context switch between processes?
(a) General purpose registers
(b) Translation look-aside buffer
(c) Program counter
(d) All of the above
18)Which of the following scheduling algorithms is non-preemptive? (GATE CS 2002)
a) Round Robin
b) First-In First-Out
c) Multilevel Queue Scheduling
d) Multilevel Queue Scheduling with Feedback
19)Increasing the RAM of a computer typically improves performance because:
(a) Virtual memory increases
(b) Larger RAMs are faster
(c) Fewer page faults occur
(d) Fewer segmentation faults occur
20)A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages but now in the reverse order. How many page faults will occur?
(A) 196
(B) 192
(C) 197
(D) 195