Which of the following is true of multilevel queue scheduling? Processes can mov

Question

Which of the following is true of multilevel queue scheduling? Processes can move between queues. Each queue has its own scheduling algorithm. A queue cannot have absolute priority over lower-priority queues. It is the most general CPU-scheduling algorithm. A significant problem with priority scheduling algorithms is, complexity starvation determining the length of the next CPU burst determining the length of the time quantum Assume that the memory partition is of equal size (partition memory into equal sizes of 400), and the process is loaded into 350KB of this memory, then the remaining 50 KB is considered: External fragmentation Compaction Partitioning Internal fragmentation is not a technique for handling critical sections in operating systems. Non-preemptive kernels Preemptive kernels Spin locks Peterson's solution A(n) refers to where process is accessing updating shared data. Critical section entry section mutex test-and-set One necessary condition for deadlock is, which states that a process must be holding one resource and waiting to acquire additional resources. hold and wait mutual exclusion circular wait no preemption Segments of code that determines action to be taken for each type of interrupt are called: Interrupt Service Routine. Interrupt Vector. Interrupt Structure. Interrupt driven. Which of the following statements is true? A state is a deadlocked state. A safe state may lead to a deadlocked state.

Explanation / Answer

8 . B) Each queue has its own scheduling algorithm.

9. B) starvation(low priority process may not get executed)

10. B) compaction

11. B)preemptive

12. A)critical section

13. B)mutual exclusion

14. A)Interrupt service routine

15. B)A safe state may lead to dead lock state

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

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