Answer:
Preemptive scheduling is the scheduling which a process given to the CPU can be suspended if a more suitable process comes between execution.
For example :- In SJF (Shortest Job First) a more smaller process comes between the execution the CPU will execute the new process and the process which was in the execution will be suspended for the time being.
Non-Preemptive scheduling cannot suspend the process in between if a process is in execution it will be fully executed then other process will get executed.
Strict Non preemptive scheduling are not suitable for computer centers because it cannot execute process with more priority if it comes between the execution.
An Internet (C). because (A) is written wrong and there is nothing called extranet
Answer:
the consecutive two elements and swap them based on the value which is larger if we go for ascending order
Explanation:
bubble sort compares 2 consecutive elements of the list and swap them. in one iteration one value will be placed correctly depending on the sorting order either ascending or descending
Answer:
True
Explanation:
Forwarded events can only be recorded when systems administrators have de-established an event subscription.
