Q. A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as

View solution

Q. How many states can a process be in ?

View solution

Q. Virtual memory is

View solution

Q. Optical storage is a

View solution

Q. WINDOWS is a …………… operating.

View solution

Q. Page making process from main memory to disk is called

View solution

Q. A Dead-lock in an Operating System is

View solution

Q. Match the following:

Set-I
(a) Disk scheduling
(b) Batch processing
(c) Time sharing
(d) Interrupt processing

Set-II
1. Round-robin
2. SCAN
3. LIFO
4. FIFO

Codes :
    (a) (b) (c) (d)

View solution

Q. ………….. synchronizes critical resources to prevent dead lock.

View solution

Q. …………….. is one of pre-emptive scheduling algorithm.

View solution

Q. In order to allow only one process to enter its critical section, binary semaphore are initialized to

View solution

Q. Remote Computing Service involves the use of time sharing and …………..

View solution

Q. Applications-software

View solution

Q. At any given time Parallel Virtual Machine (PVM) has ……………. send buffer and …………… receive buffer.

View solution

Q. In the process management Round-robin method is essentially the pre-emptive version of …………

View solution

Q. A page fault

View solution

Q. A semaphore count of negative n means (s = –n) that the queue contains ………….. waiting processes.

View solution

Q. A program is located in the smallest available hole in the memory is ……………

View solution

Q. With a four programs in memory and with 80% average I/O wait, the CPU utilization is?

View solution

Q. Assume N segments in memory and a page size of P bytes. The wastage on account of internal fragmentation is:

View solution