Question 3 We use fixed partitioning for a main memory (M) of size 1GİB. Each same sized partition is of the same size 256KİB. The machine is a 32-bit architecture. 1. How many partitions do we have for M? 2. A logical address is thus split into a partition number and partition offset within that partition. How many bit for the partition number ? 3. A logical address is thus split into a partition number and partition offset within that partition. How many bit for the partition offset ? 4. We store the information related to the partitions in a table PaT. PaT has one entry per partition. Thus PaT[i] shows the PID of the process occupying that partition. PID are linux PIDS and we provided some information about them in Subject 3 when we discussed the Process List. A PID consists of a number of bit that is a power of two multiple of the number of bit of a byte i.e. 8bit, 16bit, 32bit, etc. What is the length of the PaT table/array ? 5. We store the information related to the partitions in a table PaT. PaT has one entry per partition. Thus PaT[ i] shows the PID of the process occupying that partition. PID are linux PIDS and we provided some information about them in Subject 3 when we discussed the Process List. A PID consists of a number of bit that is a power of two multiple of the of bit bit of a byte i.e. 8bit, 16bit, 32bit, etc. What's the size of the PaT table/array?
3.
![Question 3
We use fixed partitioning for a main memory (M) of size 1GİB. Each same sized partition is of the
same size 256KIB. The machine is a 32-bit architecture.
1. How many partitions do we have for M?|
2. A logical address is thus split into a partition number and partition offset within that partition.
How many bit for the partition number ?
3. A logical address is thus split into a partition number and partition offset within that partition.
How many bit for the partition offset ?
4. We store the information related to the partitions in a table PaT. PaT has one entry per partition.
Thus PaT[i] shows the PID of the process occupying that partition. PID are linux PIDS and we
provided some information about them in Subject 3 when we discussed the Process List. A PID
consists of a number of bit that is a power of two multiple of the number of bit of a byte i.e. 8bit,
16bit, 32bit, etc. What is the length of the PaT table/array ?
5. We store the information related to the partitions in a table PaT. PaT has one entry per partition.
Thus PaT[ i] shows the PID of the process occupying that partition. PID are linux PIDS and we
provided some information about them in Subject 3 when we discussed the Process List. A PID
consists of a number of bit that is a power of two multiple of the of bit bit of a byte i.e. 8bit, 16bit,
32bit, etc. What's the size of the PaT table/array?](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Faf4af336-0fbd-4b86-ad58-139fa69a7ad6%2F5a97ba30-3cac-49a6-ab4c-cff585c20fbf%2Fwxwpuq_processed.jpeg&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
We use fixed partitioning for a main memory (M) of size 1GiB. Each same sized partition is of the same size 256KiB. The machine is a 32-bit architecture.
1. How many partitions do we have for M?
2. A logical address is thus split into a partition number and partition offset within that partition. How many bit for the partition number ?
3. A logical address is thus split into a partition number and partition offset within that partition. How many bit for the partition offset ?
4. We store the information related to the partitions in a table PaT. PaT has one entry per partition. Thus PaT[ i ] shows the PID of the process occupying that partition. PID are linux PIDs and we provided some information about them in Subject 3 when we discussed the Process List. A PID consists of a number of bit that is a power of two multiple of the number of bit of a byte i.e. 8bit, 16bit, 32bit, etc. What is the length of the PaT table/array ?
5. We store the information related to the partitions in a table PaT. PaT has one entry per partition. Thus PaT[ i ] shows the PID of the process occupying that partition. PID are linux PIDs and we provided some information about them in Subject 3 when we discussed the Process List. A PID consists of a number of bit that is a power of two multiple of the of bit bit of a byte i.e. 8bit, 16bit, 32bit, etc. What's the size of the PaT table/array?
answer like
1 is
2 is
3 is
4is
by Bartleby Expert
