Try out these unsolved questions on memory management to check your conceptual knowledge.
Q1. If the value of relocation register is 1000 and limit register is 700. What is the physical addresses for the logical addresses
Q2. Given three free memory partitions of 150 KB, 50 KB , and 300 KB(in order). How would each of the first-fit, best-fit, and worst-fit algorithms place processes of 125 KB, 150 KB, 100 KB and 20 KB (in order)?
Q3. Consider a logical address space of 8 pages of 1024 words mapped into memory of 32 frames. How many bits are there in the logical address?
Q4. Consider a program that consists of 8 pages (from 0 to 7) and we have 4 page frames in the physical memory for the pages. The page reference string is :
1 2 3 2 5 6 3 4 6 3 7 3 1 5 3 6 3 4 2 4 3 4 5 1
The number of page faults in optimal page replacement algorithm are?
Q5. In a computer system, memory mapped access takes 100 nanoseconds when a page is found in TLB In case the page is not TLB, it takes 400 nanoseconds to access. Assuming a hit ratio of 80%, the effective access time is?
Q6. Using a page size of 16 bytes and physical memory of 64 bytes, find the physical address if the logical address is 20. The page table is given below
|Page number||Frame Number|
Q8. Differentiate between compile time binding, load time binding and execution time binding. Which is the most suitable method for address generation?
More Practice Problems