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

Answer: Option B

2. A public key encryption system

  • Allows only the correct sender to decode the data
  • Allows only the correct receiver to decode the data
  • Allows anyone to decode the data
  • none of above

Answer: Option B

3. To avoid the race condition, the number of processes that may be simultaneously inside the critical section is

  • 12
  • 3
  • 1
  • 0

Answer: Option C

4. Dispatcher function is to

  • put tasks in I/O wait
  • schedule tasks in processor
  • change task priorities
  • All of above

Answer: Option A

5. Dirty bit is used to show

  • Page with corrupted data
  • Wrong page in memory
  • Page that is modified after being loaded in the cache memory
  • page that is less frequently accessed

Answer: Option C

Read more from - Operating System Questions Answers - Chapter 1