NivaarExam PrepOfficial exam papers ↗

25-Comp-A5 Operating Systems: May 2015

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

  1. Question 1 Generalized (Quadratic) Priority-Scheduling Formula
  2. Question 2 Memory Increase vs. CPU Utilization; Best-Fit and First-Fit Allocation
  3. Question 3 Monitors, the Readers-Writers Problem, and Deadlock vs. Starvation
  4. Question 4 Necessary Conditions for Deadlock; PID-Ordered Resource Waiting; Safe vs. Unsafe States
  5. Question 5 Real-Time Systems; Disk-Head Scheduling; Address Binding
  6. Question 6 Variant Round-Robin Scheduling; Page-Reference LRU Trace
  7. Question 7 Contiguous File Block Operations; Fragmentation; Disk Reliability; File Protection

Start with Question 1 →

98-COMP A-5 Operating Systems — National Examinations, May 2015. 3 hours, closed book (approved calculators only), 100 marks. 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.) — scheduling (ch. 5), process synchronization/monitors (ch. 6–7), deadlocks (ch. 8), memory management/paging (ch. 9–10), file systems and disk scheduling (ch. 11–12); Tanenbaum, Modern Operating Systems (5th ed.), corroborating chapters on scheduling and file systems.