[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

scheduling/cpu_scheduling_interface.py

@@ -55,9 +55,7 @@ def _simulate_sjf_np(self):
         done = 0
         while done < len(processes):
             ready = [
-                p
-                for p in processes
-                if p["arrival"] <= t and "completion" not in p
+                p for p in processes if p["arrival"] <= t and "completion" not in p
             ]
 
             if not ready:
@@ -78,11 +76,7 @@ def _simulate_sjf_p(self):
         processes = sorted(self.processes, key=lambda p: p["arrival"])
         done = 0
         while done < len(processes):
-            ready = [
-                p
-                for p in processes
-                if p["arrival"] <= t and p["remaining"] > 0
-            ]
+            ready = [p for p in processes if p["arrival"] <= t and p["remaining"] > 0]
             if not ready:
                 t += 1
                 yield (t, None, [])
@@ -102,9 +96,7 @@ def _simulate_priority_np(self):
         done = 0
         while done < len(self.processes):
             ready = [
-                p
-                for p in self.processes
-                if p["arrival"] <= t and "completion" not in p
+                p for p in self.processes if p["arrival"] <= t and "completion" not in p
             ]
 
             if not ready:
@@ -125,9 +117,7 @@ def _simulate_priority_p(self):
         done = 0
         while done < len(self.processes):
             ready = [
-                p
-                for p in self.processes
-                if p["arrival"] <= t and p["remaining"] > 0
+                p for p in self.processes if p["arrival"] <= t and p["remaining"] > 0
             ]
 
             if not ready:
@@ -180,9 +170,7 @@ def _calculate_stats(self):
             arrival = p["arrival"]
             burst = p["burst"]
             completion = p["completion"]
-            first_exec = next(
-                (t for t, pid2 in self.timeline if pid2 == pid), arrival
-            )
+            first_exec = next((t for t, pid2 in self.timeline if pid2 == pid), arrival)
             tat = completion - arrival
             wt = tat - burst
             rt = first_exec - arrival
@@ -301,8 +289,7 @@ def add_process(self):
             messagebox.showerror("Error", "Invalid input")
 
     def delete_process(self):
-        sel = self.tree.selection()
-        if sel:
+        if sel := self.tree.selection():
             pid = self.tree.item(sel[0])["values"][0]
             self.processes = [p for p in self.processes if p["pid"] != pid]
             self.tree.delete(sel[0])
@@ -365,9 +352,9 @@ def show_results(self):
         n = len(self.engine.stats) or 1
         self.avg_label.config(
             text=(
-                f"AVG WT = {total_wt/n:.2f} | "
-                f"AVG TAT = {total_tat/n:.2f} | "
-                f"AVG RT = {total_rt/n:.2f}"
+                f"AVG WT = {total_wt / n:.2f} | "
+                f"AVG TAT = {total_tat / n:.2f} | "
+                f"AVG RT = {total_rt / n:.2f}"
             )
         )
 

scheduling/cpuschedulinginterface.md

@@ -4,20 +4,20 @@
 
 </div>
 
-A **GUI-based CPU Scheduling Algorithm Visualizer** built using **Python**, **Tkinter**, and **Matplotlib**.  
+A **GUI-based CPU Scheduling Algorithm Visualizer** built using **Python**, **Tkinter**, and **Matplotlib**.
 It allows users to add custom processes and simulate various scheduling algorithms with **real-time Gantt chart animation**, **ready queue visualization**, and **performance statistics**.
 
 ---
 
 ## 🚀 Features
 
-✅ Interactive **Tkinter GUI**  
-✅ Supports multiple **CPU scheduling algorithms**  
-✅ Real-time **Gantt chart animation** using Matplotlib  
-✅ Displays **Ready Queue** (for Round Robin & Preemptive algorithms)  
-✅ Shows **average waiting time**, **turnaround time**, and **response time**  
-✅ Add or delete processes dynamically  
-✅ Clean and responsive design  
+✅ Interactive **Tkinter GUI**
+✅ Supports multiple **CPU scheduling algorithms**
+✅ Real-time **Gantt chart animation** using Matplotlib
+✅ Displays **Ready Queue** (for Round Robin & Preemptive algorithms)
+✅ Shows **average waiting time**, **turnaround time**, and **response time**
+✅ Add or delete processes dynamically
+✅ Clean and responsive design
 
 ---
 
@@ -60,7 +60,7 @@ Displays process execution in timeline order, showing process IDs along the time
 
 ## 🧠 Working
 
-1. Enter process details (`PID`, `Arrival`, `Burst`, `Priority`)  
+1. Enter process details (`PID`, `Arrival`, `Burst`, `Priority`)
 2. Choose your desired **Scheduling Algorithm**
 3. (Optional) Enter Quantum value (for Round Robin)
 4. Click **Run**
@@ -72,9 +72,9 @@ Displays process execution in timeline order, showing process IDs along the time
 ## 🛠️ Tech Stack
 
 - **Python 3.8+**
-- **Tkinter** → GUI Framework  
-- **Matplotlib** → Animation and Gantt Chart  
-- **Threading** → Live simulation without freezing GUI  
+- **Tkinter** → GUI Framework
+- **Matplotlib** → Animation and Gantt Chart
+- **Threading** → Live simulation without freezing GUI
 
 ---
 
@@ -115,4 +115,4 @@ Shashwat
 
 Made with ❤️ using Python & Tkinter
 
-</div> 
+</div>