Q1. Explain the difference between internal and external fragmentation.
Q2. Differentiate between logical and physical memory.
Q3. Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order), how would each of the first-fit, best-fit, and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB, and 426 KB (in order)? Which algorithm makes the most efficient use of memory?
Q4. Consider a paging system with the page table stored in memory.
a. If a memory reference takes 200 nanoseconds, how long does a paged memory reference take?
b. If we add associative registers, and 75 percent of all page-table references are found in the associative registers, what is the effective memory reference time? (Assume that finding a page-table entry in the associative registers takes zero time, if the entry is there.)
Q5. What is the purpose of paging the page tables?
Q6. Write a short note on fragmentation in paging and segmentation.
Q7. Explain best fit,first fit and worst fit in the context of contiguous memory allocation.
Q8. Differentiate between contiguous and non contiguous memory allocation with an example.
Q9. Differentiate between paging and segmentation.
Q10. Explain paging in detail.
No comments:
Post a Comment