📘 operating systems
Step-by-step solutions with LaTeX - clean, fast, and student-friendly.
Lru Page Faults
1. **Problem Statement:**
We have a page reference string: $7,0,1,2,0,3,0,4,2,3,0,3,2,1,2$ and 3 page slots. We need to use the Least Recently Used (LRU) page replacement algorithm
Process Scheduling
1. Task 1: Five batch jobs with running times and priorities:
Jobs A-E with times: A=11, B=6, C=2, D=4, E=8 minutes.