Consider a system with twelve magnetic tape drives and three processes P1 , P2 and P3 . Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine tape drives. Suppose that at time t1 , process P1 is holding five tape drives, process P2 is holding two tape drives and process P3 is holding three tape drives. At time t 1 , system is in:
| A. | safe state |
| B. | unsafe state |
| C. | deadlocked state |
| D. | starvation state |
|
Option: B Explanation : Click on Discuss to view users comments. |
| A. | buffer data received in its input from where a process reads |
| B. | provide a mechanism to map physical device to file names |
| C. | store list of file names plus pointers associated with i-nodes |
| D. | store information entered by a user application program or utility program |
|
Option: B Explanation : Click on Discuss to view users comments. |
| A. | (iv) (i) (ii) (iii) |
| B. | (i) (iii) (ii) (iv) |
| C. | (iii) (i) (ii) (iv) |
| D. | (iv) (ii) (i) (iii) |
|
Option: A Explanation : Click on Discuss to view users comments. |
In an operating system, indivisibility of operation means :
| A. | Operation is interruptable |
| B. | Race - condition may occur |
| C. | Processor can not be pre-empted |
| D. | All of the above |
|
Option: C Explanation : Click on Discuss to view users comments. |
| A. | A clause in which no variables occur in the expression |
| B. | A clause that has at least one negative literal |
| C. | A disjunction of a number of literals |
| D. | A clause that has at most one positive literal |
|
Option: D Explanation : Click on Discuss to view users comments. |
