Answer:
Currently running process
Explanation:
In preemptive priority scheduling there is usually a form of comparison of the schedule with the other function or processes which are present in the queue also.
In preemptive priority scheduling, when a process arrives at the ready queue, its priority is compared with the priority of currently running process.
Answer:
Answer is B, see explanations.
Explanation:
Answer is (B) NP−complete∩P=ϕ
Since, P≠NP, there is at least one problem in NP, which is harder than all P problems. Lets take the hardest such problem, say X. Since, P≠NP,X∉P .
Now, by definition, NP−complete problems are the hardest problems in NP and so X problem is in NP−complete. And being in NP, X can be reduced to all problems in NP−complete, making any other NP−complete problem as hard as X. So, since X∉P, none of the other NP−complete problems also cannot be in P.
A graphics processing unit. (GPU)
