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. Macintosh computer uses

  • System 7.0
  • AU/X
  • Xenix
  • none of above

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

  • instruction
  • compiler
  • program
  • interpretor

3. Which is non pre-emptive

  • Round robin
  • FIFO
  • MQS
  • MQSF

4. Dynamic allocation of storage areas with VSAM files is accomplished by

  • hashing
  • control splits
  • over flow areas
  • relative recording

5. The LRU algorithm

  • pages out pages that have been used recently
  • pages out pages that have not been used recently
  • pages out pages that have been least used recently
  • pages out the first page in a given area
Read more from - Operating System Questions Answers - Chapter 1