Question
a.
3.0 ns
b.
68.0 ns
c.
68.5 ns
d.
78.5 ns
Posted under Operating System
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. In a paged memory, the page hit ratio is 0.35. The required to access a page in secondary memory is equal to 100 ns. The time required to access a page in primary memory is 10 ns....
Similar Questions
Discover Related MCQs
Q. To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. For implementing dynamic loading,
View solution
Q. In paged memory systems, if the page size is increased, then the internal fragmentation generally :
View solution
Q. In segmentation, each address is specified by :
View solution
Q. In paging the user provides only ________ which is partitioned by the hardware into ________ and ______
View solution
Q. Each entry in a segment table has a :
View solution
Q. The segment base contains the :
View solution
Q. The segment limit contains the :
View solution
Q. The offset ādā of the logical address must be :
View solution
Q. If the offset is legal :
View solution
Q. When the entries in the segment tables of two different processes point to the same physical location :
View solution
Q. The protection bit is 0/1 based on :
View solution
Q. If there are 32 segments, each of size 1Kb, then the logical address should have :
View solution
Q. Consider a computer with 8 Mbytes of main memory and a 128 K cache. The cache block size is 4 K. It uses a direct mapping scheme for cache management. How many different main memory blocks can map onto a given physical cache block ?
View solution
Q. A multilevel page table is preferred in comparison to a single level page table for translating virtual address to physical address because :
View solution
Q. Which one of the following is not a secondary storage?
View solution
Q. Which private network uses storage protocol rather than networking protocol?
View solution
Q. The time for the disk arm to move the heads to the cylinder containing the desired sector is called
View solution
Q. Which algorithm of disk scheduling selects the request with the least seek time from the current head positions?
View solution
Q. Operating system is responsible for
View solution
Q. A swap space can reside in
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Operating System? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!