Quiz
Chapter 9 - OS2T
This quiz has question types that open in the usual player.
Questions in this quiz (45)
1In a multiprogramming system multiple processes exist concurrently in main memory.
- ATrue
- BFalse
2The key to multiprogramming is scheduling.
- ATrue
- BFalse
3The medium-term scheduler is invoked whenever an event occurs that may lead to the blocking of the current process or that may provide an opportunity to preempt a currently running process in favor of another.
- ATrue
- BFalse
4Scheduling affects the performance of the system because it determines which processes will wait and which will progress.
- ATrue
- BFalse
5The main objective of long-term scheduling is to allocate processor time in such a way as to optimize one or more aspects of system behavior.
- ATrue
- BFalse
6 In most interactive operating systems adequate response time is the critical requirement.
- ATrue
- BFalse
7One problem with a pure priority scheduling scheme is that lower-priority processes may suffer starvation.
- ATrue
- BFalse
8FCFS performs much better for short processes than long ones.
- ATrue
- BFalse
9Round robin is particularly effective in a general purpose time sharing system or transaction processing system.
- ATrue
- BFalse
10The objective of a fair-share scheduler is to monitor usage to give fewer resources to users who have had more than their fair share, and more to those who have had less than their fair share.
- ATrue
- BFalse
11The traditional UNIX scheduler employs multilevel feedback using round robin within each of the priority queues.
- ATrue
- BFalse
12First-come-first-served (FCFS) is a simple scheduling policy that tends to favor I/O bound processes over processor bound processes.
- ATrue
- BFalse
13In the Highest Response Ration Next (HRRN) scheduling policy, longer jobs are favored because they yield a larger ratio from the smaller denominator in the equation.
- ATrue
- BFalse
14A disadvantage of simulation is that results for a given run only apply to that particular collection of processes under that particular set of assumptions.
- ATrue
- BFalse
15In 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.
- ATrue
- BFalse
16The decision as to which available process will be executed by the processor:
- Along-term scheduling
- BI/O scheduling
- Cmedium-term scheduling
- Dshort-term scheduling
17The _________ determines which process, among ready processes, is selected next for execution.
- Adecision mode
- Bselection function
- CTAT
- Dlong-term scheduler
18Which of the following scheduling policies allow the O/S to interrupt the currently running process and move it to the Ready state?
- AFIFO
- BFCFS
- Cnon-pre-emptive
- Dpre-emptive
19The __________ specifies the instants in time at which the selection function is exercised.
- Adecision mode
- Bmedium-term scheduling
- Cready state
- DTAT
20The traditional UNIX scheduler divides processes into fixed bands of priority levels, with the highest priority band being the _________ .
- Auser process band
- Bswapper band
- Cfile manipulation band
- Dutilization band
21This is a decision whether to add a new process to the set of processes that are currently active:
- Ashort-term scheduling
- Blong-term scheduling
- Cmedium-term scheduling
- DI/O scheduling
22A risk with _________ is the possibility of starvation for longer processes, as long as there is a steady supply of shorter processes.
- ASRT
- BSPN
- CFIFO
- DFCFS
23The decision as to which process' pending I/O request shall be handled by an available I/O device:
- Along-term scheduling
- Bshort-term scheduling
- CI/O scheduling
- Dmedium-term scheduling
24In the case of the __________ policy, the scheduler always chooses the process that has the shortest expected remaining processing time.
- ASRT
- BFCFS
- CSPN
- DHRRN
25This is a decision whether to add a process to those that are at least partially in main memory and therefore available for execution:
- Along-term scheduling
- BI/O scheduling
- Cshort-term scheduling
- Dmedium-term scheduling
26Response time in an interactive system is an example of:
- Auser-oriented criteria for long-term scheduling policies
- Bsystem-oriented criteria for short-term scheduling policies
- Csystem-oriented criteria for long-term scheduling policies
- Duser-oriented criteria for short-term scheduling policies
27__________ considers the execution history of a related group of processes along with the individual execution history of each process in making scheduling decisions.
- ATAT
- BHRRN
- CFSS
- DFCFS
28The operating system must make _________ types of scheduling decisions with respect to the execution of processes.
- Asix
- Bfour
- Cfive
- Dthree
29Typically, the swapping-in function for processes is based on the need to manage __________ .
- Athe degree of multiprogramming
- BI/O requirements
- Cprocess priorities
- Dvirtual memory
30The strategy that schedules processes based on their group affiliation is generally referred to as _________ .
- Ashortest process next
- Bfair share scheduling
- Cqueueing analysis
- Dsimulation modeling
31The aim of [blank_start]__________[blank_end] is to assign processes to be executed by the processor or processors over time, in a way that meets system objectives, such as response time, throughput, and processor efficiency.
- Aprocessor scheduling
32The [blank_start]_________[blank_end] scheduler determines which programs are admitted to the system for processing.
- Along-term
33[blank_start]_________[blank_end] is the elapsed time between the submission of a request until the response begins to appear as output.
- AResponse time
34The simplest scheduling policy is [blank_start]__________[blank_end] .
- Afirst-come-first-served (FCFS)
35[blank_start]__________[blank_end] scheduling is part of the swapping function.
- AMedium-term
36In terms of the queuing model, [blank_start]__________[blank_end] is the total time that the item spends in the system (waiting time plus service time).
- Aturnaround time (TAT)
37Giving each process a slice of time before being preempted is a technique known as [blank_start]__________[blank_end] .
- Atime slicing
38A common technique for predicting a future value on the basis of a time series of past values is [blank_start]__________[blank_end] .
- Aexponential averaging
39The [blank_start]__________[blank_end] scheduler executes most frequently and makes the fine-grained decision of which process to execute next.
- Ashort-term
40The [blank_start]__________[blank_end] approach means that the operating system allocates the processor to a process and when the process blocks or is preempted, feeds it back into one of several priority queues.
- Amultilevel feedback
41The need to know or estimate required processing times for each process, the starvation of longer processes, and the lack of preemption are all difficulties with the [blank_start]__________[blank_end] scheduling technique.
- AShortest Process Next (SPN)
42Response time and throughput are examples of [blank_start]__________[blank_end] criteria for short term scheduling.
- Aperformance-related
43[blank_start]_________[blank_end] 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.
- AShortest Remaining Time (SRT)
44The traditional UNIX scheduler, such as those used in SVR3 and 4.3 BSD UNIX systems, divides processes into fixed [blank_start]__________[blank_end] of priority levels.
- Abands
45A scheduling mechanism that requires no prior knowledge of process length, yet can nevertheless favor shorter jobs, is known as the [blank_start]__________[blank_end] scheduling mechanism.
- Afeedback
Information
- Description
- Quiz on Chapter 9 - OS2T, created by Rowan Kaag on 02/11/2015.
- Author
- Rowan Kaag
- Language
- English
- Views
- 11
- Rating
- No ratings yet Rate this quiz