mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-02-25 10:28:39 +00:00
Code Issues Packages Projects Releases Wiki Activity

Apply recommended fixes from PR review

Browse Source
This commit is contained in:
Madhav Goyal 2024-10-18 12:28:56 +05:30
parent 2c398308f7
commit c464cbcb17
1 changed files with 14 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
cpu_scheduling_algorithms/fcfs.py
View File

@ -13,17 +13,23 @@ def fcfs(processes: list[tuple[int, int, int]]) -> None:
processes: list of tuples where each tuple contains the processes: list of tuples where each tuple contains the
process_id, arrival_time and burst_time of each process process_id, arrival_time and burst_time of each process
>>> processes = [(1, 0, 3), (2, 2, 7), (3, 1, 4), (4, 5, 2)]
>>> fcfs(processes)
Average Waiting Time: 6.0
*---*----*-------*--
1 3 2 4
""" """
n = len(processes) total_processes = len(processes)
processes.sort(key=lambda x: x[1]) processes.sort(key=lambda process: process[1])
waiting_times = [0] * n waiting_times = [0] * total_processes
total_waiting_time = 0 total_waiting_time = 0
for i in range(1, n): for i in range(1, total_processes):
waiting_times[i] = processes[i - 1][2] + waiting_times[i - 1] waiting_times[i] = processes[i - 1][2] + waiting_times[i - 1]
total_waiting_time += waiting_times[i] total_waiting_time += waiting_times[i]
print(f"Average Waiting Time: {total_waiting_time / n}") print(f"Average Waiting Time: {total_waiting_time / total_processes}")
""" """
Printing the Gantt Chart for the processes in the FCFS order Printing the Gantt Chart for the processes in the FCFS order
@ -31,7 +37,7 @@ def fcfs(processes: list[tuple[int, int, int]]) -> None:
idle time respectively for each process. idle time respectively for each process.
""" """
last_burst = 0 last_burst = 0
for i in range(n): for i in range(total_processes):
print("-" * last_burst, end="") print("-" * last_burst, end="")
print("*", end="") print("*", end="")
last_burst = processes[i][2] last_burst = processes[i][2]
@ -39,14 +45,14 @@ def fcfs(processes: list[tuple[int, int, int]]) -> None:
print("\n", end="") print("\n", end="")
last_burst = 0 last_burst = 0
for i in range(n): for i in range(total_processes):
print(" " * last_burst, end="") print(" " * last_burst, end="")
print(f"{processes[i][0]}", end="") print(f"{processes[i][0]}", end="")
last_burst = processes[i][2] last_burst = processes[i][2]
print("\n", end="") print("\n", end="")
def main(): def main() -> None:
""" """
Main function to demonstrate the FCFS CPU scheduling algorithm Main function to demonstrate the FCFS CPU scheduling algorithm
pass an array of (process_id, arrival_time, burst_time) to fcfs pass an array of (process_id, arrival_time, burst_time) to fcfs