For the following problems assume 1 kilobyte (KB) 1024 kilobytes 1024 bytes and 1 megabyte (MB) For this problem, assume you have address translation hardware with the following properties: 1 Virtual addresses, physical addresses, and page table entries are 32 bits wide. The page size in the system is 4 KB A virtual address is a page number followed by a byte offset within the page. (a) How many bits of the virtual address must be used for the offset, so that every byte in the page can have a unique address? (b) How many bits are left over in the virtual address to store the page number? (c) How many different page numbers does an address space in this system support? (You can express this as a power of two) (d) If a page table consists of a page table entry for each page number in an address space, how much space in MB would the page table take up if it were stored in physical memory? 2 Given the assumptions above and the page table below, translate the following virtual addresses (expressed as base ten integers) to physical addresses (also base ten integers). If the corresponding page is not resident in memory (NR), indicate a page fault Hint: rather than translating these values to binary or hexadecimal, you can use the following formulas pageNum = |virtualAddress/pageSize] where [x] is x rounded down to the nearest integer offset virtualAddress mod pageSize where x mody is the remainder after dividing x by y physicalAddress frameNum x pageSize + offset. Show your work (a) VA 0 (b) VA 4095 Page Frame # 0 (c) VA 4096 NR 1 (d) VA 10000 2 0 2 (e) VA 20000 NR (f) VA 30000 NR 6 1 7 NR LO
For the following problems assume 1 kilobyte (KB) 1024 kilobytes 1024 bytes and 1 megabyte (MB) For this problem, assume you have address translation hardware with the following properties: 1 Virtual addresses, physical addresses, and page table entries are 32 bits wide. The page size in the system is 4 KB A virtual address is a page number followed by a byte offset within the page. (a) How many bits of the virtual address must be used for the offset, so that every byte in the page can have a unique address? (b) How many bits are left over in the virtual address to store the page number? (c) How many different page numbers does an address space in this system support? (You can express this as a power of two) (d) If a page table consists of a page table entry for each page number in an address space, how much space in MB would the page table take up if it were stored in physical memory? 2 Given the assumptions above and the page table below, translate the following virtual addresses (expressed as base ten integers) to physical addresses (also base ten integers). If the corresponding page is not resident in memory (NR), indicate a page fault Hint: rather than translating these values to binary or hexadecimal, you can use the following formulas pageNum = |virtualAddress/pageSize] where [x] is x rounded down to the nearest integer offset virtualAddress mod pageSize where x mody is the remainder after dividing x by y physicalAddress frameNum x pageSize + offset. Show your work (a) VA 0 (b) VA 4095 Page Frame # 0 (c) VA 4096 NR 1 (d) VA 10000 2 0 2 (e) VA 20000 NR (f) VA 30000 NR 6 1 7 NR LO
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
Related questions
Question
I need an answer to question no. 2
![For the following problems assume 1 kilobyte (KB)
1024 kilobytes
1024 bytes and 1 megabyte (MB)
For this problem, assume you have address translation hardware with the following
properties:
1
Virtual addresses, physical addresses, and page table entries are 32 bits wide.
The page size in the system is 4 KB
A virtual address is a page number followed by a byte offset within the page.
(a)
How many bits of the virtual address must be used for the offset, so that every
byte in the page can have a unique address?
(b)
How many bits are left over in the virtual address to store the page number?
(c)
How many different page numbers does an address space in this system
support? (You can express this as a power of two)
(d)
If a page table consists of a page table entry for each page number in an address
space, how much space in MB would the page table take up if it were stored in
physical memory?
2
Given the assumptions above and the page table below, translate the following virtual
addresses (expressed as base ten integers) to physical addresses (also base ten
integers). If the corresponding page is not resident in memory (NR), indicate a page
fault
Hint: rather than translating these values to binary or hexadecimal, you can use the
following formulas
pageNum = |virtualAddress/pageSize] where [x] is x rounded down to the
nearest integer
offset virtualAddress mod pageSize where x mody is the remainder after
dividing x by y
physicalAddress frameNum x pageSize + offset.
Show your work](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fc80d3abf-0cce-4bf5-b638-3a4bef85515f%2F04b0b13c-f1f6-42d4-b6d8-eb626736a4f7%2Fo6mkggq.png&w=3840&q=75)
Transcribed Image Text:For the following problems assume 1 kilobyte (KB)
1024 kilobytes
1024 bytes and 1 megabyte (MB)
For this problem, assume you have address translation hardware with the following
properties:
1
Virtual addresses, physical addresses, and page table entries are 32 bits wide.
The page size in the system is 4 KB
A virtual address is a page number followed by a byte offset within the page.
(a)
How many bits of the virtual address must be used for the offset, so that every
byte in the page can have a unique address?
(b)
How many bits are left over in the virtual address to store the page number?
(c)
How many different page numbers does an address space in this system
support? (You can express this as a power of two)
(d)
If a page table consists of a page table entry for each page number in an address
space, how much space in MB would the page table take up if it were stored in
physical memory?
2
Given the assumptions above and the page table below, translate the following virtual
addresses (expressed as base ten integers) to physical addresses (also base ten
integers). If the corresponding page is not resident in memory (NR), indicate a page
fault
Hint: rather than translating these values to binary or hexadecimal, you can use the
following formulas
pageNum = |virtualAddress/pageSize] where [x] is x rounded down to the
nearest integer
offset virtualAddress mod pageSize where x mody is the remainder after
dividing x by y
physicalAddress frameNum x pageSize + offset.
Show your work
Transcribed Image Text:(a) VA 0
(b) VA 4095
Page
Frame #
0
(c) VA 4096
NR
1
(d) VA 10000
2
0
2
(e) VA 20000
NR
(f) VA 30000
NR
6
1
7
NR
LO
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education