Scribd
Upload
37 views2 pages

Process Scheduling Algorithms Explained

The document presents scheduling algorithms for process management in operating systems. It includes examples of First-Come, First-Served (FCFS), Shortest Time Remaining First (STRF), and Round Robin with a time quantum of 1ms, detailing the arrival and burst times for various processes. Each question outlines a different set of processes and their respective scheduling characteristics.

Uploaded by

ishanibnul102913
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
37 views2 pages

Process Scheduling Algorithms Explained

The document presents scheduling algorithms for process management in operating systems. It includes examples of First-Come, First-Served (FCFS), Shortest Time Remaining First (STRF), and Round Robin with a time quantum of 1ms, detailing the arrival and burst times for various processes. Each question outlines a different set of processes and their respective scheduling characteristics.

Uploaded by

ishanibnul102913
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Question 1: FCFS

Processe Arrival Time Burst Time


s
P1 0ms 4ms
P2 2ms 2ms
P3 1ms 3ms
P4 3ms 1ms

Question 2: Shortest time remaining first

Processe Arrival Time Burst Time


s
P1 1ms 5ms
P2 3ms 2ms
P3 2ms 1ms
P4 4ms 4ms

Question 3: Shortest time remaining first

Processe Arrival Time Burst Time


s
P1 2ms 3ms
P2 0ms 4ms
P3 3ms 2ms
P4 1ms 1ms

Question 4: Round Robin with Time Quantum 1ms

Processe Arrival Time Burst Time


s
P1 3ms 2ms
P2 1ms 1ms
P3 4ms 3ms
P4 0ms 4ms

Question 5: Round Robin with Time Quantum 1ms

Processes Arrival Time Burst Time


P1 0ms 3ms
P2 2ms 5ms
P3 1ms 4ms
P4 3ms 2ms

You might also like