The strategy of making processes that are logically runnable to be temporarily suspended is called :
Asked in Mizoram PSC 3.Technical Paper-I
Answer under review: our editors are checking this question. Try the other MPSC Prelims previous year questions questions meanwhile.
More MPSC Prelims previous year questions questions
- Consider the following set of processes, the length of the CPU burst time given in milliseconds: Processes Burst Time Arrival time P1 6 0 P2 8 0 P3 7 0 P4 3 0 Assuming the above process being scheduled with the SJF scheduling algorithm, what is the waiting time for process P1?
- A solution to the problem of indefinite blockage of low priority processes is :
- A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called :
- The segment of code in which the process may change common variables, update tables, write into files is known as :
- The two atomic operations permissible on semaphores are :
- At a particular time of computation the value of a counting semaphore is 7. Then 20 P operations and 15 V operations were completed on this semaphore. The resulting value of the semaphore is :
- Which of the following condition is required for deadlock to be possible?
- Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?