Scribd
Upload
5 views2 pages

Chapter 5 Problems

The document contains a series of problems related to memory allocation and address translation in computer systems. It includes calculations for physical addresses based on base and limit registers, paging systems, and segment tables. Each problem requires the application of concepts such as page size, logical addresses, and segment offsets to derive the required physical addresses.

Uploaded by

colonvu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views2 pages

Chapter 5 Problems

The document contains a series of problems related to memory allocation and address translation in computer systems. It includes calculations for physical addresses based on base and limit registers, paging systems, and segment tables. Each problem requires the application of concepts such as page size, logical addresses, and segment offsets to derive the required physical addresses.

Uploaded by

colonvu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Chapter 5 Problems

PORBLEM 1
Given a contiguous memory allocation system, suppose a process has the base and limit registers with
the corresponding values of (18680, 1260). Calculate the physical address of the following references:

12, -26, 678, 1272

PORBLEM 2
Suppose the page size is 1KB in a (1-level) paging system. A proces has the size of 157 KB, calculate
(page, offset) of the following logical address: 78, 1346, 8184, 126868, 183242

PORBLEM 3
Given the page table of a process (16, 92, 3, 87). Suppose the page size is 1KB in a (1-level) paging
system, calculate the physical address of the following reference: 124, 8672, 3246, 4782,

PORBLEM 4
Given a paging system with the page size of 2KB in a (1-level) paging system. The address register is 32
bit. Identify the number of bits for (page, offset) in the address register.

PORBLEM 5
Given a paging system with the page size of 4KB in a (1-level) paging system. The address register is 42
bit. Identify the number of bits for (page, offset) in the address register.

PORBLEM 6
Given the page table of a process in the form of (frame, valid) [(16, v), (92, i), (3, v), (87, v)] in a (1-level)
paging system. Suppose the page size is 1KB, calculate the physical address of the following reference:
124, 8672, 3246, 4782,

PORBLEM 7
Given the page table containing the page-frame mapping [16, 92, 3, 87, 723]. Suppose the page size is
1KB in a (1-level) paging system, calculate the physical address of the following reference: 124, 8672,
3246, 4782,
PORBLEM 8
Given the segment table of a process in the form of (base, limit) [(16000, 1200), (18000, 4700), (28900,
200)]. Calculate the physical address of the following reference in the form of (segment, offset): (0, 868),
(0, 124), (1, 900), (2, 86)

PORBLEM 9
Given the segment table of a process in the form of (base, limit, valid) [(16000, 1200, v), (18000, 4700, i),
(28900, 2100, v)]. Calculate the physical address of the following reference in the form of (segment,
offset): (0, 868), (0, 124), (1, 900), (2, 86)

You might also like