Navigate

Question Detail

Which among following scheduling algorithms give minimum average waiting time

  • FCFS
  • SJF
  • Round robin
  • On priority

Answer: Option B

Similar Questions :

1. If the property of locality of reference is well pronounced in a program

  • the number of page faults will be more
  • the number of page faults will be less
  • the number of page faults will same
  • none of above

Answer: Option B

2. Disk scheduling includes deciding

  • which should be accessed next
  • order in which disk access requests must be serviced
  • the physical location of the file
  • the logical location of the file

Answer: Option B

3. In real time OS, which is most suitable scheduling scheme

  • round robin
  • FCFS
  • pre-emptive scheduling
  • random scheduling

Answer: Option C

4. Dijkstra's algorithm deals with

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

Answer: Option C

5. Macintosh computer uses

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

Answer: Option B

Read more from - Operating System Questions Answers - Chapter 1