NivaarExam PrepOfficial exam papers ↗

25-Comp-A5 Operating Systems: Undated paper

Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)

  1. Question 1 CPU Scheduling — Generic Priority Formula & SRTF
  2. Question 2 Address Translation & Demand Paging
  3. Question 3 Scheduler Design Defects, Deadlock vs. Starvation, Effective Access Time
  4. Question 4 Linked-List File Allocation, Multi-Level Directories, Free-Space Management
  5. Question 5 Deadlock Conditions, Read-Only Files, Resource-Bound Safety
  6. Question 6 Disk-Scheduling Algorithms; Processes vs. Threads; Optimal CPU Scheduling
  7. Question 7 Priority Inversion, Security vs. Protection, Disk Fragmentation, FAT, Address Binding

Start with Question 1 →

Candidates were instructed to answer any five of the seven questions; all seven are answered below as a complete study resource.

Reference texts: Silberschatz, Galvin & Gagne, Operating System Concepts (10th ed.) — CPU scheduling (ch. 5), process synchronization/monitors (ch. 6–7), deadlocks (ch. 8), memory management/paging (ch. 9–10), mass-storage/file-system implementation and disk scheduling (ch. 11–12), protection (ch. 14); Tanenbaum, Modern Operating Systems (5th ed.), corroborating chapters on scheduling, synchronization, memory and file systems.