Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Using the page table shown below, translate the physical address 25 to virtual address. The address length is 16 bits and page size is 2048 words while the size of the physical memory is four frames. Page Present (1-In, 0-Out) Frame 0 1 3 1 1 2 2 1 0 3 0 -
Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 Let a computer system has main memory size of 3 page frames which are initially empty and it is running on demand paged virtual memory system. The number of page faults under LRU and FIFO page replacement policy are respectively:
Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on a demand paged virtual memory system running on a computer system that has main memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy. Then
When they had a meeting seven company executives __ T, U, V, W, X, Y and Z ___ sit at a rectangular table .Three executives sit along one side of the table , and three sit along the other side, each directly opposite one of the other three. The seventh sits at the head of the table . There is no seat at the foot of the table . Ualways sits in one of te two seats farthest from the head of the table. Y and V always sit next to each other .V never sits next to Z . If Z does not sit at the head of the table, W sits there. If W sits directly opposite T, X must sit next to which of the following excutives?
Suppose, you begin reading a book on page h and end on page k. If you read each page completely and the pages are numbered and read consecutively, then how many page shave you read?
If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of 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.
What is the size of the physical address space in a paging system which has a page table containing 64 entries of 11 bit each (including valid/invalid bit) and a page size of 512 bytes?
Determine the number of page faults when references to pages occur in the following order : 1, 2, 4, 5, 2, 1, 2, 4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page one having brought earlier than page 2. (LRU page replacement algorithm is used) 
Recall that Belady’s anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: S1: Random page replacement algorithm (where a page chosen at random is replaced) Suffers from Belady’s anomaly S2: LRU page replacement algorithm suffers from Belady’s anomaly Which of the following is CORRECT?
How many page faults occur in a system with LRU page replacement policy having 3 (initially empty) page frames for the following string of page reference - 5, 1, 2, 3, 4, 3, 2, 3, 1, 2, 4, 3?