added user input for deadlock detection

Author: Rakibul73

README.md

@@ -43,7 +43,8 @@ py -3.11 -m pip install numpy
 
 ### Lab - 5 == Deadlock Detection
  [jupyter File](./deadlock_detection.ipynb)     <br/>
- [Python File](./same_python_file/deadlock_detection.py)
+ [Python File](./same_python_file/deadlock_detection.py) &nbsp;&nbsp; / &nbsp;&nbsp; [Python File Alternative](./same_python_file/deadlock_detection_alternative.py)
+
 
 
 <hr/><hr/>

deadlock_detection.ipynb

@@ -91,6 +91,85 @@
     "    # Perform deadlock detection\n",
     "    deadlock_detection(available_resources, max_claim_per_process, current_allocation)\n"
    ]
+  },
+  {
+   "cell_type": "markdown",
+   "metadata": {},
+   "source": [
+    "### Alternative 2\n",
+    "With input"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "def input_data():\n",
+    "    global n, r, max_claim, allocation, avail\n",
+    "\n",
+    "    n = int(input(\"Enter the number of processes: \"))\n",
+    "    r = int(input(\"Enter the number of resources: \"))\n",
+    "\n",
+    "    print(\"Enter the Maximum Claim Matrix:\")\n",
+    "    max_claim = []\n",
+    "    for i in range(n):\n",
+    "        row = list(map(int, input().split()))\n",
+    "        max_claim.append(row)\n",
+    "\n",
+    "    print(\"Enter the Allocation Matrix:\")\n",
+    "    allocation = []\n",
+    "    for i in range(n):\n",
+    "        row = list(map(int, input().split()))\n",
+    "        allocation.append(row)\n",
+    "\n",
+    "    print(\"Enter the Available Resources:\")\n",
+    "    avail = list(map(int, input().split()))\n",
+    "\n",
+    "\n",
+    "def show_data():\n",
+    "    global n, r, max_claim, allocation, avail\n",
+    "\n",
+    "    print(\"Process\\tAllocation\\tMax\\t\\tAvailable\")\n",
+    "    for i in range(n):\n",
+    "        print(f\"P{i + 1}\\t\\t{allocation[i]}\\t\\t{max_claim[i]}\\t\\t{avail}\")\n",
+    "\n",
+    "\n",
+    "def is_safe_state():\n",
+    "    global n, r, max_claim, allocation, avail\n",
+    "\n",
+    "    work = avail.copy()\n",
+    "    finish = [False] * n\n",
+    "\n",
+    "    while True:\n",
+    "        found = False\n",
+    "        for i in range(n):\n",
+    "            if not finish[i] and all(work[j] >= max_claim[i][j] - allocation[i][j] for j in range(r)):\n",
+    "                found = True\n",
+    "                finish[i] = True\n",
+    "                work = [work[j] + allocation[i][j] for j in range(r)]\n",
+    "                break\n",
+    "\n",
+    "        if not found:\n",
+    "            break\n",
+    "\n",
+    "    return all(finish)\n",
+    "\n",
+    "\n",
+    "def deadlock_detection():\n",
+    "    if is_safe_state():\n",
+    "        print(\"The system is in a safe state. No deadlock detected.\")\n",
+    "    else:\n",
+    "        print(\"Deadlock detected. The system is in an unsafe state.\")\n",
+    "\n",
+    "\n",
+    "if __name__ == \"__main__\":\n",
+    "    print(\"********** Deadlock Detection Algo ************\")\n",
+    "    input_data()\n",
+    "    show_data()\n",
+    "    deadlock_detection()\n"
+   ]
   }
  ],
  "metadata": {

same_python_file/deadlock_detection_alternative.py

@@ -0,0 +1,63 @@
+def input_data():
+    global n, r, max_claim, allocation, avail
+
+    n = int(input("Enter the number of processes: "))
+    r = int(input("Enter the number of resources: "))
+
+    print("Enter the Maximum Claim Matrix:")
+    max_claim = []
+    for i in range(n):
+        row = list(map(int, input().split()))
+        max_claim.append(row)
+
+    print("Enter the Allocation Matrix:")
+    allocation = []
+    for i in range(n):
+        row = list(map(int, input().split()))
+        allocation.append(row)
+
+    print("Enter the Available Resources:")
+    avail = list(map(int, input().split()))
+
+
+def show_data():
+    global n, r, max_claim, allocation, avail
+
+    print("Process\tAllocation\tMax\t\tAvailable")
+    for i in range(n):
+        print(f"P{i + 1}\t\t{allocation[i]}\t\t{max_claim[i]}\t\t{avail}")
+
+
+def is_safe_state():
+    global n, r, max_claim, allocation, avail
+
+    work = avail.copy()
+    finish = [False] * n
+
+    while True:
+        found = False
+        for i in range(n):
+            if not finish[i] and all(work[j] >= max_claim[i][j] - allocation[i][j] for j in range(r)):
+                found = True
+                finish[i] = True
+                work = [work[j] + allocation[i][j] for j in range(r)]
+                break
+
+        if not found:
+            break
+
+    return all(finish)
+
+
+def deadlock_detection():
+    if is_safe_state():
+        print("The system is in a safe state. No deadlock detected.")
+    else:
+        print("Deadlock detected. The system is in an unsafe state.")
+
+
+if __name__ == "__main__":
+    print("********** Deadlock Detection Algo ************")
+    input_data()
+    show_data()
+    deadlock_detection()