Back to the 2024 paper
Similar questions
OPERATING SYSTEMConsider a simple paging system with the following parameters: * 2^32 bytes of physical memory * Page size of 2^10 bytes * 2^16 pages of logical address space (i) How many bits are in a logical address? (ii) How many bytes are in a frame? (iii) How many bits in the physical address specify the frame? (iv) How many entries are in the page table?20227mOPERATING SYSTEMIf the size of logical address space is 2^m, and a page size is 2^n addressing units, then the high order bits of a logical address designate the page number, and the low order bits designate the page offset. (i) m, n (ii) n, m (iii) m-n, m (iv) m-n, n20222mOperating SystemExplain paging with translation look-aside buffer (TLB) scheme with suitable diagrams.20237mOperating SystemIn demand paging, pages are: (i) Loaded only when they are required during execution (ii) Loaded all at once before execution begins (iii) Never removed from main memory (iv) Loaded in random order20242m
PreviousConsider the main memory with the capacity of 4 page frames. Assume that the page of process are referenced in the order as given below: 1, 3, 4, 4, 3, 2, 1, 7, 5, 6, 4, 2, 1, 2 Which of FIFO or LRU would be better in this case as a page replacement policy? Why?NextGiven five memory partition of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB(in order), how would the first-fit and best-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?