download Mastguru Android App

Question Detail

In real time OS, which is most suitable scheduling scheme

  • round robin
  • FCFS
  • pre-emptive scheduling
  • random scheduling
Similar Questions :

1. Dijkstra's algorithm deals with

  • mutual exclusion
  • deadlock recovery
  • deadlock avoidance
  • cache coherence

2. Which among following scheduling algorithms give minimum average waiting time

  • FCFS
  • SJF
  • Round robin
  • On priority

3. Banker's algorithm deals with

  • deadlock prevention
  • deadlock avoidance
  • deadlock recovery
  • mutual exclusion

4. Semophores are used to solve the problem of

  • race condition
  • process synchronization
  • mutual exclusion
  • belady problem

5. Belady anamoly occurs in

  • Optimal replacement
  • FIFO
  • LRU
  • both in FIFO and LRU
Read more from - Operating System Questions Answers - Chapter 1
Post a comment

  • Richa 10 years ago

    In which of the following scheduling polices does context switching never take place?

  • shreyas 10 years ago

    why pre-emptive?

    mastguru 10 years ago replied

    Pre-emptive scheduling takes effect when two jobs compete for the same job slots. If a high-priority job is pending, It can suspend a lower-priority job that is running, and then start the high-priority job instead.

    So In real time, we have certain priority based jobs and pre-emptive scheduling can tackle it.