Q. Bankers algorithm is for

View solution

Q. Which is the correct definition of a valid process transition in an operating system ?

View solution

Q. Semaphores are used to:

View solution

Q. In which of the following storage replacement strategies, is a program placed in the largest available hole in the memory?

View solution

Q. Remote computing system involves the use of timesharing systems and:

View solution

Q. Match the following

(a) Disk scheduling                 (1) Round robin
(b) Batch processing               (2) Scan
(c) Time sharing                       (3) LIFO
(d) Interrupt processing          (4) FIFO

View solution

Q. IC 80287 is:

View solution

Q. A solution to external fragmentation.

View solution

Q. Not a storage placement strategy for an incoming program/data:

View solution

Q. A preemptive type of process scheduling strategy:

View solution

Q. When a process is accessing shared modifiable data, the process is said to be in:

View solution

Q. The first MPI function call made by every MPI process is the call to:

View solution

Q. Dijkstra’s Banker’s algorithm is used for:

View solution

Q. Memory bank experiencing too much contention from processor:

View solution

Q. Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is

View solution

Q. Consider a system with 2 level cache. Access times of Level 1 cache, Level 2 cache and main memory are 0.5 ns, 5 ns and 100 ns respectively. The hit rates of Level 1 and Level 2 caches are 0.7 and 0.8 respectively. What is the average access time of the system ignoring the search time within the cache?

View solution

Q. To overcome difficulties in Readers-Writers problem, which of the following statement/s is/are true?

(i) Writers are given exclusive access to shared objects
(ii) Readers are given exclusive access to shared objects
(iii) Both Readers and Writers are given exclusive access to shared objects

View solution

Q. Suppose a system has 12 instances of some resource with n processes competing for that resource. Each process may require 4 instances of the resource. The maximum value of n for which the system never enters into deadlock is

View solution

Q. Dirty bit is used to show the

View solution

Q. Suppose for a process P, reference to pages in order are 1,2,4,5,2,1,2,4. Assume that main memory can accommodate 3 pages and the main memory has already 1 and 2 in the order 1 – first, 2 – second. At this moment, assume FIFO Page Replacement Algorithm is used then the number of page faults that occur to complete the execution of process P is

View solution