With round-robin CPU scheduling in a time shared system

Related MCQs

• In multi processor scheduling; A: Gang scheduling, B: Dynamic scheduling, C: Dedicated processor management.; 1- The number of threads in a process can be altered during the course of execution. 2- This provides implicit scheduling defined by the assignment of threads to processors, 3- It is applied to the simultaneous scheduling of threads that make up a single process.
• In uni-processor scheduling :A : Turnaround time, B : Response time, 1: A time interval between the submission of a process and its completion. 2: For interactive process, it is a time from the submission of a request until the response begins to received. 3: It includes actual execution time plus time spent waiting for resources.
• In real time scheduling: A: Static table driven approach, B: Static priority driven preemptive approach, C: Dynamic planning based approach; 1- A static analysis of feasible scheduler of dispatching is done and implemented. 2- A static analysis of feasible schedules of dispatching is done and assigns priorities to tasks. 3- Feasibility is determined at run time.
• In round robin (time slicing) policy applied on uni-processor scheduling
• If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni- processor scheduling policy selects.
• In round robin (time slicing) policy applied on uni processor scheduling
• If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni processor scheduling policy selects
• The access time in disk scheduling is
• The transfer time in disk scheduling is
• In disk scheduling, the shortest service time first policy selects the disk request that