Welcome to Operating System Quiz, Advanced Level !!

Question 1. 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 2. 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 3. 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 4. Using Priority Scheduling algorithm, find the average waiting time for the following set of processes given with their priorities in the order: Process : Burst Time : Priority respectively . P1 : 10 : 3 , P2 : 1 : 1 , P3 : 2 : 4 , P4 : 1 : 5 , P5 : 5 : 2.

8 milliseconds

8.2 milliseconds

7.75 milliseconds

3 milliseconds

Question 5. 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 6. The degree of Multiprogramming is controlled by

CPU Scheduler

Context Switching

Long-term Scheduler

Medium term Scheduler

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. _________ page replacement alogorithm suffers from Belady's anamoly.





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

best fit

worst fit

first fit

none of the above

Question 10. In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of, Starvation ? low priority processes may never execute, is resolved by ?

Terminating the process.


Mutual Exclusion