Question Detail

Which scheduling policy is best suited for time-sharing operating systems

  • Shortest job first
  • Round robin
  • First come first serve
  • Elevator
Similar Questions :

1. For multiprogramming operating system

  • special support from processor is essential
  • special support from processor is not essential
  • cache memory is essential
  • none of above

2. Banker's algorithm deals with

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

3. A series of statements explaining how the data is to be processed is called

  • instruction
  • compiler
  • program
  • interpretor

4. Which operating system use write through catches

  • UNIX
  • XENIX
  • ULTRIX
  • DOS

5. Shortest Job First executes first the job

  • with the least processor needs
  • that first entered the queue
  • that has been in the queue for the longest
  • that last entered the queue
Read more from - Operating System Questions Answers - Chapter 1