Question Bank all jobs

1. Consider a computer with 8 Mbytes of main memory and a 128 K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block ?

2. The first-fit, best-fit and the worst-fit algorithm can be used for

3. If there are 32 segments, each of size 1 K byte, then the logical address should have

4. Dirty bit is used to show the

5. In real-time operating systems, which of the following is the most suitable scheduling scheme?

6. In a paged memory, the page hit ratio is 0.35. The time required to access a page in secondary memory is equal to 100 ns. The time required to access a page in primary memory is 10 ns. The average time required to access a page is

7. Working set (t, k) at an instant of time, t, is

8. Distributed systems should

9. Fence register is used for

10. Determine the number of page faults when references to pages occur in the following order : 1, 2, 4, 5, 2, 1, 2, 4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page 1 having been brought earlier than page 2. (LRU algorithm is used)

Ans.
1 3
2 1
3 3
4 3
5 3
6 3
7 4
8 2
9 2
10 3