WGU C191 Chapter 4-6 Operating Systems Learning Checks Exam Questions with complete Answers 2024/2025
13 views 0 purchase
Course
WGU C191
Institution
WGU C191
WGU C191 Chapter 4-6 Operating Systems Learning Checks Exam Questions with complete Answers 2024/2025
What is the primary goal in scheduling interactive processes? - correct answer It is to respond promptly to each input. Consequently, they must time-share the CPU using preemptive scheduling to ...
WGU C191 Chapter 4-6 Operating
Systems Learning Checks Exam
Questions with complete Answers
2024/2025
What is the primary goal in scheduling interactive processes? - correct answer It is to
respond promptly to each input. Consequently, they must time-share the CPU using
preemptive scheduling to give each process a chance to make progress in a timely
manner.
Time quantum (Q) - correct answer It is a small amount of time (typically 10 to 100
milliseconds) during which a process is allowed to use the CPU.
Round-robin (RR) algorithm - correct answer It uses a single queue of processes. The
priority is determined solely by a process's position within the queue. The process at the
head of the queue has the highest priority and is allowed to run for Q time units. When
Q ends, the process is moved to the tail of the queue and the next process now at the
head of the queue is allowed to run for Q time units.
Multilevel (ML) scheduling - correct answer RR scheduling treats all processes as
equals. External priorities can be used to divide processes into groups based on
importance. _____ maintains a separate queue of processes at each priority level.
Within each level, processes are scheduled using RR.
MLF scheduling algorithm - correct answer It is similar to ML but addresses the
problems of starvation and fairness by: using a different time quantum at each priority
level and changing the priority of every process dynamically
Multilevel feedback (MLF) algorithm - correct answer It is a newly arriving process
enters the highest-priority queue, N, and is allowed to run for Q time units. When Q is
exceeded, the process is moved to the next lower priority queue, N-1, and is allowed to
run for 2Q time units. The quantum size is doubled with each decreasing priority level.
Thus at priority level L, the maximum time allowed is 2(N-L)Q time units. It automatically
, favors short-running processes while processes with long running times gradually
migrate to lower priority levels.
Response time of a process - correct answer It is the elapsed time from the
submission of a request (pressing the Enter key or clicking a mouse button) until the
response begins to arrive. Guaranteeing adequate response time is the primary goal in
the scheduling of interactive processes.
Real-time process - correct answer It is characterized by continual input, which must
be processed fast enough to generate nearly instantaneous output. Each arriving input
item is subject to a deadline. Ex: Streaming of audio or video, processing and displaying
radar data, control of robots or of fly-by-wire aircraft.
Period - correct answer It is a time interval (typically in milliseconds or even
microseconds) within which each input item must be processed. The end of each period
is the implicit deadline for processing the current item.
Rate monotonic (RM) algorithm - correct answer It schedules processes according to
the period. The shorter the period, the higher the priority. It is preemptive.
Earliest deadline first (EDF) algorithm - correct answer It schedules processes
according to the shortest remaining time until the deadline. The shorter the remaining
time, the higher the priority. It is preemptive.
Concurrency - correct answer It is the act of multiple processes (or threads) executing
at the same time. When multiple physical CPUs are available, the processes may
execute in parallel. On a single CPU, this concept may be achieved by time-sharing.
When ____ processes access a common data area, the data must be protected from
simultaneous change by two or more processes. Otherwise the updated area may be
left in an inconsistent state.
Critical section - correct answer It is a segment of code that cannot be entered by a
process while another process is executing a corresponding segment of the code.
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through EFT, credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying this summary from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller KieranKent55. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy this summary for R225,75. You're not tied to anything after your purchase.
