A computer has six tape drives, with n processes competing for them. Each process may need two drives. What is the maximum value of n for the system to be deadlock free?

In a resident $$–OS$$ computer, which of the following systems must reside in the main memory under all situations?

The overlay tree for a program is as shown below:

What will be the size of the partition (in physical memory) required to load (and run) this program?

If an instruction takes $${\rm I}$$ microseconds and a page fault takes an additional $$j$$ microseconds, the effective instruction time if on the average a page fault occurs every $$k$$ instruction is: