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?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Follow-up Questions

Read through expert solutions to related follow-up questions below.

Follow-up Question

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

Solution

by Bartleby Expert

SEE SOLUTION

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions