Match List I with List II. List I: (A) Stack algorithm, (B) Elevator algorithm, (C) Priority scheduling algorithm, (D) Havender's algorithm. List II: (I) Deadlock, (II) Disk scheduling, (III) Page replacement, (IV) CPU scheduling.
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. (A)-(III), (B)-(II), (C)-(IV), (D)-(I)
Explanation
Stack algorithms are a class of page-replacement algorithms (like LRU); the elevator algorithm (SCAN) schedules the disk; priority scheduling is CPU scheduling; Havender's approach prevents deadlock.
More System Software and Operating System questions
- In a file allocation system, the following allocation schemes are used: A. Contiguous B. Indexed C. Linked allocation Which of the allocati…
- Given below are three statements related to interrupt handling mechanism A. Interrupt handler routine is not stored at a fixed address in t…
- Match List I (system calls) with List II (description). List I: A. fork(), B. exec(), C. kill(), D. exit(). List II: I. Sends a signal from…
- Consider processes P1 (arrival 0, burst 8), P2 (1, 4), P3 (2, 9), times in ms. What is the average waiting time with preemptive shortest jo…
- The number of bits reserved for the frame offset is:
- Find number of pages required for the given virtual address space