In round robin (time slicing) policy applied on uni-processor scheduling

Related MCQs

• In round robin (time slicing) policy applied on uni processor scheduling
• 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.
• With round-robin CPU scheduling in a time shared system
• The correct matching for the following pairs is - (A) Disk sucheduling, (1) Round robin, (B) Batch processing, (2) SCAN ,(C) Time sharing, (3) LIFO, (D) Interrupt processing, (4) FIFO,
• 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.
• Round robin is a
• In shortest service time first policy, applied on disk scheduling, the disk request is selected
• If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni- processor scheduling policy selects.
• If normalized turnaround time of different process are given. Then Highest response ratio next policy in uni processor scheduling policy selects
• In uni-processor scheduling, if non- preemptive policy is applied then