CS 370 Ed Jorgensen Test 2 Exam
UPDATED ACTUAL QUESTIONS AND
CORRECT ANSWERS
List the memory map - CORRECT ANSWER stack
...
heap
BSS
Data
Text
Res
What is a process table? - CORRECT ANSWER An array of structs that contains process
control blocks (PCB)
What are the 5 process states? - CORRECT ANSWER New, Ready, Running, Waiting,
Terminating
What is a process context switch? - CORRECT ANSWER One process is running and another
process is switched to. All of the current running processes registers are saved in the PCB and then the
new processes registers are restored.
Describe the New process state - CORRECT ANSWER When a process is being created. Its
given a process id, its allocated a PCB in the process table. Memory has to be allocated. Secondary
storage data is loaded in.
Describe the Ready process state - CORRECT ANSWER Processes are put in the ready queue.
It waits for the short term scheduler to assign it a core before its put in the running state.
When does the long term scheduler occur? - CORRECT ANSWER Before the New process
state
,When does the short-term scheduler occur? - CORRECT ANSWER Between the ready and
running state
When does the medium state scheduler occur? - CORRECT ANSWER Between running and
waiting
Describe the Running process state - CORRECT ANSWER The process is currently running,
can go to either Terminated, Waiting, or back to Ready queue if its runs through its entire time slice.
Describe the Terminated process state - CORRECT ANSWER The process is complete.
Resources are deallocated. Entry in process table is deallocated, any open files are closed.
Describe the Waiting process state - CORRECT ANSWER When a process is waiting for input,
such as I/O. Goes into ready once done.
Describe non-preemptive scheduling - CORRECT ANSWER A process cannot be preempted. It
can use the core as long as it wants to. Process is allowed to execute until termination or if it
voluntarily gives up the core if it is waiting.
Describe preemptive scheduling - CORRECT ANSWER A process can be preempted. Process
is allowed to execute until termination, if its waiting, or until a maximum time is reached (time slice)
Which type of scheduling requires a more comprehensive scheduler and why? - CORRECT
ANSWER Preemptive. It is more responsive (. It is able to handle a wider range or tasks. Its
able to support varying priorities.
What are the CPU scheduling responsibilities? - CORRECT ANSWER Must share CPU
resources (cores) among all processes that need the resource.
Describe Batch CPU scheduling - CORRECT ANSWER One job at a time. Each processes is
finished before a new one is done. An example might be accounting. Account receivables has to be
done before accounts payable.
Describe Interactive CPU scheduling - CORRECT ANSWER Scheduling that is fully
preemptive. There is a need for responsiveness and handing priorities.
,Describe Process Behavior CPU scheduling - CORRECT ANSWER Compute Bound - utilizing
time slices to do computation (cccccccc burst of computation)
I/O Bound - CPU Burst then waiting for I/O
(c----c----c CPU burst of computation then waiting on I/O)
Are most processes compute bound or I/O bound? - CORRECT ANSWER Neither, most of the
time they alternate between compute bound and I/O bound.
What are the goals of scheduling? - CORRECT ANSWER Keep CPU busy
Fairness (avoid starvation)
Policy enforcement (
Batch (maximize throughput, minimize job turn-around)
Interactive (good response time)
What is the purpose of the Policy? - CORRECT ANSWER To separate what is allowed with
how it is done (with the scheduler)
Where is the Policy set? - CORRECT ANSWER It is set externally by the users and is input to
the scheduler
Whats an example of a Policy? - CORRECT ANSWER Lower priority for background jobs and
higher priority for foreground jobs
A process that performs a large number of calculations is referred to as - CORRECT
ANSWER Compute bound.
A process that performs a large number amount of I/O is referred to as - CORRECT
ANSWER I/O bound.
Broadly speaking, most processes ______________.
, - are preemptive.
- are compute bound.
- are I/O bound.
- alternate between bursts of computing and I/O (disk or network). - CORRECT
ANSWER alternate between bursts of computing and I/O (disk or network).
What does it mean for a scheduling system to be nonpreemptive? Check all that apply.
- Proceeses are allow to run for some maximum allowed time (time-slice).
- Select the next process to schedule when current process blocks.
- Processes are preempted in order to more effectively share the CPU core.
- Processes are not prempted and they execute until completion. - CORRECT ANSWER Select
the next process to schedule when current process blocks.
Processes are not prempted and they execute until completion.
What does it mean for a scheduling system to be preemptive? Check all that apply.
- Processes are allow to run for some maximum allowed time (time-slice).
- Select the next process to schedule when current process blocks.
- Processes are preempted in order to more effectively share the CPU core.
- Processes are not prempted and they execute until completion. - CORRECT
ANSWER Proceeses are allow to run for some maximum allowed time (time-slice).
Select the next process to schedule when current process blocks.
Processes are preempted in order to more effectively share the CPU core.
Which of the following are considered goals of an OS scheduler? Check all that apply.
- Ensure fairness.
- Starvation freedom.
- Good response time.
- Implement preemption.
- Policy enforcement. - CORRECT ANSWER Ensure fairness.
Starvation freedom.
Good response time.
UPDATED ACTUAL QUESTIONS AND
CORRECT ANSWERS
List the memory map - CORRECT ANSWER stack
...
heap
BSS
Data
Text
Res
What is a process table? - CORRECT ANSWER An array of structs that contains process
control blocks (PCB)
What are the 5 process states? - CORRECT ANSWER New, Ready, Running, Waiting,
Terminating
What is a process context switch? - CORRECT ANSWER One process is running and another
process is switched to. All of the current running processes registers are saved in the PCB and then the
new processes registers are restored.
Describe the New process state - CORRECT ANSWER When a process is being created. Its
given a process id, its allocated a PCB in the process table. Memory has to be allocated. Secondary
storage data is loaded in.
Describe the Ready process state - CORRECT ANSWER Processes are put in the ready queue.
It waits for the short term scheduler to assign it a core before its put in the running state.
When does the long term scheduler occur? - CORRECT ANSWER Before the New process
state
,When does the short-term scheduler occur? - CORRECT ANSWER Between the ready and
running state
When does the medium state scheduler occur? - CORRECT ANSWER Between running and
waiting
Describe the Running process state - CORRECT ANSWER The process is currently running,
can go to either Terminated, Waiting, or back to Ready queue if its runs through its entire time slice.
Describe the Terminated process state - CORRECT ANSWER The process is complete.
Resources are deallocated. Entry in process table is deallocated, any open files are closed.
Describe the Waiting process state - CORRECT ANSWER When a process is waiting for input,
such as I/O. Goes into ready once done.
Describe non-preemptive scheduling - CORRECT ANSWER A process cannot be preempted. It
can use the core as long as it wants to. Process is allowed to execute until termination or if it
voluntarily gives up the core if it is waiting.
Describe preemptive scheduling - CORRECT ANSWER A process can be preempted. Process
is allowed to execute until termination, if its waiting, or until a maximum time is reached (time slice)
Which type of scheduling requires a more comprehensive scheduler and why? - CORRECT
ANSWER Preemptive. It is more responsive (. It is able to handle a wider range or tasks. Its
able to support varying priorities.
What are the CPU scheduling responsibilities? - CORRECT ANSWER Must share CPU
resources (cores) among all processes that need the resource.
Describe Batch CPU scheduling - CORRECT ANSWER One job at a time. Each processes is
finished before a new one is done. An example might be accounting. Account receivables has to be
done before accounts payable.
Describe Interactive CPU scheduling - CORRECT ANSWER Scheduling that is fully
preemptive. There is a need for responsiveness and handing priorities.
,Describe Process Behavior CPU scheduling - CORRECT ANSWER Compute Bound - utilizing
time slices to do computation (cccccccc burst of computation)
I/O Bound - CPU Burst then waiting for I/O
(c----c----c CPU burst of computation then waiting on I/O)
Are most processes compute bound or I/O bound? - CORRECT ANSWER Neither, most of the
time they alternate between compute bound and I/O bound.
What are the goals of scheduling? - CORRECT ANSWER Keep CPU busy
Fairness (avoid starvation)
Policy enforcement (
Batch (maximize throughput, minimize job turn-around)
Interactive (good response time)
What is the purpose of the Policy? - CORRECT ANSWER To separate what is allowed with
how it is done (with the scheduler)
Where is the Policy set? - CORRECT ANSWER It is set externally by the users and is input to
the scheduler
Whats an example of a Policy? - CORRECT ANSWER Lower priority for background jobs and
higher priority for foreground jobs
A process that performs a large number of calculations is referred to as - CORRECT
ANSWER Compute bound.
A process that performs a large number amount of I/O is referred to as - CORRECT
ANSWER I/O bound.
Broadly speaking, most processes ______________.
, - are preemptive.
- are compute bound.
- are I/O bound.
- alternate between bursts of computing and I/O (disk or network). - CORRECT
ANSWER alternate between bursts of computing and I/O (disk or network).
What does it mean for a scheduling system to be nonpreemptive? Check all that apply.
- Proceeses are allow to run for some maximum allowed time (time-slice).
- Select the next process to schedule when current process blocks.
- Processes are preempted in order to more effectively share the CPU core.
- Processes are not prempted and they execute until completion. - CORRECT ANSWER Select
the next process to schedule when current process blocks.
Processes are not prempted and they execute until completion.
What does it mean for a scheduling system to be preemptive? Check all that apply.
- Processes are allow to run for some maximum allowed time (time-slice).
- Select the next process to schedule when current process blocks.
- Processes are preempted in order to more effectively share the CPU core.
- Processes are not prempted and they execute until completion. - CORRECT
ANSWER Proceeses are allow to run for some maximum allowed time (time-slice).
Select the next process to schedule when current process blocks.
Processes are preempted in order to more effectively share the CPU core.
Which of the following are considered goals of an OS scheduler? Check all that apply.
- Ensure fairness.
- Starvation freedom.
- Good response time.
- Implement preemption.
- Policy enforcement. - CORRECT ANSWER Ensure fairness.
Starvation freedom.
Good response time.
