Question
a.
First-come, first-served scheduling
b.
Shortest Remaining time
c.
Preemptive priority Scheduling
d.
Round-robin scheduling
Posted under Operating System
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Which one scheduling algorithm is designed especially for time sharing systems
Similar Questions
Discover Related MCQs
Q. Push migration and pull migration are two types of ________ approach
View solution
Q. Two general approaches are used to handle critical sections in operating systems which are preemptive and nonpreemptive ________
View solution
Q. A _______ is a technique for passing information from one program process to another
View solution
Q. The value of a binary semaphore can range between
View solution
Q. Binary semaphores are also known as
View solution
Q. A collection of instructions (or operations) that performs a single logical function is called a
View solution
Q. Which one operation signifies that the transaction has terminated its execution
View solution
Q. Which one is an example of race condition
View solution
Q. In deadlock,only one process at a time can use the resource,this condition is called
View solution
Q. ________ is solved by Dijkstra's banking algorithm
View solution
Q. The run-time mapping from virtual to physical addresses is done by a hardware device called
View solution
Q. Whenever the CPU scheduler decides to execute a process, it calls the
View solution
Q. The total transfer time is ________ to the amount of memory swapped
View solution
Q. Which one is a memory-management scheme that permits the physical address space of a process to be noncontiguous
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)
