52_IT_A_52_Mohammad_Shadab

12345678910111213141516171819
Across
  1. 3. State where processes wait for each other indefinitely
  2. 5. Algorithm that gives CPU to the shortest process first
  3. 8. Instance of a program in execution
  4. 10. Algorithm used for deadlock avoidance
  5. 11. Memory management scheme that eliminates contiguous allocation
  6. 13. Smallest unit of CPU utilization
  7. 14. Scheduling where each process gets fixed time quantum
  8. 15. Condition when system spends more time swapping than executing
  9. 17. Scheduling where CPU is given based on importance value
  10. 19. Interface between user program and the operating system
Down
  1. 1. Decides which process gets CPU next
  2. 2. Method used by OS to decide the order of process execution
  3. 4. Page replacement algorithm that removes the oldest page
  4. 5. Divides memory into variable-sized parts based on logical units
  5. 6. CPU scheduling algorithm that serves in arrival order
  6. 7. Page replacement algorithm with the lowest page fault theoretically
  7. 9. Disk scheduling algorithm that moves like an elevator
  8. 12. Page replacement algorithm that removes least recently used page
  9. 16. Variable used for process synchronization
  10. 18. Disk scheduling algorithm that serves nearest request next