OS S7 10-03-23

The processes that are residing in main memory and are ready and waiting to execute are kept on a list called _____________

• a) job queue

• b) ready queue

• c) execution queue

• d) process queue

In priority scheduling algorithm ____________

• a) CPU is allocated to the process with highest priority

• b) CPU is allocated to the process with lowest priority

• c) Equal priority processes can not be scheduled

• d) None of the mentioned

Which algorithm is defined in Time quantum?

• a) shortest job scheduling algorithm

• b) round robin scheduling algorithm

• c) priority scheduling algorithm

• d) multilevel queue scheduling algorithm

Select one which algorithms tend to minimize the process flow time?

• A. First come First served

• B. Earliest Deadline First

• C. Shortest Job First

• D. Longest Job First

The FIFO algorithm said :

Answer - Click Here:

• A. executes the job first that needs a minimal processor

• B. the job first executes that comes last in the queue

• C. the job first executes that has maximum processor needs

• D. the job first executes that came in first in the queue

From the time of submission of a process to the time of completion, The interval is termed as

• A. waiting time

• B. turnaround time

• C. response time

• D. throughput