| FCFS-(First come first serve) | |
|---|---|
| > | Start |
| > | Accept number of processes. |
| > | Accept arrival and burst time. |
| > | Sort processes according to arrival time. |
| > | Run FCFS algorithm. |
| > | Calculate start and finish time. |
| > | Compute waiting and turn around time. |
| > | End |
| SJF-(Shortest job first) | |
|---|---|
| > | Start |
| > | Accept number of processes. |
| > | Accept arrival and burst time. |
| > | Sort processes according to burst time. |
| > | Run SJF algorithm. |
| > | Calculate start and finish time. |
| > | Compute waiting and turn around time. |
| > | End |
| Priority Algorithm | |
|---|---|
| > | Start |
| > | Accept number of processes. |
| > | Accept arrival , burst time and priority. |
| > | Sort processes according to priority time. |
| > | Run Priority algorithm. |
| > | Calculate start and finish time. |
| > | Compute waiting and turn around time. |
| > | End |
Quicklinks
| Home |
About Us |
| Gallary |
Notes |
| Algorithms |
Contact/Mail me:
Phone : 12345678
Email : swupkorde@gmail.com
Visit Us
