Q1. Let consider a logical address space of 8 pages of 1024 words mapped to a physical memory of 32 frames.
a) Determine the number of bits which are in the logical address.
b) Determine the number of bits which are in the physical address.
Q2. Let consider the given page reference string:
1,2,3,4,2,1,5,6,2,1,2,3,7,6
Describe the number of page fault which occur for LRU page replacement algorithm supposing 3 frames?
Q3. Consider the given page reference string:
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1
Describe the number of page fault which occur for FIFO page replacement algorithm supposing 4 frames?
Q4. Illustrate the difference between indexed and indexed sequential file?
Q5. Compare and contrast the performance of C-SCAN and SCAN scheduling, supposing a uniform distribution of requests. Let consider the average response time (the time between the arrival of a request and the completion of the request’s service), the variation in response time, and the efficient bandwidth. Explain how does performance based on the relative sizes of seek time and rotational latency?
Q6. Describe the different file allocation methods? Describe in detail?