The major problem with priority scheduling is:
________ scheduler selects from among the processes that are already to execute and allocates the CPU to one of them.
In Peterson’s solution for critical section problem:
A bit-map can be used to keep track of which blocks are free in a file-system’s partition on disk.
Assuming, 1 KB block size and a disk size of 40 GB, what is the size of the bit map?
The data blocks of a very large file in the Unix file system are allocated using
Consider 3 processes, P0
shown in Table:
The completion order or the processes under the policies SRTF and LRTF are: (Conflict for same burst time resolved in favour of lowest process id).
A system is having 10 user processes each requiring 3 units of resource R. The maximum number of units of R such that deadlock will occur?
Which of the following operation is performed by swap space?
Which of the following options is correct?
Which of the following statements is false?