1. Processes can incur a race condition when running on an OS with ________ kern

Question

1. Processes can incur a race condition when running on an OS with ________ kernel.        a non-preemptive
       a preemptive
       both a preemptive and a non-preemptive 2. The ______ scheduling algorithm is non-preemptive.        First In First Out
       Priority
       Round Robin
       Shortest Job First 3. The Banker's algorithm helps to _______ deadlocks. (Points : 4)        avoid
       detect
       ignore 4. Which step of the page-fault servicing process takes, by far, the greatest percentage of time?        Servicing the page-fault interrupt
       Reading in the page
       Restarting the process 5. A pool of 200 frames exist for paging of processes A,B, C, D, and E. The processes' page sizes are 100, 200, 50, 150, and 500, respectively. Assuming proportional frame allocation is being deployed, how many frames are allocated to process D?        15
       20
       30
       40 6. A file-control block (FCB) does not contain file _________.        data
       dates
       permissions
       sizes 7. All file systems suffer from ________ fragmentation. The larger the block size, the __________ the fragmentation.        external, greater
       external, lesser
       internal, greater
       internal, lesser 1. Processes can incur a race condition when running on an OS with ________ kernel.        a non-preemptive
       a preemptive
       both a preemptive and a non-preemptive

Explanation / Answer

1) b

preemptive

2) a

first in first out or first come first serve

3) a

deadlock avoidance

4) a

servicing the page fault

5) c

150/(100+200+50+150+500) * 200

= 30

6) a

data

7) c

internal, greater

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.