Question

During the course of execution, process moves from one state to another state in the state diagram. The only state transition that is initiated by the user process itself is none of the options admit dispatch release Question 4 A scheduler controls the running sequence of processes. The algorithm used by the scheduler is called the scheduling algorithm. Which of the following features is not possible to achieve? Ensuring that each process gets its fair share of the CPU Keeping the CPU busy 100 percent of the time O Maximizing the number of jobs processed per hour Minimizing the time users have to wait for output

Answer 1

1.Answer for the first question is

None of the options

Blocked is the only state transition which will be initiated by the user process itself

Admit is the transition between new and ready

Dispatch is the transition between ready and running

Release is the transition between running and exit

2. Answer for the second question is

Keeping the CPU busy 100 percent of the time

Because any type of CPU scheduling algorithm offers some kind of jobs will definitely hurt other jobs and also the amount of CPU time is finite. Also for real time operating system the time is range from 40% for low level and 90% for high level system