Welcome to Operating System Quiz, Randomly Selected !!

Question 1. The degree of Multiprogramming is controlled by

CPU Scheduler

Context Switching

Long-term Scheduler

Medium term Scheduler

Question 2. An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is

FCFS scheduling algorithm

Round robin scheduling algorithm

Shorest job - first scheduling algorithm

None of the above

Question 3. 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 4. 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 5. The agency that sits between the user and the UNIX system is called the





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

best fit

worst fit

first fit

none of the above

Question 7. Consider a machine with 64 MB physical memory and a 32-bit virtual address space. If the page size is 4KB, what is the approximate size of the page table?

16 MB

8 MB

2 MB

24 MB

Question 8. Which of the following statements is false?

Virtual memory implements the translation of a program's address space into physical memory address space

Virtual memory allows each program to exceed the size of the primary memory

Virtual memory increases the degree of multiprogramming

Virtual memory reduces the context switching overhead

Question 9. The number of processes completed per unit time is known as





Question 10. _______ OS pays more attention on the meeting of the time limits.



Real time