send mail to email@example.com mentioning your email id and mobileno registered with us! if details not recieved
Resend Opt after 60 Sec.
Please verify your mobile number
Subscribe to Notifications
Stay updated with the latest Current affairs and other important updates regarding video Lectures, Test Schedules, live sessions etc..
Refer & Earn
My Abhipedia Earning
Kindly Login to view your earning
FIFO scheduling is
Ans: C . Non-preemptive scheduling.
Non preemptive scheduling is used when a process terminates, or a process switches from running to waiting state. In this scheduling, once the resources (CPU cycles) is allocated to a process, the process holds the CPU till it gets terminated or it reaches a waiting state. FIFO is non preemptive scheduling algorithm .
By: Brijesh Kumar ProfileResourcesReport error
Access to prime resources