Welcome to Operating System Quiz, Randomly Selected !!

Question 1. Consider the two statements.
(A) A network operating system, the users access remote resources in the same manner as local resource.
(B) In a distributed operating system, the user can access remote resources either by logging into the appropriate remote machine or transferring data from the remote machine to their own machine.
Which of the statement is true?

A true, B false

B true, A false

Both A and B false

Both A and B true

Question 2. _________ page replacement alogorithm suffers from Belady's anamoly.





Question 3. Which directory implementation is used in most Operating System

Single level directory structure

Two level directory structure

Tree directory structure

Acyclic directory structure

Question 4. Replace the page that will not be used for the longest period of time. This principle is adopted by ?

FIFO Page replacement algorithm

Optimal Page replacement algorithm

Round robin scheduling algorithm

SCAN scheduling algorithm

Question 5. Suppose the time to service a page fault is on the average 10 milliseconds, while a memory access takes 1 microsecond. Then a 99.99% hit ratio results in average memory access time of

1.9999 milliseconds

1 millisecond

9.999 microseconds

1.9999 microseconds

Question 6. Round robin scheduling is essentially the preemptive version of


Shortest job first

Shortest remaining

Longest time first

Question 7. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called

Static loading

Dynamic loading

Dynamic linking


Question 8. More than one word are put in one cache block to

exploit the temporal locality of reference in a program

exploit the spatial locality of reference in a program

reduce the miss penalty

none of the abov

Question 9. _________ allocates the largest hole (free fragment) available in the memory.

best fit

worst fit

first fit

none of the above

Question 10. The state of a process after it encounters an I/O instruction is