In a time-sharing operating system, when the time slot given to a process is completed, the process goes from the running state to the :
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
- The LRU algorithm
- An interrupt vector
- Process are classified into different groups in
- The processes that are residing in main memory and are ready and waiting to execute are kept on a list called
- The strategy of making processes that are logically runnable to be temporarily suspended is called :
- 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 :