HomeworkLib
Question

Help on Main memory page number and offsets Will rate high

1.Chapter 8, Assuming a 1-KB page size, what are the page numbers andoffsets for thefollowing address references (provided as decimalnumbers):

a.2375

b.19366

c.30000

d.256

e.16385

engineering   computer science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1
Dear,Given 1KB-page size, For the given addressreferences the page number and the offset is as follows,For, example for a 20-bit address in asystem that uses 1K pages, the lower order 10 bits of address arethe offset and thehigher order bits are used to reference the pagenumber.a. 2375page = 1; offset = 327

b.19366

page =18; offset = 934

c. 30000
page = 29;offset = 304d. 256
page = 0;offset = 256e. 16385
page = 16;offset = 1I hope this will help you.
answered by: swetha
1 0
Add a comment
Know the answer?
Add Answer to:
Help on Main memory page number and offsets Will rate high
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

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

  • Assuming a 1-KB page size, what are the page numbers and offsets for the following address...

    Assuming a 1-KB page size, what are the page numbers and offsets for the following address references (provided as decimal numbers)? a. 21205 b. 164250 c. 121357 d. 16479315 e. 27253187

  • Assuming a 1-KB page size, what are the page numbers and offsets for the following address references (provided as decimal numbers)

    Assuming a 1-KB page size, what are the page numbers and offsets for the following address references (provided as decimal numbers)? a. 21205 b. 164250 c. 121357

  • OPERATING SYSTEMS 1. Given six memory partitions of 100 MB, 170 MB, 40 MB, 205 MB,...

    OPERATING SYSTEMS 1. Given six memory partitions of 100 MB, 170 MB, 40 MB, 205 MB, 300 MB, and 185 MB (in order), how would the first‐fit, best‐fit, and worst‐fit algorithms place processes of size 200 MB, 15 MB, 185 MB, 75 MB, 175 MB, and 80 MB (in order)? Indicate which, if any, requests cannot be satisfied. Comment on how efficiently each of the algorithms manages memory in terms of fragmentation. 2. Consider a logical address space of 64...

  • 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

  • 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....

  • Assuming a 1K page size, what are the page numbers and offsets for the following addresses:...

    Assuming a 1K page size, what are the page numbers and offsets for the following addresses: 215201 42095 SHOW the number of page faults generated by the following sequence of page references using the FIFO and LRU replacement strategies if a process has 3 frames7, 4, 3, 2, 4, 0, 5, 7, 2, 4, 2, 7, 4, 3, 1, 5, 0

  • 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....

  • Problem #1 (25 points) Address Space, Memory Consider a hypothetical 18-bit processor called HYP18 with all...

    Problem #1 (25 points) Address Space, Memory Consider a hypothetical 18-bit processor called HYP18 with all registers, including PC and SP, being 18 bits long. The smallest addressable unit in memory is an 8-bit byte. A. (4 points) What is the size of HYP18's address space in bytes and KB? How many address lines does HYP18 require? Address space: Bytes Address space: KB (KiloBytes). Address bus lines: B. (6 points) Assume that first quarter of the address space is dedicated...

  • Assume that the following section of main memory is used to store the page table for...

    Assume that the following section of main memory is used to store the page table for 3 different processes. The page-table base register values for process P1 is 1080, for P2 is 1085, and for P3 is 1090. Assume that the contests of memory below correspond to frame numbers. Also assume that frame size is 4096 contents 3584720 15 11 18 6 20 24 910 13 30 38 40 1 addresses 0 0 0 0 0 O 000 0 00...

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