Welcome to Operating System Quiz, Advanced Level !!

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. 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 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. 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 5. 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


Question 6. 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 7. 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 8. _________ is a high speed cache used to hold recently referenced page table entries a part of paged virtual memory

Translation Lookaside buffer

Inverse page table

Segmented page table

all of the above

Question 9. The degree of Multiprogramming is controlled by

CPU Scheduler

Context Switching

Long-term Scheduler

Medium term Scheduler

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