Operating Systems Questions

Scheduler deals with the problem of deciding which of the process in the ready queue is to be allocated the CPU. Short Term Schedulers, Long Term Schedulers

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 the access takes place, is called race condition. To guard against the race condition we need to ensure that only one process at a time can be manipulating the same data. The technique we use for this is called process synchronization.

A binary semaphore is one, which takes only 0 and 1 as values. They are used to implement mutual exclusion and synchronize concurrent processes.

Deadlock is a situation where a group of processes are all blocked and none of them can become unblocked until one of the other becomes unblocked. The simplest deadlock is two processes each of which is waiting for a message from the other.

• Responsiveness


• Resources sharing


• Economy


• Utilization of multiprocessor architectures.

The processes that are residing in the main memory and are ready and waiting to execute are kept on a list called the ready queue.

Mutual exclusion

Hold and wait

No preemption

Circular wait

Absolute path-- Exact path from root directory.

Relative path-- Relative to the current path.