Back to the 2022 paper
Similar questions
Operating SystemGiven 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?20247mOperating SystemWhich memory allocation policy allocates the largest hole to the process? (i) Best-fit (ii) Worst-fit (iii) First-fit (iv) None of the above.20222mOperating SystemWrite a short note on: Contiguous Memory allocation20257mCOMPUTER ORGANIZATION & ARCHITECTUREExplain different cache replacement algorithms used in memory management.20247m
PreviousConsider 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?NextConsider a demand-paging system with a paging disk that has an average access and transfer time of 20 milli-seconds. Addresses are translated through a page table in main memory, with an access time of 1 microsecond per memory access. Thus, each memory reference through the page table takes two accesses. To improve this time, we have added an associative memory that reduces access time to one memory reference if the page-table entry is in the associative memory. Assume that 80 percent of the accesses are in the associative memory and that of those remaining, 10 percent (or 2 percent of the total) cause page faults. What is the effective memory access time?