Welcome to Operating System Quiz, Advanced Level !!

Question 1. In interactive environments such as time-sharing systems, the primary requirement is to provide reasonably good response time and in general, to share system resources equitably. In such situations, the scheduling algorithm that is most popularly applied is ________.

Shortest Remaining Time Next (SRTN) Scheduling

Priority Based Preemptive Scheduling

Round Robin Scheduling

none of the above

Question 2. 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 3. Demand paged memory allocation

allows the virtual address space to be independent of the physical memory

allows the virtual address space to be a multiple of the physical memory size

allows deadlock to be detected in paging schemes

is present only in Windows NT

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. In one of the deadlock prevention methods, impose a total ordering of all resource types, and require that each process requests resources in an increasing order of enumeration. This violates which condition of deadlock

Mutual exclusion

Hold and Wait

Circular Wait

no preemption

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

LRU

MRU

FIFO

LIFO