CMPE320 EXAM 2 questions and verified answers with
complete solutions verified
A CPU scheduling algorithm
determines an order for the
execution of its sched- uled n!
processes. Given n processes to
be scheduled on one processor,
how many different schedules are
possible? Preemptive = Process can be
interrupted Non-preemptive =
Explain the difference between Process cannot be in- terrupted
preemp- tive and non-preemptive Turnaround Time = Finish Time -
scheduling Arrival Time
What is the equation for
Turnaround Time?
Waiting Time = Turnaround
What is the equation for Waiting Time?
Time - Burst Tim
e
Explain First Come First Serve favor of short processes?
(FCFS) Scheduling How much does RR scheduling
Explain Shortest Job First (SJF) algo- rithms discriminate in favor
Sched- uling of short processes?
How does SJF Scheduling change if
you allow preemption?
Explain Round Robin (RR)
Scheduling
What advantage is there in having
differ- ent time-quantum sizes at
different levels of multilevel
queuing system?
How much does FCFS scheduling
al- gorithms discriminate in
,CMPE320 EXAM 2 questions and verified answers with
complete solutions verified
Processes run in the order they
arrive.
The job with the shortest burst
time runs first.
If you allow preemption, then if a
job ar- rives that is shorter than
the current one running, it will
interrupt the current job and run
the new shorter job.
Algorithm has a quantum time and
takes turns running each job in the
order they arrived for the length of
the quantum time.
The advantage is that only allot a
large amount of CPU time to
processes that are taking forever.
So if a job is very short, it doesn't
have any busy
If long processes gets in first, then
later short ones will hang.
Short processes can finish early
depend- ing on the quantum time.
,CMPE320 EXAM 2 questions and verified answers with
complete solutions verified
How much do multilevel feedback A. SJF
queues scheduling algorithms B. FCFS
discrimi- nate in favor of short
processes?
Which of the following is true of
cooper- ative scheduling?
A. It requires a timer
B. A process keeps the CPU until it
re- leases the CPU either by
terminating or by switching to a
waiting state
C. It incurs a cost associated with
access to shared data
D. A process switches from
running state to the ready state
when an interrupt oc- curs.
is the number of processes that
are completed per time unit.
A. CPU Utilization
B. Response Time
C. Turnaround Time
D.Throughput
scheduling is approximated by
pre- dicting the next CPU burst
with an expo- nential average of
the measured lengths of previous
CPU bursts
A. Multilevel Queue
B. RR
C. FCFS
D.SJF
The scheduling algorithm is
de- signed especially for time-
sharing sys- tems.
, CMPE320 EXAM 2 questions and verified answers with
complete solutions verified
Same as Round Robin
Short processes can finish early
depend- ing on the quantum time.
B. A process keeps the CPU until it
re- leases the CPU either by
terminating or by switching to a
waiting state.
D. Throughput
D. SJF
C. RR
complete solutions verified
A CPU scheduling algorithm
determines an order for the
execution of its sched- uled n!
processes. Given n processes to
be scheduled on one processor,
how many different schedules are
possible? Preemptive = Process can be
interrupted Non-preemptive =
Explain the difference between Process cannot be in- terrupted
preemp- tive and non-preemptive Turnaround Time = Finish Time -
scheduling Arrival Time
What is the equation for
Turnaround Time?
Waiting Time = Turnaround
What is the equation for Waiting Time?
Time - Burst Tim
e
Explain First Come First Serve favor of short processes?
(FCFS) Scheduling How much does RR scheduling
Explain Shortest Job First (SJF) algo- rithms discriminate in favor
Sched- uling of short processes?
How does SJF Scheduling change if
you allow preemption?
Explain Round Robin (RR)
Scheduling
What advantage is there in having
differ- ent time-quantum sizes at
different levels of multilevel
queuing system?
How much does FCFS scheduling
al- gorithms discriminate in
,CMPE320 EXAM 2 questions and verified answers with
complete solutions verified
Processes run in the order they
arrive.
The job with the shortest burst
time runs first.
If you allow preemption, then if a
job ar- rives that is shorter than
the current one running, it will
interrupt the current job and run
the new shorter job.
Algorithm has a quantum time and
takes turns running each job in the
order they arrived for the length of
the quantum time.
The advantage is that only allot a
large amount of CPU time to
processes that are taking forever.
So if a job is very short, it doesn't
have any busy
If long processes gets in first, then
later short ones will hang.
Short processes can finish early
depend- ing on the quantum time.
,CMPE320 EXAM 2 questions and verified answers with
complete solutions verified
How much do multilevel feedback A. SJF
queues scheduling algorithms B. FCFS
discrimi- nate in favor of short
processes?
Which of the following is true of
cooper- ative scheduling?
A. It requires a timer
B. A process keeps the CPU until it
re- leases the CPU either by
terminating or by switching to a
waiting state
C. It incurs a cost associated with
access to shared data
D. A process switches from
running state to the ready state
when an interrupt oc- curs.
is the number of processes that
are completed per time unit.
A. CPU Utilization
B. Response Time
C. Turnaround Time
D.Throughput
scheduling is approximated by
pre- dicting the next CPU burst
with an expo- nential average of
the measured lengths of previous
CPU bursts
A. Multilevel Queue
B. RR
C. FCFS
D.SJF
The scheduling algorithm is
de- signed especially for time-
sharing sys- tems.
, CMPE320 EXAM 2 questions and verified answers with
complete solutions verified
Same as Round Robin
Short processes can finish early
depend- ing on the quantum time.
B. A process keeps the CPU until it
re- leases the CPU either by
terminating or by switching to a
waiting state.
D. Throughput
D. SJF
C. RR
