To Implement CPU Scheduling Algorithms

Pre Test

1. 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

2. The interval from the time of submission of a process to the time of completion is termed as ____________ .

a) waiting time
b) turnaround time
c) response time
d) throughput

3. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

a) First-come, first-served scheduling
b) Shortest job scheduling
c) Priority scheduling
d) None of the mentioned

4. 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

5. In priority scheduling algorithm ____________ .

a) equal priority processes can not be scheduled
b) CPU is allocated to the process with highest priority
c) CPU is allocated to the process with lowest priority
d) None of the above