In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases? [G16S2Q30]

Explanation

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first. [G16S2Q57]

Explanation

Consider the following two-process synchronization solution. [G16S2Q58]

Explanation

Consider a non-negative counting semaphore S. The operation P(S) decrements S, and V(S) increments S. During an execution, 20 P(S) operations and 12 V(S) operations are issued in some order [G16S2Q59]

Explanation

A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is 1 ms and to read a block from the disk is 10 ms. [G16S2Q60]

Explanation

Consider an arbitrary set of CPU-bound processes with unequal CPU burst lengths submitted at the same time to a computer system. [G16S1Q30]

Explanation

Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page table entry requires 48 bits, then the size of the per-process page table is megabytes. [G16S1Q57]

Explanation

Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass [G16S1Q58]

Explanation

Consider a computer system with ten physical page frames. The system is provided with an access sequence (a1,a2,...,a20,a1,a2,...,a20), where each ai is a distinct virtual page number. [G16S1Q59]

Explanation

Consider the following proposed solution for the critical section problem. There are n processes: P0 ...Pn−1. In the code, function pmax returns an integer not smaller than any of its arguments. [G16S1Q60]

Explanation

Consider the following two phase locking protocol. Suppose a transaction T accesses (for read or write operations), a certain set of objects {O1,...,Ok}. This is done in the following manner: [G16S1Q61]

Explanation

Which of the following is/are shared by all the threads in a process ? [G17S2Q7]

Explanation

In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed? [G17S2Q8]

Explanation

In a two-level cache system, the access times of L1 and L2 caches are 1 and 8 clock cycles, respectively. The miss penalty from the L2 cache to main memory is 18 clock cycles. [G17S2Q29]

Explanation

A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below: [G17S2Q33]

Explanation

The read access times and the hit ratios for different caches in a memory hierarchy are as given below. [G17S2Q45]

Explanation

Consider the set of processes with arrival time (in milliseconds), CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time. [G17S2Q51]

Explanation

Which of the following is an interrupt according to temporal relationship with system clock ? [J17P3Q1]

Explanation

Which of the following is incorrect for virtual memory ? [J17P3Q2]

Explanation

A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively [J17P3Q49]

Explanation