Q1. Assume that the system is in an unsafe state. Illustrate that it is possible for the processes to complete their execution devoid of entering a deadlock state.
Q2. By using a diagram, carry out an indexed allocation of a file for disk based system which consists of a disk of 30 blocks each of 1024 bytes (take as 6×5 matrix), File f1 of 11 logical records of the 112 bytes, File f2 of 890 logical records of the13 bytes, File f3 of the 510 bytes of binary data stream and File f4 of 4 logical records of the 95 bytes.
Q3. To make a robust distributed system, describe its three possible kinds of failure. Explain which of the failures are as well applicable to the centralized system.
Q4. Suppose that there is a page-reference string of length P for a process by using m frames (initially all empty). n distinct page numbers take place in it. What are the lower and upper bounds number on the number of page faults? You might use page replacement Algorithm.