Question
a.
Shortest job first scheduling
b.
Round robin scheduling
c.
Priority scheduling
d.
Fair share scheduling
Posted under UGC NET computer science question paper Operating System
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. An example of a non-preemptive CPU scheduling algorithm is:
Similar Questions
Discover Related MCQs
Q. There are ‘n’ processes in memory. A process spends a fraction ‘p’ of its time waiting for I/O to complete. The CPU utilization is given by:
View solution
Q. With 64 bit virtual addresses, a 4KB page and 256 MB of RAM, an inverted page table requires:
View solution
Q. A computer has 6 tape drives with ‘n’ processes competing for them. Each process may need two drives. For which values of ‘n’ is the system deadlock free ?
View solution
Q. A program has five virtual pages, numbered from 0 to 4. If the pages are referenced in the order 012301401234, with three page frames, the total number of page faults with FIFO will be equal to:
View solution
Q. Average process size=s bytes. Each page entry requires e bytes. The optimum page size is given by:
View solution
Q. The aging algorithm with a=0.5 is used to predict run times. The previous four runs from oldest to most recent are 40, 20, 20 and 15 msec. The prediction for the next time will be:
View solution
Q. Moving process from main memory to disk is called:
View solution
Q. Part of a program where the shared memory is accessed and which should be executed indivisibly, is called:
View solution
Q. Windows is a .................. operating system.
View solution
Q. Which page replacement policy suffers from Belady’s anomaly?
View solution
Q. Cache memory is:
View solution
Q. ....................is one of pre-emptive scheduling algorithm.
View solution
Q. A software to create a Job Queue is called...................
View solution
Q. In processor management, round robin method essentially uses the preemptive version of ...................
View solution
Q. A page fault ..................
View solution
Q. .................. synchronize critical resources to prevent deadlock.
View solution
Q. The memory allocation scheme subjected to “external” fragmentation is:
View solution
Q. Producer consumer problem can be solved using:
View solution
Q. Banker’s algorithm is used for ................... purpose.
View solution
Q. Bankers algorithm is for
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
.png)
