Placement papers on Operating System - Set 8

Placement papers on Operating System - Set 8

Q1. Which one of the following statement is true for I/O redirection?

1. It implies connecting 2 programs through a pipe.
2. It can be employed to use an existing file as input file for a program
3. It implies changing file name
4. None of the above.
View Answer / Hide Answer


Q2. Consider a computer with the page fault service time = 10ms and average memory access time = 20ns. Assuming one page fault is generated for every 10⁶ memory accesses, the

effective access time for the memory is

1. 20ns
2. 25ns
3. 10ns
4. 30ns
View Answer / Hide Answer


Q3. When is a memory page that contains a heavily used variable that was initialized very early and is in constant use be removed?

1. When FIFO page replacement algorithm is used.
2. When LFU page replacement algorithm is used.
3. When LRU page replacement algorithm is used.
4. None of the above
View Answer / Hide Answer


Q4. Consider a computer system with main memory size of 3 page frames which is initially empty. Let the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on a demand paged

virtual memory system running on this computer system. If LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy then

1. OPTIMAL = FIFO
2. OPTIMAL = LRU
3. OPTIMAL < FIFO < LRU
4. OPTIMAL < LRU < FIFO
View Answer / Hide Answer


Q5. Locality of reference implies that the page reference being made by a process

1. Is likely to be one of the pages used in the last few page references.
2. Will always lead to page fault
3. Will always be the page used in the previous page reference.
4. Will always be one of the pages existing in the memory.
View Answer / Hide Answer