Indicate which is a pre-emptive scheduling algorithm
A. Round-robin
B. Shortest-job-next
C. Priority-based
D. All of the above
E. None of the above
Answer: Option A
Solution(By Examveda Team)
Round-robin is the preemptive process scheduling algorithm. Each process is provided a fix time to execute, it is called a quantum. Once a process is executed for a given time period, it is preempted and other process executes for a given time period.This Question Belongs to Computer Fundamentals >> Operating System
Join The Discussion
Comments ( 1 )
If there are multiple recycle bin for a hard disk
A. You can set different size for each recycle bin
B. You can choose which recycle bin to use to store your deleted files
C. You can make any one of them default recycle bin
D. None of above
A. You can find deleted files in recycle bin
B. You can restore any files in recycle bin if you ever need
C. You can increase free space of disk by sending files in recycle bin
D. You can right click and choose Empty Recycle Bin to clean it at once
If the displayed system time and date is wrong, you can reset it using
A. Write
B. Calendar
C. Write file
D. Control panel
Priority based algorithm is also a preemptive algorithm. because if a high priority job arrived running a low priority job, existing job will be preempted. Guide me if I am wrong.