Question

Paging Questions 1. A page is 1 KB in size. How many bits are required to...

Paging Questions

1. A page is 1 KB in size. How many bits are required to store the page offset?

2. A page entry has 10 bits. What is the size of the page table?

3. A logical address is 32 bits long. The page size is 4 KB. Divide the address into its page number and offset.

4. The following hexadecimal addresses are used in a system with a 20-bit logical address where the page size is 256 bytes. What are the values of the page number and offset for each address? • 0x10fba • 0xabc28 5. Convert the following logical addresses (provided in hexadecimal) to their appropriate physical addresses using the provided page table. Assume logical addresses are 20 bits long with 12 bits for the page entry and 8 bits for the offset. List your answers in hexadecimal.

• 0x01127

• 0x019aa

• 0x03911

• 0x13dad

Entry Number(decimal) Page Frame(decimal)

0 99

... ....

17 320

... ...

25 24

... ...

45 425

.. ...

57 331

.. ...

300 57

... ...

317 200

.. ..

57 331

0 0
Add a comment Improve this question Transcribed image text
Answer #1

1.

Given,

Page size = 1 KB

Number of bits to store the offset = log ( 1 KB ) = 10 bits.

2.

Size of page entry = 10 bits

Since number of pages or logical address is not given,

Size of the page table = ( Number of pages x 10 ) / 8 Bytes.

3.

Logical address = 32 bits

Page size = 4 KB.

Number of bits to represent offset = log ( 4 KB ) = 12 bits

Number of bits used to represent the page number = Bits in Logical address - Number of bits to represent offset

= 32 - 12 = 20 bits

4.

Logical address = 20 bits

Page size = 256 Bytes

Number of bits to represent offset = log ( 256 B ) = 8 bits

Number of bits used to represent the page number = Bits in Logical address - Number of bits to represent offset

= 20 - 8 = 12 bits

So, the first 12 bits from the right of the logical address represent the page number and the next 8 bits represent the offset.

i. Logical address = 0x10fba = 00010000111110111010

Page number = 000100001111 = ( 271 )10.

Offset = 10111010 = ( 186 )10.

ii. Logical address = 0xabc28 = 10101011110000101000

Page number = 101010111100= ( 2748 )10.

Offset = 10111010 = ( 40 )10.

5.

Given,

Logical address = 20 bits

Offset = 8 bits

Bits to represent page number = 12 bits.

Page table entry = 12 bits.

Entry Page Frame
0 99
17 320
25 24
45 425
57 331
300 57
317 200
57 331

i.

Logical address = 0x01127 = 00000001000100100111

Page number = 000000010001 = 17

Offset = 00100111

So, the page 17 maps to frame 320. =  101000000

Physical address = ( Frame Number ( ( Offset ) = 00010100000000100111 = 0x14027.

ii.

Logical address = 0x019aa = 00000001100110101010

Page number = 000000011001 = 25

Offset = 10101010

So, the page 25 maps to frame 24 = 000000011000

Offset = 10101010

Physical address = 00000001100010101010 = 0x18aa.

iii.

Logical address = 0x03911= 00000011100100010001

Page number = 000000111001= 57

Offset = 00010001

So, the page 57 maps to frame 331 = 000101001011

Offset = 00010001

Physical address = 00010100101100010001 = 0x14b11.

iv.

Logical address = 0x13dad= 00010011110110101101

Page number = 000100111101= 317

Offset = 10101101

So, the page 317 maps to frame 200 = 000011001000

Offset = 00010001

Physical address = 00001100100000010001 = 0xc811.

Add a comment
Know the answer?
Add Answer to:
Paging Questions 1. A page is 1 KB in size. How many bits are required to...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 6) Paging [26 pts] Suppose you have a computer system with a 38-bit logical address, page size of 16K, and 4 bytes per...

    6) Paging [26 pts] Suppose you have a computer system with a 38-bit logical address, page size of 16K, and 4 bytes per page table entry a) How many pages are there in the logical address space? Suppose we use two level paging and each page table can fit completely in a frame. [4 pts] How many pages? [2 pts] Show your calculations here: b) For the above-mentioned system, give the breakup of logical address bits clearly indicating number of...

  • 1. Consider a simple paging system with the following parameters: 232 bytes of physical memory; page...

    1. Consider a simple paging system with the following parameters: 232 bytes of physical memory; page size of 210 bytes; 216 pages of logical address space. How many bits are in a logical address? How many bytes are in a frame! How many bits in the physical address specify the frame? How many entries are in the page table? How many bits are in each page table entry? Assume each page table entry contains a valid/invalid bit. 2. Consider a...

  • A simple paging system has a memory size of 256 bytes and a page size of...

    A simple paging system has a memory size of 256 bytes and a page size of 16 bytes. i. What is the size of the page table? ii. How many bits exist for an address, assuming 1-byte incremental addressing? iii. State p and d values (i.e. the page number and the offset). iv. Perform address translation of 64 bytes to physical address space using the page table below. 0 8 1 6 2 3 3 11 4 7

  • A simple paging system has a memory size of 256 bytes and a page size of...

    A simple paging system has a memory size of 256 bytes and a page size of 16 bytes. i. What is the size of the page table? ii. How many bits exist for an address, assuming 1-byte incremental addressing? iii. State p and d values (i.e. the page number and the offset). iv. Perform address translation of 64 bytes to physical address space using the page table below. 0 8 1 6 2 3 3 11 4 7

  • Consider a simple paging system with the following parameters: 232 bytes of physical memory; page size...

    Consider a simple paging system with the following parameters: 232 bytes of physical memory; page size of 210 bytes; 216 pages of logical address space. How many entries in the page table? How many bits in each page table entry? Assume each page table entry contains a valid/invalid bit.

  • paging Example • Consider the following page table. The page size is 8 bytes each. Page...

    paging Example • Consider the following page table. The page size is 8 bytes each. Page Frame 0 6 1 2 0 N 3 3 4 5 • What are the physical addresses for the following logical addresses? • (1,5) . (2,0) • (0,6) • (3,8)

  • Can someone clarify how I find the lenght in bits of the OFFSET given this problem....

    Can someone clarify how I find the lenght in bits of the OFFSET given this problem. The problem is solved here completely from 1to6 i just wanted a quick run down on how the numbers were obtained, how the word size, total frame size, program size and op code was used Can someome PROBLEM 1 decimal value of o codes 16 bits word size: load fetch 2 total frame size: 64 bytes. store 3 total size of program 256 words...

  • Suppose a memory manager employs paging with page size of 4 Kbytes. It has a memory...

    Suppose a memory manager employs paging with page size of 4 Kbytes. It has a memory of 256 Mbytes. A process of size 25 Kbytes needs to be loaded into memory. Answer the following. (a) How many frames are there in the memory? (b) How many bits are necessary to represent the physical address as <frame#, offset>? (c) How many frames need to be allocated to the process? Suppose a memory manager employs paging with page size of 4 Kbytes....

  • 36.-Assume a 32 bit memory space with 16[KB] pages/frames and a two-level page table. Answer the...

    36.-Assume a 32 bit memory space with 16[KB] pages/frames and a two-level page table. Answer the following questions: a).-what is the size of the page table in bytes needed for a process that has only 64[MB] of code at the start of its virtual address range? b).-how many bits are used for address (frame) offset, and how many for page table indexing (total). Assume each page table entry has 32 bits. a).-Size of page table b).-Offset bits b).-Page table indexing...

  • Consider a system with 48-bit address that supports paging AND segmentation. The page size is 8KB...

    Consider a system with 48-bit address that supports paging AND segmentation. The page size is 8KB and each page table entry (PTE) is 4B. A process can have up to 256 segments and each segment table entry (STE) is 8B. How large in bytes is the largest possible page table?

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT