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. Banker's algorithm deals with

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

2. Fragmentation of a file system

  • occurs only is file is not used properly
  • can always be prevented
  • happens in all file systems
  • can be removed by compaction

3. Which is non pre-emptive

  • Round robin
  • FIFO
  • MQS
  • MQSF

4. Which is single user operating system

  • MS-DOS
  • UNIX
  • XENIX
  • LINUX

5. Memory protection is normally done by

  • the processor and the associated hardware
  • the operating system
  • the compiler
  • the user program
Read more from - Operating System Questions Answers - Chapter 1
Post a comment

  • Richa 11 years ago

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

  • shreyas 11 years ago

    why pre-emptive?

    mastguru 11 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.