Consider the following page reference string: 1, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4,0
Assuming demand paging with three frames, how many page faults would occur for the LRU replacement algorithms?
2. Consider the page table shown for a system with 12-bit virtual and physical addresses and with 256-byte pages. Convert the virtual address 5EF to its equivalent physical address in hexadecimal. A "-" in the table indicates that the page is not in memory.
3. Specify the importance of directory structure.
4. Distinguish between an absolute path name and a relative path name.
5. Bring out the relationship between partitions and mounting.