## Questions on Round Robin Scheduling

 Questions on Round Robin Scheduling Que1- Calculate the Turn around time and waiting time of the processes on the basis of round robin scheduling algorithm. Assume Time Quantum is set  to 2 units. Also calculate the average waiting time and turn around time. P  No. AT BT 1 0 4 2 1 5 3 2…

## Longest Remaining Time First (LRTF)-Questions

 Longest Remaining Time First-Questions Que1: Calculate waiting time and turnaround time using longest remaining time first scheduling algorithm – P No. AT BT 1 1 2 2 2 4 3 3 6 4 4 8 Solution: P No. AT BT CT TAT WT 1 1 2 18 17 15 2 2 4 19 17 13…

## Questions on CPU Scheduling(LJF_Non Preemptive)

 Que1: P No. AT BT 1 0 3 2 1 2 3 2 4 4 3 5 5 4 6 Solution: P No. AT BT CT TAT WT 1 0 3 3 3 0 2 1 2 20 19 17 3 2 4 18 16 12 4 3 5 8 5 0 5 4 6…

## Questions on CPU Scheduling(SRTF)

 Preemptive SJF is also called SRTF(Shortest Remaining Time First) Que1-  P No. AT BT 1 0 7 2 1 5 3 2 3 4 3 1 5 4 2 6 5 1 Solution- P No. AT BT TAT WT CT 1 0 7 19 13 19 2 1 5 12 7 13 3 2 3…

## Questions on CPU scheduling(SJF)

 QUE1-  Avg TAT=? and WT=? P No. AT BT 1 1 7 2 2 5 3 3 1 4 4 2 5 5 8 Solution- P No. AT BT TAT WT 1 1 7 7 0 2 2 5 14 9 3 3 1 6 5 4 4 2 7 5 5 5 8 19…

## Questions on CPU Scheduling(FCFS)

 Question 1: Calculate Avg TAT & Avg WT. P.No AT BT 1 0 4 2 1 3 3 2 1 4 3 2 5 4 5 Solution : TAT=CT-AT & WT=TAT-BT P.No AT BT CT TAT=CT-AT WT=TAT-BT 1 0 4 4=CT for P1 4 0 2 1 3 7=CT for P2 6 3 3 2…

## CPU Scheduling

 Short Term Scheduler (STS) apply CPU schedule in ready state. STS will make you to apply one of the CPU scheduling algo in ready state in order to select the process. When will you apply CPU scheduling? When new→Ready- When process is moving from new to ready, the process executed in run state may have less…

# Scheduling Criteria

When you take any process, the process is going to have  various times- Arrival Time of process(AT) or submission time- The time when the process arrives into ready state is Arrival Time(AT). Burst Time of process(BT)- The time required for the process for its execution is Burst Time(BT). Completion Time of Process(CT)- The time when the process completes…

## OS – Questions

 Que 1-  Consider a system which is having n CPU processors then , what is the minimum and maximum no. of process that may present in ready, running and block state? Ans- Que 2- In the following process state  transition diagram for a uniprocesssor system, assume that there are always some processes in the ready state….

# Types of Scheduler

In operating system, we have three types of schedulers- Long Term Scheduler(Job Term Scheduler) Short Term Scheduler(CPU Scheduler) Mid Term Scheduler(Medium Term Scheduler) Long Term Scheduler(LTS)- It is responsible for creating and bringing the new processor into the system. Short Term Scheduler(STS)- It is responsible for selecting one of the process from ready state onto scheduling to…