A page table (PT) has the following contents (see belw). Page size = 512 words. Given thelogical address LA = 1600, determine the following:PT11439.4(1) Page number P =?(2) Offset w = ?(3) Page frame number = ?(4) Physical address = ?Put your answer in the following blanks. One pre blank, from left to right, top tobottom.6.2.

We are going to find out the page number, offset, frame number and physical address for the given…

A page table (PT) has the following contents (see belw). Page size = 512 words. Given the logical address LA = 1600, determine the following: PT 1 14 9. 4 6. (1) Page number P =? (2) Offset w = ? (3) Page frame number =? (4) Physical address = ? Put your answer in the following blanks. One pre blank, from left to right, top to bottom. 2. 3.

A page table (PT) has the following contents (see belw). Page size = 512 words. Given the logical address LA = 1600, determine the following: PT 1 14 9. 4 6. (1) Page number P =? (2) Offset w = ? (3) Page frame number =? (4) Physical address = ? Put your answer in the following blanks. One pre blank, from left to right, top to bottom. 2. 3.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

An entry in a page table points to a page frame in memory, what if two entries in a page table points to same page frame? Does this effect copy large amount of data? Can updating one page effect other page?
Consider the following page reference string: 3 1 4 1 5 9 2 6 5 3 5 Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? Least recently used replacement First-in-first-out replacement
Consider the following page reference string: 7, 7, 2, 2, 7, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1 Assuming demand paging with three frames, how many page faults would occur for the LRU page replacement algorithm?
Consider the following page reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6 How many page faults would occur for the following replacement algorithms, assuming one, two, three, or even four frames? Remember that all frames are initially empty, so your first unique pages will all cost one fault each.
Consider the following page referance string:4,2,2,4,6,4,1,2,3,4,1,2,6,1,5How many page faults would occur for the Second Change (or Clock) Page replacement, assume three frames?Remember that all frames are initially empty, so your first unique pages will cost one fault each
with explanation of the solution 10. Consider the following page reference string: 3, 2, 3, 4, 2, 1, 3, 1, 2, 3, 4, 3, 2, 1, 3 How many page faults would occur for the least recently used (LRU) algorithm, assuming three frames?
Consider the following page reference string: 7, 2, 3, 1, 2, 5, 3, 4, 6, 7, 7, 1, 0, 5, 4, 6, 2, 3, 0, 1. Assuming pure demand paging with three frames (3 pages can be in memory at a time). a)Using FIFO replacement algorithm, show the content of the memory (which pages are in memory) for each page reference. b) How many page faults resulted from this algorithm? c) Repeat a) and b)above with LRU algorithm.
Consider the following reference string: 1 2 3 4 2 1 5 6 2 1 2 3 7 6 3 2 1 2 3 6. How many page faults would occur for the following replacement algorithms assuming (a) 3 frames, (b) 5 frames: LRU, FIFO, and Optimal.
Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, and seven frames? Remember that all frames are initially empty, so your first unique pages will cost one fault each. · LRU replacement· FIFO replacement· Optimal replacement
Consider page reference string of 1 2 3 0 5 0 1 2 1 4 5 0 7 1 2 Using the first in first out (FIFO) page replacement algorithm, draw THREE (3) page frames (3 pages can be in memory at a time during process) for the above-mentioned page reference string. b Calculate the hit rate and fault rate for your answer.
Consider the following page address stream: 2 1 4 3 5 3 2 4 5 2 1 2 4 3 1 Which of the following causes the most page faults to occur on a machine with 3 frames? Scheme that causes the most faults: a) First in First out b) LRU and FIFO are the same number of faults c) FIFO and Opitimal are the same number of faults d) All have the same number of faults e) Least Recently Used f) No faults occurs g) LRU and Optimal are the same number of faults h) Optimal NUMBER OF FAULTS CAUSED: a)
Consider the following page reference string: 3,1,3,6,7,5,1,4,5,6,2,2,6,2,2,7,4,5,1,7,2 Assuming demand paging with three frames, how many page faults would occur for the following replacement algorithms? Show procedure Optimal replacement