Merge c464cbcb17 into f3f32ae3ca

updates:
- [github.com/astral-sh/ruff-pre-commit: v0.7.3 → v0.7.4](https://github.com/astral-sh/ruff-pre-commit/compare/v0.7.3...v0.7.4)

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>

.pre-commit-config.yaml

@@ -16,7 +16,7 @@ repos:
       - id: auto-walrus
 
   - repo: https://github.com/astral-sh/ruff-pre-commit
-    rev: v0.7.2
+    rev: v0.7.4
     hooks:
       - id: ruff
       - id: ruff-format
@@ -42,7 +42,7 @@ repos:
         pass_filenames: false
 
   - repo: https://github.com/abravalheri/validate-pyproject
-    rev: v0.22
+    rev: v0.23
     hooks:
       - id: validate-pyproject
 

DIRECTORY.md

@@ -178,6 +178,9 @@
   * [Volume Conversions](conversions/volume_conversions.py)
   * [Weight Conversion](conversions/weight_conversion.py)
 
+## CPU Scheduling Algorithms
+  * [FCFS](cpu_scheduling_algorithms/fcfs.py)
+
 ## Data Structures
   * Arrays
     * [Equilibrium Index In Array](data_structures/arrays/equilibrium_index_in_array.py)

cpu_scheduling_algorithms/fcfs.py

@@ -0,0 +1,73 @@
+"""
+Simple Implementation of the FCFS CPU scheduling algorithm
+FCFS is a non-preemptive CPU scheduling algorithm that
+schedules processes based on their arrival time.
+https://www.geeksforgeeks.org/program-for-fcfs-cpu-scheduling-set-1/
+Author: [Madhav Goyal](https://github.com/mdhvg)
+"""
+
+
+def fcfs(processes: list[tuple[int, int, int]]) -> None:
+    """
+    Function to implement the FCFS CPU scheduling algorithm
+
+    processes: list of tuples where each tuple contains the
+    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
+    """
+    total_processes = len(processes)
+    processes.sort(key=lambda process: process[1])
+    waiting_times = [0] * total_processes
+    total_waiting_time = 0
+
+    for i in range(1, total_processes):
+        waiting_times[i] = processes[i - 1][2] + waiting_times[i - 1]
+        total_waiting_time += waiting_times[i]
+
+    print(f"Average Waiting Time: {total_waiting_time / total_processes}")
+
+    """
+    Printing the Gantt Chart for the processes in the FCFS order
+    The - and * symbols are used to represent the burst time and
+    idle time respectively for each process.
+    """
+    last_burst = 0
+    for i in range(total_processes):
+        print("-" * last_burst, end="")
+        print("*", end="")
+        last_burst = processes[i][2]
+    print("-" * last_burst, end="")
+    print("\n", end="")
+
+    last_burst = 0
+    for i in range(total_processes):
+        print(" " * last_burst, end="")
+        print(f"{processes[i][0]}", end="")
+        last_burst = processes[i][2]
+    print("\n", end="")
+
+
+def main() -> None:
+    """
+    Main function to demonstrate the FCFS CPU scheduling algorithm
+    pass an array of (process_id, arrival_time, burst_time) to fcfs
+    >>> processes = [(1, 0, 3), (2, 1, 5), (3, 2, 2), (4, 3, 7), (5, 2, 2)]
+    >>> fcfs(processes)
+    Average Waiting Time: 6.6
+    *---*-----*--*--*-------
+    1   2     3  5  4
+    """
+    processes = [(1, 0, 3), (2, 1, 5), (3, 2, 2), (4, 3, 7), (5, 2, 2)]
+    fcfs(processes)
+
+
+if __name__ == "__main__":
+    main()
+    import doctest
+
+    doctest.testmod()

data_structures/arrays/sudoku_solver.py

@@ -172,7 +172,7 @@ def solved(values):
 
 def from_file(filename, sep="\n"):
     "Parse a file into a list of strings, separated by sep."
-    return open(filename).read().strip().split(sep)  # noqa: SIM115
+    return open(filename).read().strip().split(sep)
 
 
 def random_puzzle(assignments=17):

scripts/validate_filenames.py

@@ -1,4 +1,4 @@
-#!/usr/bin/env python3
+#!python
 import os
 
 try: