Scribd
Upload
51 views4 pages

5 Sheet

This document discusses processor scheduling in operating systems. It covers topics like short term, medium term, and long term scheduling and different scheduling algorithms like FCFS, round robin, shortest process next, and their pros and cons.

Uploaded by

inosta11111
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
51 views4 pages

5 Sheet

This document discusses processor scheduling in operating systems. It covers topics like short term, medium term, and long term scheduling and different scheduling algorithms like FCFS, round robin, shortest process next, and their pros and cons.

Uploaded by

inosta11111
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Operating Systems, Scheduling Chapter 5

True / False Questions:


1. – Scheduling affects the performance of a system because it determines which processes will wait and
which will progress.
2. – The short-term scheduler may limit the degree of multiprogramming to provide satisfactory service to the
current set of processes.
3. – Medium-term scheduling is part of the system swapping function.
4. – The long-term scheduler is invoked whenever an event occurs that may lead to the suspension or
preemption of the currently running process.
5. – The main objective of short-term scheduling is to allocate processor time in such a way as to optimize one
or more aspects of system behavior.
6. – One problem with a pure priority scheduling scheme is that lower-priority processes may suffer deadlock.
7. – The selection function determines which process, among ready processes, is selected next for execution.
8. – First-come-first-served (FCFS) is a simple scheduling policy that tends to favor I/O-bound processes over
processor bound processes.
9. – Round Robin is a scheduling technique is also known as time slicing, because each process is given a
slice of time before being preempted.
10. – The Shortest Process Next (SPN) scheduling policy is often used for time-sharing and transaction
processing environments because of the lack of preemption.
11. – The Shortest Remaining Time (SRT) scheduling policy is a preemptive version of the Shortest Process
Next (SPN) scheduling policy.
12. – In the Highest Response Ratio Next (HRRN) scheduling policy, longer jobs are favored, because they
yield a larger ratio from the smaller denominator in the equation.
13. – A disadvantage of simulation is that results for a given “run” only apply to that particular collection of
processes under that particular set of assumptions.
14. – In “fair share” scheduling, each user is assigned a weighting of some sort that defines that user’s share of
system resources as a fraction of the total usage of those resources.

Multiple Choice Questions:


1. The type of scheduling that involves the decision to add a process to those that are at least partially in main
memory and therefore available for execution is referred to as:
a-Long-term scheduling b-Medium-term scheduling c-I/O scheduling d-None of the above
2. The decision as to which job to admit to the system next can be based on which of the following criteria:
a. Simple FIFO b-Priority c-I/O requirements d-All of the above
3. Typically, the swapping-in function for processes is based on the need to manage:
a. Process priorities b-Virtual memory
c-The degree of multiprogramming d-None of the above
4. In terms of frequency of execution, the short-term scheduler is usually the one that executes:
a- Most frequently b-Least frequently c-About the same as the other schedulers d-None of the above
5. Response time in an interactive system is an example of:
a. System-oriented criteria for short-term scheduling policies
b. User-oriented criteria for short-term scheduling policies
c. System-oriented criteria for long-term scheduling policies d-None of the above
6. A typical way to overcome starvation of lower-priority processes in a priority-based scheduling system is to:
a. Change a process priority randomly b-Change a process priority with its age
c. Round-robin cycling of processes in a priority queue d-All of the above
7. Which of the following scheduling policies allow the O/S to interrupt the currently running process and move
it to the Ready state?
a. Preemptive b-Non-Preemptive c-First-come-first-served d-None of the above
8. In terms of the queuing model, the total time that a process spends in a system (waiting time plus service
time) is called:
a. Normalized turnaround time (TAT) b-Finish time (FT)
b. Turnaround or residence time (TAT) d- None of the above
9. In the Round Robin scheduling technique, the principle design issue is:
a. Determining the fair distribution of time quanta to individual processes
b. Determining the method of cycling through a given set of processes
c. Determining the length of the time quantum d-None of the above
10. One difficulty with the Shortest Process Next (SPN) scheduling technique is:
a. The need to know or estimate required processing times for each process
b. The starvation of longer processes

Page 1 of 4
Operating Systems, Scheduling Chapter 5
c. The lack of preemption d-All of the above
11. One difficulty with the Shortest Remaining Time (SRT) scheduling technique is:
a. The need to know or estimate required processing times for each process
b. The starvation of shorter processes
c. The lack of preemption d-All of the above
12. Which of the following scheduling policies require prior knowledge or estimation of process length:
a. Shortest Remaining Time (SRT) b-Shortest Process Next (SPN)
c. Highest Response Ratio Next (HRRN) d-All of the above
13. It is impossible to make definitive comparisons of various scheduling policies due to dependence on factors
such as:
a. The probability distribution of service times of the various processes
b. The efficiency of the scheduling and context switching mechanisms
c. The nature of the I/O demand and performance of the I/O subsystem d-All of the above
14. The strategy that schedules processes based on their group affiliation is generally referred to as:
a. Queuing analysis b-Simulation modeling c-Fair share scheduling d-All of the above

Fill-In-The-Blank Questions:
1. The task of assigning processes to the processor or processors over time, in a way that meets system
objectives is called _______________.
2. The decision as to when to create a new process is generally driven by the desired degree of
_______________.
3. _______________-term scheduling is part of the system swapping function.
4. The _______________-term scheduler is invoked whenever an event occurs that may lead to the
suspension or preemption of the currently running process.
5. Response time and throughput are examples of _______________-related criteria for short-term scheduling
6. In a system employing priority scheduling, the scheduler always selects the process with the
_______________ priority level for processing.
7. The _______________, which has two general categories, specifies the instants in time at which the
selection function is exercised.
8. In terms of the queuing model, the total time that a process spends in a system (waiting time plus service
time) is called the _______________.
9. The Round Robin scheduling technique is also known as _______________, because each process is given
a set amount of processor time before being preempted.
10. _______________ is a scheduling policy in which the process with the shortest expected processing time is
selected next, but there is no preemption.
11. _______________ is a scheduling policy in which the process with the shortest expected processing time is
selected next, and if a shorter process becomes ready in the system, the currently running process is
preempted.
12. A scheduling mechanism that requires no prior knowledge of process length, yet can nevertheless favor
shorter jobs, is known as the _______________ scheduling mechanism.
13. In _______________ scheduling, each user is assigned a weighting of some sort that defines that user’s
share of system resources as a fraction of the total usage of those resources.

Page 2 of 4
Operating Systems, Scheduling Chapter 5
1. Briefly describe the three types of processor scheduling.
2. What is usually the critical performance requirement in an interactive operating system?
3. What is the difference between turnaround time and response time?
4. For process scheduling, does a low-priority value represent a low priority or a high priority?
5. What is the difference between preemptive and nonpreemptive scheduling?
6. Briefly define FCFS scheduling.
7. Briefly define round-robin scheduling.
8. Briefly define shortest-process-next scheduling.
9. Briefly define shortest-remaining-time scheduling.
10. Briefly define highest-response-ratio-next scheduling.
11. Briefly define feedback scheduling.
12. What advantage is there in having different time-quantum sizes on different levels of a
multilevel queuing system?
Problems
1-

Page 3 of 4
Operating Systems, Scheduling Chapter 5
2-

3-

Page 4 of 4

You might also like