## Numerical Solved by Priority Scheduling

Q2. Consider the following set of processes with given priorities and burst time assumed to be arrived at 0. Process

## Numerical Solved by Round Robin Scheduling using Switching

Q5. Take three processes that arrive at the same time in the following order and the time quantum is 2ms.

## Numerical Solved by Round Robin Scheduling without using Switching

Q4. Take three processes that arrive at the same time in the following order and the time quantum is 2ms.

## Numerical Solved by Round Robin Scheduling Algorithm

Q3. Take three processes that arrive at the same time in the following order and the time quantum is 4ms.

## Round Robin

Q1. Explain Round Robin Scheduling. Q2. Take four processes that arrive at the same time in the following order and

## Numerical Solved by Round Robin

Q2. Take four processes that arrive at the same time in the following order and the time quantum is 20.

## Numerical Solved by Shortest Job First Scheduling Algorithm

Q8. Consider the following: Arrive Time             Process                Burst Time 0                               P1                        10 1                               P2                        4 2                               P3                        3 3                               P4

## Numerical Solved using Preemptive Shortest Job First Scheduling Algorithm

Q7. Consider the following Gantt Chart: P1 P2 P3 P2 P4 P1 0                2                 4            5                               7                                11                       16