Podcast
Questions and Answers
What is the formula to calculate Turn Around time?
What is the formula to calculate Turn Around time?
- Exit time + Arrival time
- Exit time - Arrival time (correct)
- Arrival time - Exit time
- Arrival time / Exit time
What is the purpose of multi-level queue scheduling?
What is the purpose of multi-level queue scheduling?
- To reduce the waiting time of processes
- To allocate resources to processes based on priority (correct)
- To increase the turnaround time of processes
- To increase the throughput of the system
In a multi-level queue scheduling algorithm, what happens when a process from a higher-priority queue enters the ready queue?
In a multi-level queue scheduling algorithm, what happens when a process from a higher-priority queue enters the ready queue?
- The newly arrived process waits in its queue
- The currently running process is terminated
- The currently running process is paused
- The currently running process is preempted (correct)
What is the average waiting time for the given processes?
What is the average waiting time for the given processes?
Which of the following is an example of a process type that may be assigned to a queue in a multi-level queue scheduling algorithm?
Which of the following is an example of a process type that may be assigned to a queue in a multi-level queue scheduling algorithm?
What is the formula to calculate Waiting time?
What is the formula to calculate Waiting time?
In a multi-level queue scheduling algorithm, what determines the priority of a queue?
In a multi-level queue scheduling algorithm, what determines the priority of a queue?
What is the average Turn Around time for the given processes?
What is the average Turn Around time for the given processes?
What is the formula to calculate Turn Around time?
What is the formula to calculate Turn Around time?
What is the main advantage of Round Robin Scheduling?
What is the main advantage of Round Robin Scheduling?
What happens to the response time when the value of time quantum decreases?
What happens to the response time when the value of time quantum decreases?
What is the disadvantage of Round Robin Scheduling when the value of time quantum is high?
What is the disadvantage of Round Robin Scheduling when the value of time quantum is high?
What happens when the value of time quantum tends to infinity?
What happens when the value of time quantum tends to infinity?
What is the formula to calculate Waiting time?
What is the formula to calculate Waiting time?
What is the main characteristic of Round Robin Scheduling?
What is the main characteristic of Round Robin Scheduling?
What is the factor that affects the performance of Round Robin Scheduling?
What is the factor that affects the performance of Round Robin Scheduling?
What is the formula to calculate the Turn Around time?
What is the formula to calculate the Turn Around time?
What is the condition for a tie breaker in Priority Scheduling?
What is the condition for a tie breaker in Priority Scheduling?
What is the advantage of using Priority Scheduling in preemptive mode?
What is the advantage of using Priority Scheduling in preemptive mode?
What is the condition for Priority Scheduling to behave the same in both preemptive and non-preemptive modes?
What is the condition for Priority Scheduling to behave the same in both preemptive and non-preemptive modes?
What is the formula to calculate the Waiting time?
What is the formula to calculate the Waiting time?
What is the main advantage of Priority Scheduling?
What is the main advantage of Priority Scheduling?
What is the Average Waiting time calculated from?
What is the Average Waiting time calculated from?
What is a characteristic of Priority Scheduling in preemptive mode?
What is a characteristic of Priority Scheduling in preemptive mode?
Study Notes
Gantt Chart
- Turn Around time = Exit time – Arrival time
- Waiting time = Turn Around time – Burst time
Multilevel Queue Scheduling
- Partitions the ready queue into several separate queues
- Each queue has its own scheduling algorithm
- Queues have absolute priority over lower-priority queues
- Example: 5 queues - System Processes, Interactive Processes, Interactive Editing Processes, Batch Processes, and Student Processes
Priority Scheduling
- CPU is assigned to the process having the highest priority
- In case of a tie, it is broken by FCFS Scheduling
- Priority Scheduling can be used in both preemptive and non-preemptive mode
- Advantages:
- Considers the priority of the processes and allows the important processes to run first
- Priority scheduling in pre-emptive mode is best suited for real-time operating systems
Round Robin Scheduling
- CPU is assigned to the process on the basis of FCFS for a fixed amount of time (time quantum or time slice)
- After the time quantum expires, the running process is preempted and sent to the ready queue
- Then, the processor is assigned to the next arrived process
- Advantages:
- Gives the best performance in terms of average response time
- Best suited for time sharing system, client-server architecture, and interactive system
- Disadvantages:
- Leads to starvation for processes with larger burst time
- Performance heavily depends on time quantum
- Priorities can not be set for the processes
- Effects of time quantum:
- Smaller value: increases number of context switch, decreases response time, and decreases chances of starvation
- Larger value: decreases number of context switch, increases response time, and increases chances of starvation
Studying That Suits You
Use AI to generate personalized quizzes and flashcards to suit your learning preferences.
Related Documents
Description
This quiz is about process scheduling in operating systems, covering turn around time, waiting time, and burst time. It includes a problem to be solved using a Gantt chart.
