If a virtual memory system has 4 pages in real memory and the rest must be swapped to disk. Which of the following is the hit ratio for the following page address stream. Assume that memory starts emply. Use the First In First Out (FIFO) algorithm.
| A. | 10% |
| B. | 15% |
| C. | 25% |
| D. | 31% |
|
Option: D Explanation : Click on Discuss to view users comments. |
A computer system has 4 k word cache organised in a block-set-associative manner, with 4 blocks per set, 64 words per block. The number of bits in the SET and WORD fields of the main memory address format is
| A. | 15, 4 |
| B. | 6, 4 |
| C. | 7, 2 |
| D. | 4, 6 |
|
Option: D Explanation : There are 64 words in a block. So 4K cache has ( 4 x 1024)/64 = 64 blocks. Since 1 set has 4 blocks, there are 16 sets. 16 sets needs 4 bits for representation. In a set there are 4 blocks, which needs 2 bits. Each block has 64 words. So, the word field has 6 bits. Click on Discuss to view users comments. |
The address sequence generated by tracing a particular program executing in a pure demand paging system with 100 records per page, with a free main memory frame is recorded as follows. What is the number of page faults ? 0100,0200,0430,0499,0510,0530,0560,0120, 0220,0240,0260,0320,0370.
| A. | 13 |
| B. | 8 |
| C. | 7 |
| D. | 10 |
|
Option: C Explanation : When it tries to access 0100, it results in a page fault as the memory is empty. right now. So, it loads the second page (which has the addresses 100-199). Trying to access 200 will result in a page fault, as it is not in memory right now. So the third page with the addresses from 200 to 299 will replace the second page in memory. Trying to access 430 will result in another page fault. Proceeding this way, we find trying to access the addresses 0510, 0120, 0220, 0320 will all result in page faults. So, altogether 7 page faults. Click on Discuss to view users comments. |
In a paged segmented scheme of memory management, the segment table itself must have a page table because
| A. | the segment is spread over a number to hit in one page |
| B. | each segment is spread over a number of pages |
| C. | segment tables point to page tables and not to the physical location of the segment |
| D. | the processor's description base register points to a page table |
|
Option: B Explanation : Click on Discuss to view users comments. |
Syllabus covered in this section is-
This Section covers Operating System Questions Answers .These questions can be used for the preparation of various competitive and academic exams like
Who can benefit
Various search terms used for This section are
