Placement papers on Operating System - Set 11

Placement papers on Operating System - Set 11

Q1. Match the pair.

A. Buddy system ------------- P. Run-time type specification
B. Interpretation ----------- Q. Segmentation
C. Pointer type ------------- R. Memory Allocation
D. Virtual memory ----------- S. Garbage collection

1. A – R, B – P, C – S, D - Q
2. A – P, B – R, C – Q, D – S
3. A – Q, B – P, C – R, D – S
4. A – S, B – P, C – Q, D – R
View Answer / Hide Answer


Q2. Consider an operating system that contains 3 user processes. Each processes of operating system require 2 units of resource R. How many units of R are needed so that no deadlocks will

ever arise?

1. 6
2. 5
3. 4
4. 3
View Answer / Hide Answer


Q3. The statement that does not hold true for deadlock avoidance scheme is

1. The request for resources is always granted if the resulting state is safe.
2. It is less restrictive than deadlock prevention
3. It requires knowledge of resource
4. All of the above
View Answer / Hide Answer


Q4. Consider a computer system in which n processes are competing for six tape drives. Each process may need two drives. For the system to be deadlock free the maximum value of n is

1. 3
2. 4
3. 5
4. 6
View Answer / Hide Answer


Q5. We have a shared variable m which is initialized to zero. It is operated on by four concurrent processes A, B, C and D. A and B each reads m from memory, increments by 1, stores it to

memory and then terminates. C and D each reads m from memory, decrements by 2, stores it to memory and then terminates. Before reading m each process invokes wait operation on a counting

semaphore and each process invokes signal on the semaphore after storing m to memory. Semaphore is initialized to 2. After all process complete execution, the maximum possible value of m is

1. 2
2. 1
3. -2
4. -1
View Answer / Hide Answer