CPU Scheduling

multiple choice Questions with Answers prepares an individual for competitive exams, entrance exams, various tests and interviews. Questions have detailed problem descriptions and solutions with detailed explanations so that one can understand them easily. CPU scheduling is a process that allows one process to use the CPU while the execution of another process is on hold(in waiting state) due to unavailability of any resource like I/O etc, thereby making full use of CPU. The aim of CPU scheduling is to make the system efficient, fast, and fair.

1.
Using Priority Scheduling algorithm, find the average waiting time for the following set of processes given with their priorities in the order: Process : Burst Time : Priority respectively .P1 : 10 : 3 ,P2 : 1 : 1 , P3 : 2 : 4 ,P4 : 1 : 5 ,P5 : 5 : 2.

8 milliseconds

8.2 milliseconds

7.75 milliseconds

3 milliseconds

2.
A major problem with priority scheduling is _________.

Definite blocking

Starvation

Low priority

None of the above

3.
An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is ________.

FCFS scheduling algorithm

Round robin scheduling algorithm

Shorest job - first scheduling algorithm

None of the above

4.
In Priority Scheduling a priority number (integer) is associated with each process. The CPU is allocated to the process with the highest priority (smallest integer = highest priority). The problem of Starvation of low priority processes may never execute, is resolved by __________.

Terminating the process

Aging

Mutual Exclusion

Semaphore

6.
With the round robin CPU scheduling in a time-shared system ________.

Using very large time slice degenerates in to first come first served algorithm

Using extremely small time slices improve performance

Using extremely small time slices degenerate in to last in first out algorithm

Using medium sized time slices leads to shortest request time first algorithm

7.
Which of the following is a criterion to evaluate a scheduling algorithm?

CPU Utilization: Keep CPU utilization as high as possible

Throughput: number of processes completed per unit time

Waiting Time: Amount of time spent ready to run but not running

All of the above

8.
_________ does the job of allocating a process to the processor.

Long term scheduler

Short term scheduler

Medium term scheduler

Dispatcher

9.
In interactive environments such as time-sharing systems, the primary requirement is to provide reasonably good response time and in general, to share system resources equitably. In such situations, the scheduling algorithm that is most popularly applied is ________.

Shortest Remaining Time Next (SRTN) Scheduling

Priority Based Preemptive Scheduling

Round Robin Scheduling

None of the above

10.
In the multi-programming environment, the main memory consisting of _________ number of process.

Greater than 100

Only one

Greater than 50

More than one

11.
CPU Scheduling is the basis of _________ operating system.

Batch

Real time

Multiprogramming

Mono programming

12.
________ scheduler selects the jobs from the pool of jobs and loads into the ready queue.

Long term

Short term

Medium term

None of the above

13.
Saving the state of the old process and loading the saved state of the new process is called ________.

Context Switch

State

Multi programming

None of the above

14.
Using Priority Scheduling algorithm, find the average waiting time for the following set of processes given with their priorities in the order: Process : Burst Time : Priority respectively . P1 : 10 : 3 , P2 : 1 : 1 , P3 : 2 : 4 , P4 : 1 : 5 , P5 : 5 : 2.

8 milliseconds

8.2 milliseconds

7.75 milliseconds

3 milliseconds

15.
Under multiprogramming, turnaround time for short jobs is usually ________ and that for long jobs is slightly ___________.

Lengthened, Shortened

Shortened, Lengthened

Shortened, Shortened

Shortened, Unchanged

error: You are not allowed to do so.....
0Shares
0
Scroll to Top