Question

QUESTION 18 4 points Save Answer A paging system, with 20-bit addressing uses 512 bytes for the page size. How many pages are

Which option is correct answer?

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

Q18.

Page size = 512 -> Page Offset = log 512 = 9 bits

So page number bits = 20( memory bits) - 9 = 11 bits

So total # of pages = 2^11 = 2048.

So the correct answer is 2048. Option (c)

Q19.

Page size = 512 bits -> Page offset = log 512 = 9 bits.

Page # bits = 16 - 9 = 7 bits.

A01F = 1010 0000 0001 1111

Page number = 101 0000=80

Page offset = 000011111 = 31

Option (c) is correct option.

If you have any questions comment down and please upvote??

Add a comment
Know the answer?
Add Answer to:
Which option is correct answer? QUESTION 18 4 points Save Answer A paging system, with 20-bit...
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
  • 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

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

  • page addressing (a) The following are virtual 16 Considered bit-addresses, with the upper 8th Bit the...

    page addressing (a) The following are virtual 16 Considered bit-addresses, with the upper 8th Bit the number of the page and the lower one 8th Bit represent the offset. The physical memory included in this example 256 Page frames ( frames ) to each 256 Bytes per page, ie physical addresses from 0x0000 to 0xFFFF, where frame 0 at 0x0000 starts. Given the following page table for a process that 10 Pages (page numbers 0 - 9), some of which...

  • II. (a) An OS is using two-level paging to implement a 28-bit virtual address space per...

    II. (a) An OS is using two-level paging to implement a 28-bit virtual address space per process. The page size is 256-bytes, and the machine does not have a TLB. Explain the steps involved in looking up the virtual address 0x03bf04d, when all pages are present in memory. (2 points) (b) For the system above, what is the maximum number of page faults that could be generated in response to a memory access? (2 points)

  • A 16 bit logical address is split into 5 bit page number and 11 bit page...

    A 16 bit logical address is split into 5 bit page number and 11 bit page offset. Answer the following questions in the space provided: a) The page size is ____ bytes b) The page table size is ____ c) if the page table is as shown below, then the corresponding physical address for 0x174F is given by: ____. Question 29 (3 points) Saved A 16 bit logical address is split into 5 bit page number and 11 bit page...

  • Consider the page table shown below for a system with 16-bit virtual and physical addresses and...

    Consider the page table shown below for a system with 16-bit virtual and physical addresses and with 4096-byte pages. All numbers below are given in hexadecimal. (A dash for a page frame indicates that the page is not in memory.) Page Number Physical Frame Number 0 - 1 2 2 C 3 A 4 - 5 4 6 3 7 - 8 B 9 0 How many bits are in the offset part of the address? How many hex digits...

  • Exercise 5 (2.5 points) Assume a memory management system built on paging, its physical memory has...

    Exercise 5 (2.5 points) Assume a memory management system built on paging, its physical memory has the total size of 4 GB. It placed over 16 KB pages. The limit of the logical address space for each process is 512 MB. 1. What is the total number of bits in the physical address? 2. What is the number of bits that specifies the page displacement? 3. Determine how many physical frames in the system. Explain the layout for the logical...

  • 3. Virtual Memory (20 points) An ISA supports an 8 bit, byte-addressable virtual address space. The...

    3. Virtual Memory (20 points) An ISA supports an 8 bit, byte-addressable virtual address space. The corresponding physical memory has only 256 bytes. Each page contains 32 bytes. A simple, one-level translation scheme is used and the page table resides in physical memory. The initial contents of the frames of physical memory are shown below. VALUE address size 8 bit byte addressable each byte of addressing type memory has its own address 32 B page size physical memory size 256...

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

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