QUESTION 1
- Process A and Process B are properly inaccessible from one another, when one fails without affecting the other the strategy is known as ——————-
|
A. The principle of isolation |
||
|
B. The principle of starvation |
||
|
C. The principle of inclusion |
||
|
D. The principle of time share |
2 points
QUESTION 2
- When User A and User B allocated their set of tickets among their own jobs in whatever currency they would like, the system then routinely alters the said currency into the correct —————
|
A. Currency value |
||
|
B. Global value |
||
|
C. Lottery value |
||
|
D. Ticket value |
2 points
QUESTION 3
- What type of segmentation is focused on few segments of the systems like code, base, and bounds?
|
A. fine-grained |
||
|
B. dirty bits |
||
|
C. Coarse-grained |
||
|
D. page table |
2 points
QUESTION 4
- User B is running 5 jobs UB1, UB2, UB3, UB4, and UB5 and gives them 1 ticket each(out of 10 total). User A is running four jobs, UA1, UA2.
|
UA3 and UA4, and gives them each 250 tickets (out of 1000 total) in User A s own currency. |
||
|
What is the conversion rate for each of the jobs for User B? |
||
|
A. 50 |
||
|
B. 25 |
||
|
C. 20 |
||
|
D. 15 |
2 points
QUESTION 5
- Process A performed a load, a store, or an instruction fetch, another process B is not able to access information from process A or any
|
other processes to affect their memory contents. What goal of the virtual machine does not allow any process to access anything outside its own |
||
|
address space |
||
|
A. Control |
||
|
B. Efficiency |
||
|
C. Transparency |
||
|
D. Protection |
2 points
QUESTION 6
- User A holds tickets 0-74 and User B holds tickets 75-99 in a lottery scheduling, What does it mean for a winning ticket?
|
A. Simply calculates the time whether ticket A or B runs and it is then loaded by the scheduler |
||
|
B. Simply underestimates whether ticket A or B runs and it is then loaded by the scheduler |
||
|
C. Simply calculates the time whether ticket A or B runs and it is then unloaded by the scheduler |
||
|
D. Simply determines whether ticket A or B runs and it is then loaded by the scheduler |
2 points
QUESTION 7
- What type of priority will MLFQ use to keep the priority of Job A High if Job A repeatedly gave out its time slice before it expires?
|
A. Gaming behavior |
||
|
B. Observed behavior |
||
|
C. Starvation behavior |
||
|
D. Current Behavior |
2 points
QUESTION 8
- When the relocation of the address happens at runtime, and because we can be moved even after the process has started running, the technique
|
is often referred to as: |
||
|
dynamic location |
||
|
static location |
||
|
static relocation |
||
|
dynamic relocation |
2 points
QUESTION 9
- What are the two programs that grow and shrink in the physical memory?
|
A. Heap |
||
|
B. Base |
||
|
C. Stack |
||
|
D. Bounds |
2 points
QUESTION 10
- Suppose Process B is referenced to virtual address 50 (which is in the code segment). What will be the desired physical address:
|
A. 32868 |
||
|
B. 32818 |
||
|
C. 82KB |
||
|
D. 50KB |
2 points
QUESTION 11
- In order to optimize turnaround what algorithm will best be used?
|
A. First Come First Serve |
||
|
B. Shorter Time to Completion First |
||
|
C. Round Robin |
||
|
D. Shorter Job First |
2 points
QUESTION 12
- What are the characteristics of physical address in paging?
|
A. Address translation |
||
|
B. Virtual Page Number |
||
|
C. Physical Frame Number |
||
|
D. Offset |
2 points
QUESTION 13
- When the OS transforms a virtual address into a physical address, the technique is referred to as
|
A. Address space |
||
|
B. Address Translation |
||
|
C. Memory space |
||
|
D. Memory Translation |
2 points
QUESTION 14
- In a 64KB physical memory space, where in the address space will the code of an Operating System occupies?
|
A. 0KB |
||
|
B. 1KB |
||
|
C. 16KB |
||
|
D. 32KB |
2 points
QUESTION 15
- Which of the segment in the address space contains malloc d data and dynamic data structures?
|
A. Heap |
||
|
B. Stack |
||
|
C. Address space |
||
|
D. Physical memory |
2 points
QUESTION 16
- In a situation, Process A trusts Process B and vice versa. What type of ticket uses this situation?
|
A. Transfer |
||
|
B. Global |
||
|
C. Currency |
||
|
D. Inflation |
2 points
QUESTION 17
- Goals of virtualization of memory include the following
|
A. Efficiency |
||
|
B. Transparency |
||
|
C. Protection |
||
|
D. All of the above |
2 points
QUESTION 18
- When a load is made at a certain address 120 instead of 0, What are the keys to virtual memory?
|
A. Some future computers |
||
|
B. Some libraries and other software support |
||
|
C. Some past computers |
||
|
D. Some hardware support and the operating system |
2 points
QUESTION 19
- What basic rule will allow both the highest topmost job and the lowest job priorities to have the same top priority and what type of
|
scheduling is used among them? |
||
|
A. rule 1 |
||
|
B. rule 2 |
||
|
C. Rule 5 |
||
|
D. Round robin |
2 points
QUESTION 20
- In what numbering format is User A able to identify the value of the virtual address of a process on a screen?
|
A. Hexadecimal |
||
|
B. Binary |
||
|
C. Octal |
||
|
D. Decimal |
2 points
QUESTION 21
- What is the biggest issue when multiple programs are allowed to reside concurrently in memory?
|
A. Control |
||
|
B. Efficiency |
||
|
C. Transparency |
||
|
D. Protection |
2 points
QUESTION 22
- What certain elements do we assume to be good of lottery scheduling?
|
A. Simplicity of its implementation |
||
|
B. Complexity of its implementation |
||
|
C. Complex random number |
||
|
D. Simple random number |
2 points
QUESTION 23
- Base and bounds (or dynamic relocation has some strengths and weaknesses as a mechanism for implementing vitual memory.
|
A. Provides protection and little space overhead |
||
|
B. Not Flexible and does not support sparse address space |
||
|
C. Simple and fast |
||
|
D. All of the above |
2 points
QUESTION 24
- User AOU was able to have an optimized interactive response to the system after Process A was able to maximized turnaround time. What type of
|
scheduler allows this scenario? |
||
|
A. First-In First-Out |
||
|
B. The Multi-level Feedback Queue |
||
|
C. Shortest-Job -to Completion First |
||
|
D. Lottery Scheduling |
2 points
QUESTION 25
- What idea was used to guarantee User A (CPU-bound job) to move to the top of the queue?
|
A. Periodically boost the priority |
||
|
B. Round robin |
||
|
C. Avoid starvation |
||
|
D. First in first out |
2 points
QUESTION 26
- Instead of optimizing for turnaround or response time, lottery scheduling is based on the concept that Jobs must be insured of and be:
|
A. Insecure of cpu usage time |
||
|
B. Assured of cpu usage time |
||
|
C. Given i/o usage time |
||
|
D. Insecure of i/o usage time |
2 points
QUESTION 27
- A base and bounds pair register is used In a system to virtualize a 1KB address space in the following address reference : Trace the Virtual Address
VA 0: 0x00000308 (decimal: 776) –> VALID: 0x00003913 (decimal: 14611)
VA 1: 0x00000308 (decimal: 597) –> VALID: 0x00003860 (decimal: 14432)
VA 2: 0x000003A1 (decimal: 929) –> SEGMENTATION VIOLATION
What is the value of the base register for VA 0?
|
A. 15387 |
||
|
B. 13611 |
||
|
C. 15611 |
||
|
D. 13835 |
2 points
QUESTION 28
- Where in physical memory will a process 108 be fetched when the hardware needs this instruction?
|
A. at physical address of 32640 |
||
|
B. at physical address of 32886 |
||
|
C. at physical address of 32876 |
||
|
D. at physical address of 32660 |
2 points
QUESTION 29
- What is one advantage of paging over segmentation?
|
A. uses code, base and bound |
||
|
B. does not lead to external fragmentation |
||
|
C. the stack uses a negative offset |
||
|
D. uses the bounds to check the legality of a running process |
2 points
QUESTION 30
- Lottery scheduling uses ticket to represent a share of the CPU. If process A has 150 and another process B has 300, process A should roughly
|
run 1/3 of the time. Does lottery scheduling prevent starvation? |
||
|
A. Probalistically no if ticket allocation is wildly imbalanced |
||
|
B. Probalistically yes if ticket allocation is wildly imbalanced |
||
|
C. No for lottery scheduling has been around for a long time |
||
|
D. None of the above |
2 points
QUESTION 31
- What will User A and User B need to apply lottery scheduling effectively?
|
A. A good random number generator |
||
|
B. A data pointer to track the list |
||
|
C. Total number of vaiables |
||
|
D. All of the above |
2 points
QUESTION 32
- What objective will User B achieve when bounds are used?
|
A. All addresses generated by the base are legal and within the bounds of the process |
||
|
B. All addresses asserted by the process are illegal and within the bounds of the process |
||
|
C. All addresses generated by the process are legal and within the bounds of the process |
||
|
D. All disk addresses generated by the process are legal and within the bounds of the process |
2 points
QUESTION 33
- What are the two key goals of any modern day operating system?
|
A. Control |
||
|
B. Transparency and Efficiency |
||
|
C. Efficiency |
||
|
D. Protection and Base |
2 points
QUESTION 34
- A Process was demoted after using its time allotment at a given level to the next priority queue. What rule is used to effect the demotion?
|
A. Rule 3 |
||
|
B. Rule 4 |
||
|
C. Rule 5 |
||
|
D. Rule 4a |
2 points
QUESTION 35
- How does the processor translates memory when the reference is generated by the process?
|
a. physical address = virtual address + bounds |
||
|
B. physical address = virtual address + base |
||
|
C. Bounds = heap + stack |
||
|
D. Bounds =Base + code |
2 points
QUESTION 36
- What scheduler will use observation to prioritize instead of priori knowledge?
|
A. FIFO |
||
|
B. SJF |
||
|
C. SJCF |
||
|
D. MLFQ |
2 points
QUESTION 37
- User A is running five jobs, UA1, UA2. UA3. UA4 and UA5, and gives each 200 tickets (out of 1000 total) in User A’s own currency. User B is running 10 jobs and gives out 1 ticket each(out of the 10 total). What is the conversion rate for each of the jobs for User A?
|
A. 50 |
||
|
B. 25 |
||
|
C. 20 |
||
|
D. 30 |
2 points
QUESTION 38
- The birth of ————– was due to the limitations of batch computing
|
A. Time sharing |
||
|
B. Crude sharing |
||
|
C. Time programs |
||
|
D. Time slicing |
2 points
QUESTION 39
- What type of scheduling allows Job B not to use an optimized turnaround but rather uses a certain percentage of CPU time?
|
A. Observed scheduling |
||
|
B. Address translation |
||
|
C. Proportional share scheduling |
||
|
D. All of the above |
2 points
QUESTION 40
- User B is running 5 jobs UB1, UB2, UB3, UB4, and UB5 and gives them 1 ticket each(out of 10 total). User A is running four jobs, UA1, UA2.
|
UA3 and UA4, and gives them each 250 tickets (out of 1000 total) in User A s own currency. What is the global currency for User A? |
||
|
A. 50 |
||
|
B. 100 |
||
|
C. 150 |
||
|
D. 200 |
2 points
QUESTION 41
- What type of segmentation is focussed on many segments of the systems?
|
dirty bits |
||
|
page table |
||
|
coarse-grained |
||
|
fine-grained |
2 points
QUESTION 42
- When the OS places a process anywhere in the address space it is ………………………………….
|
A. attempting to put the process in a queue |
||
|
B. sharing memory |
||
|
C. virtualizing CPU |
||
|
D. virtualizing memory |
2 points
QUESTION 43
- Interactive jobs keep running in the system whereas long running cpu jobs are kept waiting in the system. What is the name given to the job that keeps giving up the resources?
|
Gaming |
||
|
Starvation |
||
|
Relinquish |
||
|
Guaranteed |
2 points
QUESTION 44
- The priority level of Job A was reduced since it used all of its time slice. What will MLFQ use to guess the history of the job?
|
A. Future behavior |
||
|
B. Current behavior |
||
|
C. Past behavior |
||
|
D. None of the above |
2 points
QUESTION 45
- What is the set back of lottery scheduling mechanism which allocates a number of tickets to be randomly picked?
|
A. Calculation-assignment difficulty |
||
|
B. Currency-assignment delinquenty |
||
|
C. Inflation-assignment difficulty |
||
|
D. Ticket-assignment difficulty |
2 points
QUESTION 46
- What type of ticket uses a situation where Process A trusts Process B and vice versa?
|
A. Inflation |
||
|
B. Global |
||
|
C. Currency |
||
|
D. Transfer |
2 points
QUESTION 47
- Lottery scheduling is based on the concept that: instead of optimizing for turnaround or response time, a scheduler might instead try to
|
insure jobs are not assured of memory usage time |
||
|
insure jobs are assured of memory usage time |
||
|
insure jobs are assured of cpu usage time |
||
|
insure jobs are not assured of cpu usage time |
2 points
QUESTION 48
- A process performs a load, a store, or an instruction fetch, the process is not able to get information from the other processes to affect their memory contents. What goal of the virtual machine does not allow the process to access anything outside its address space
|
Control |
||
|
Protection |
||
|
Efficiency |
||
|
Transparency |
2 points
QUESTION 49
- User B is running 5 jobs UB1, UB2, UB3, UB4, and UB5 and gives them 1 ticket each(out of 10 total). User A is running four jobs, UA1, UA2. UA3 and UA4, and gives them each 250 tickets (out of 1000 total) in User A s own currency. What is the conversion rate for each of the jobs for User A?
|
A. 50 |
||
|
B. 25 |
||
|
C. 20 |
||
|
D. 15 |
2 points
QUESTION 50
- What kind of sharing support does the process needs from the hardward in segmentation?
|
Valuable bits |
||
|
protective bits |
||
|
sharing bits |
||
|
bounds |
2 points
QUESTION 51
- What is the name of the content of a page table that indicates whether the page has been modified since it was brought into memory.
|
Dirty bit |
||
|
Protective Bit |
||
|
Present bit |
||
|
user bit |
2 points
QUESTION 52
- To change the priority level of a job in its lifetime, what elements can User A use to help with the decision?
|
A. Queue level |
||
|
B. Time slice |
||
|
C. Feedback level |
||
|
D. Workload |
2 points
QUESTION 53
- Segmentation is a generalization of base and bounds. What are its strengths and weaknesses?
|
A. Supports sparse address space |
||
|
B. More internal fragmentation |
||
|
C. External fragmentation is not a problem |
||
|
D. All of the above |
2 points
QUESTION 54
- How many pairs of the base and bounds chip are in every Memory?
|
One pair |
||
|
Two pairs |
||
|
Three pairs |
||
|
None pairs |
2 points
QUESTION 55
- What do we call a space that the OS creates as an easy to use concept of physical memory
|
A. Heap |
||
|
B. Stack |
||
|
C. Address space |
||
|
D. Physical memory |
2 points
QUESTION 56
- What decision will be used by MLFQ to allow user B to be chosen ahead of User A who was ready to run?
|
A. User B was on a multiple queue levels |
||
|
B. User A was on a multiple queue levels |
||
|
C. Higher priority since User B was on a higher queue |
||
|
D. Higher Priority since User A was on a higher queue |
2 points
QUESTION 57
- User A runs one process for a short time stopped and saved all of its state to disk, then load some other processes and continued repeatedly. What type of technology is this?
|
A. Gaming |
||
|
B. Crude sharing |
||
|
C. Time sharing |
||
|
D. Starvation |
2 points
QUESTION 58
- What will happen if a process generates a virtual address that is greater than the bounds, or one that is negative?
|
A. the CPU will lower an alarm, and the process will not be terminated. |
||
|
B. the CPU will raise an alarm, and the process will not be terminated. |
||
|
C. the CPU will raise an exception, and the process will likely be terminated. |
||
|
D. the CPU will lower an exception, and the process will likely be terminated. |
2 points
QUESTION 59
- An operating system in the early days of computing was considered to be
|
A. A set of heap |
||
|
B. A set of stack |
||
|
C. A set of library |
||
|
D. A set of code |
2 points
QUESTION 60
- What is the name of the technique where the OS transforms a virtual address into a physical address?
|
A. Address Translation |
||
|
B. Address space |
||
|
C. Memory space |
||
|
D. Memory Translation |
2 points
QUESTION 61
- What is the name given to the part of the processor that helps with address translation?
|
A. Address management unit (AMU) |
||
|
B. CPU management unit (CMU |
||
|
C. Space management unit (SMU) |
||
|
D. Memory management unit (MMU) |
2 points
QUESTION 62
- What is the name of the segment that contains local variables arguments to routines, return values, etc.
|
A. Heap |
||
|
B. Stack |
||
|
C. Code |
||
|
D. Transparency |
2 points
QUESTION 63
- Process 2 arrives and it is deemed as a low priority job and process 1 is deemed as a top priority job. With the rule that if A is greater
|
than B then A will run and B will not have the chance to run. What are the two issues faced with MLFQ? |
||
|
A. Starvation and Monopolize |
||
|
B. Gaming and Monopolize |
||
|
C. Starvation |
||
|
D. Gaming |
2 points
QUESTION 64
- Which of the following allow a user to place the address space anywhere we d like in physical memory, and at the same time ensures that the
|
process can only access its own address space. |
||
|
A. Base |
||
|
B. Heap |
||
|
C. stack |
||
|
D. Bounds |
2 points
QUESTION 65
- In a page table, a physical frame number can also be called?
|
A. physical page number |
||
|
B. physical address number |
||
|
C. virtual page number |
||
|
D. virtual address number |
2 points
QUESTION 66
- What is the main issue with lottery scheduling?
|
Ticket currency |
||
|
Ticket Assignment |
||
|
Ticket Transfer |
||
|
Ticket inflation |
2 points
QUESTION 67
- Which schedule uses a distinctive queues of different priority levels?
|
A. Feedback on different priority levels |
||
|
B. Multi Level Feedback Queue |
||
|
C. Queues on the same priority levels |
||
|
D. Feedback on same priority levels |
2 points
QUESTION 68
- What is the Key to the efficiency of address translation technique?
|
A. hardware support which performs the translation |
||
|
B. Software support which performs the translation |
||
|
C. The heap and bounds |
||
|
D. The Control and Transparency |
2 points
QUESTION 69
- Where does instructions live in virtual memory?
|
A. Heap |
||
|
B. Stack |
||
|
C. Code |
||
|
D. Transparency |
2 points
QUESTION 70
- What element enables User B to prefer lottery scheduling than MLFQ?
|
A. Algorithm |
||
|
B. Workload |
||
|
C. Randomness |
||
|
D. All of the above |
2 points
Click Save and Submit to save and submit. Click Save All Answers to save all answers.
QUESTION 1
- Process A and Process B are properly inaccessible from one another, when one fails without affecting the other the strategy is known as ——————-
|
A. The principle of isolation |
||
|
B. The principle of starvation |
||
|
C. The principle of inclusion |
||
|
D. The principle of time share |
2 points
QUESTION 2
- When User A and User B allocated their set of tickets among their own jobs in whatever currency they would like, the system then routinely alters the said currency into the correct —————
|
A. Currency value |
||
|
B. Global value |
||
|
C. Lottery value |
||
|
D. Ticket value |
2 points
QUESTION 3
- What type of segmentation is focused on few segments of the systems like code, base, and bounds?
|
A. fine-grained |
||
|
B. dirty bits |
||
|
C. Coarse-grained |
||
|
D. page table |
2 points
QUESTION 4
- User B is running 5 jobs UB1, UB2, UB3, UB4, and UB5 and gives them 1 ticket each(out of 10 total). User A is running four jobs, UA1, UA2.
|
UA3 and UA4, and gives them each 250 tickets (out of 1000 total) in User A s own currency. |
||
|
What is the conversion rate for each of the jobs for User B? |
||
|
A. 50 |
||
|
B. 25 |
||
|
C. 20 |
||
|
D. 15 |
2 points
QUESTION 5
- Process A performed a load, a store, or an instruction fetch, another process B is not able to access information from process A or any
|
other processes to affect their memory contents. What goal of the virtual machine does not allow any process to access anything outside its own |
||
|
address space |
||
|
A. Control |
||
|
B. Efficiency |
||
|
C. Transparency |
||
|
D. Protection |
2 points
QUESTION 6
- User A holds tickets 0-74 and User B holds tickets 75-99 in a lottery scheduling, What does it mean for a winning ticket?
|
A. Simply calculates the time whether ticket A or B runs and it is then loaded by the scheduler |
||
|
B. Simply underestimates whether ticket A or B runs and it is then loaded by the scheduler |
||
|
C. Simply calculates the time whether ticket A or B runs and it is then unloaded by the scheduler |
||
|
D. Simply determines whether ticket A or B runs and it is then loaded by the scheduler |
2 points
QUESTION 7
- What type of priority will MLFQ use to keep the priority of Job A High if Job A repeatedly gave out its time slice before it expires?
|
A. Gaming behavior |
||
|
B. Observed behavior |
||
|
C. Starvation behavior |
||
|
D. Current Behavior |
2 points
QUESTION 8
- When the relocation of the address happens at runtime, and because we can be moved even after the process has started running, the technique
|
is often referred to as: |
||
|
dynamic location |
||
|
static location |
||
|
static relocation |
||
|
dynamic relocation |
2 points
QUESTION 9
- What are the two programs that grow and shrink in the physical memory?
|
A. Heap |
||
|
B. Base |
||
|
C. Stack |
||
|
D. Bounds |
2 points
QUESTION 10
- Suppose Process B is referenced to virtual address 50 (which is in the code segment). What will be the desired physical address:
|
A. 32868 |
||
|
B. 32818 |
||
|
C. 82KB |
||
|
D. 50KB |
2 points
QUESTION 11
- In order to optimize turnaround what algorithm will best be used?
|
A. First Come First Serve |
||
|
B. Shorter Time to Completion First |
||
|
C. Round Robin |
||
|
D. Shorter Job First |
2 points
QUESTION 12
- What are the characteristics of physical address in paging?
|
A. Address translation |
||
|
B. Virtual Page Number |
||
|
C. Physical Frame Number |
||
|
D. Offset |
2 points
QUESTION 13
- When the OS transforms a virtual address into a physical address, the technique is referred to as
|
A. Address space |
||
|
B. Address Translation |
||
|
C. Memory space |
||
|
D. Memory Translation |
2 points
QUESTION 14
- In a 64KB physical memory space, where in the address space will the code of an Operating System occupies?
|
A. 0KB |
||
|
B. 1KB |
||
|
C. 16KB |
||
|
D. 32KB |
2 points
QUESTION 15
- Which of the segment in the address space contains malloc d data and dynamic data structures?
|
A. Heap |
||
|
B. Stack |
||
|
C. Address space |
||
|
D. Physical memory |
2 points
QUESTION 16
- In a situation, Process A trusts Process B and vice versa. What type of ticket uses this situation?
|
A. Transfer |
||
|
B. Global |
||
|
C. Currency |
||
|
D. Inflation |
2 points
QUESTION 17
- Goals of virtualization of memory include the following
|
A. Efficiency |
||
|
B. Transparency |
||
|
C. Protection |
||
|
D. All of the above |
2 points
QUESTION 18
- When a load is made at a certain address 120 instead of 0, What are the keys to virtual memory?
|
A. Some future computers |
||
|
B. Some libraries and other software support |
||
|
C. Some past computers |
||
|
D. Some hardware support and the operating system |
2 points
QUESTION 19
- What basic rule will allow both the highest topmost job and the lowest job priorities to have the same top priority and what type of
|
scheduling is used among them? |
||
|
A. rule 1 |
||
|
B. rule 2 |
||
|
C. Rule 5 |
||
|
D. Round robin |
2 points
QUESTION 20
- In what numbering format is User A able to identify the value of the virtual address of a process on a screen?
|
A. Hexadecimal |
||
|
B. Binary |
||
|
C. Octal |
||
|
D. Decimal |
2 points
QUESTION 21
- What is the biggest issue when multiple programs are allowed to reside concurrently in memory?
|
A. Control |
||
|
B. Efficiency |
||
|
C. Transparency |
||
|
D. Protection |
2 points
QUESTION 22
- What certain elements do we assume to be good of lottery scheduling?
|
A. Simplicity of its implementation |
||
|
B. Complexity of its implementation |
||
|
C. Complex random number |
||
|
D. Simple random number |
2 points
QUESTION 23
- Base and bounds (or dynamic relocation has some strengths and weaknesses as a mechanism for implementing vitual memory.
|
A. Provides protection and little space overhead |
||
|
B. Not Flexible and does not support sparse address space |
||
|
C. Simple and fast |
||
|
D. All of the above |
2 points
QUESTION 24
- User AOU was able to have an optimized interactive response to the system after Process A was able to maximized turnaround time. What type of
|
scheduler allows this scenario? |
||
|
A. First-In First-Out |
||
|
B. The Multi-level Feedback Queue |
||
|
C. Shortest-Job -to Completion First |
||
|
D. Lottery Scheduling |
2 points
QUESTION 25
- What idea was used to guarantee User A (CPU-bound job) to move to the top of the queue?
|
A. Periodically boost the priority |
||
|
B. Round robin |
||
|
C. Avoid starvation |
||
|
D. First in first out |
2 points
0 comments