1. Explain two advantages to using different quantum time values at each level of a multi-level queuing job scheduling system.

2. Among these four scheduling algorithms: First-come first-serve, shortest job first, round-robin, and priority scheduling, which one can cause the starvation problem? Explain the condition such cases can happen.

3.Determine either True or False and write some sentences to justify your answers for each question below:

a) In a Symmetric Multiprocessing (SMP) system that each processor manages its private queue of processes, we should place a new process in the same queue with its parent process

b) In a NUMA-aware scheduling system, the thread can be scheduled to run on an arbitrary CPU if such as CPU is idle.