My Blog
1. Priority-Based Non-Preemptive Scheduling Definition: In Priority Non-Preemptive Scheduling, each process is assigned a priority.The CPU is allocated to the process with the highest priority (smallest number = highest priority).Once…
Definition:Round Robin is a preemptive CPU scheduling algorithm where each process is assigned a fixed time slice or quantum. The CPU executes each process for this fixed amount of time…
Perspective OS Type Description Example User Point of View Single-User One user at a time Windows 11 Multi-User Many users simultaneously UNIX CLI Command-based interface MS-DOS GUI Icon/menu-based interface macOS…
unix shell scriptDownload
Solving the Round Robin (RR) Scheduling Algorithm Given Data: Step 1: Gantt Chart Construction Using a time quantum of 4, we allocate the CPU to each process in a round-robin…
Example: Given Processes: Process Arrival Time Burst Time P1 0 6 P2 1 8 P3 2 7 P4 3 3 Time Quantum: 4 Step 1: Process Execution Gantt Chart |…
Example of Non-Preemptive SJF Given Processes: Process Arrival Time Burst Time P1 0 7 P2 2 4 P3 4 1 P4 5 4 Step 1: Order of Execution Gantt Chart:…
OS unit 5Download
variables type1)shell2)system/environment3) userdefine variable !/bin/bash echo “File Name: $0”echo “First Parameter : $1”echo “Second Parameter : $2”echo “Quoted Values: $@”echo “Quoted Values: $*”echo “Total Number of Parameters : $#” !/bin/sh…
AlgorithmDownload
admin