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

1- How many bits are in a logical address?

2 How many bytes in frame?

3- How many bits in the physical address specify the frame?

4- How many entries in the page table?

5- How many bits in each page table entry? Assume each page table entry contains a valid/invalid bit.

-----------------------------------------------

part 2: Consider a computer system using segmentation to manage memory. Suppose the virtual address contains (12 bits) for segment number and (10 bits) for the offset, and suppose the segment table for some process (call it process A) looks like the following.

Segment number	Present/absent bit	Segment base	Length
0	1	0xC1230	0x2F1
1	1	0x2D4F	0X2F
2	1	0x1B491	0x21E
3	0	?	?
4	0	?	?
5	1	0x547A	0x29D

1- What maximum size could the segment be?

2- What memory locations would correspond to the following virtual (program) addresses for process A? (The addresses will be given in hexadecimal, i.e., base 16). Your answers should also be in hexadecimal.

i) 0x15F4

ii) 0x42F

iii) 0xE03

iv) 0x2C7