Question Detail

Dispatcher function is to

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

Answer: Option A

Similar Questions :

1. Which among following scheduling algorithms give minimum average waiting time

FCFS
SJF
Round robin
On priority

Answer: Option B

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

Shortest job first
Round robin
First come first serve
Elevator

Answer: Option B

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

4. Banker's algorithm deals with

deadlock prevention
deadlock avoidance
deadlock recovery
mutual exclusion

Answer: Option B

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

Read more from - Operating System Questions Answers - Chapter 1