(A) Preemptive scheduling
(B) Non-preemptive scheduling
(C) Both of the above
(D) None of the above
Tag: Operating System Concepts
Which scheduling algorithm allocates the CPU first to process that request the CPU first?
(A) Priority Scheduling Algorithm
(B) Round Robin Scheduling Algorithm
(C) First in First out Scheduling Algorithm
(D) None of the above
Increase in priority of any process to overcome starvation problem of priority algorithm is called?
(A) Paging
(B) Mapping
(C) Aging
(D) Swapping
Indefinite blocking problem in priority scheduling algorithm is called?
(A) Aging
(B) Preemption
(C) Starvation
(D) None of the above
Which of the following scheduling algorithm gives minimum average waiting time?
(A) Shortest Job First
(B) FIFO algorithm
(C) Round Robin Scheduling Algorithm
(D) Priority Scheduling Algorithm
Scheduler selects a process from the processes in memory that are ready to execute and allocates the CPU to the process is?
(A) Short term scheduler
(B) Long term scheduler
(C) Middle term scheduler
(D) None of the above
To avoid the race condition the number of processes that may be simultaneously inside their critical section is?
(A) 0
(B) 1
(C) 8
(D) 16
Problem solved by Banker algorithm is?
(A) Cache coherence
(B) Deadlock recovery
(C) Deadlock avoidance
(D) Mutual exclusion