- Explain the function of the page map table in the memory allocation schemes. Explain your answer with examples from the schemes that use a PMT.
- If a program has 471 bytes and will be loaded into page frames of 100 bytes each, and the instruction to be used is at byte 132, answer the following questions:
- How many pages are needed to store the entire job?
- Compute the page number and the exact displacement for each of the byte addresses where the data is stored. (Remember that page numbering starts at zero.)
- Using the information below, compute the turnaround time for every job for each of the following scheduling algorithms (ignore context switching overhead times). It may help to draw the timeline.
| Job | Arrival time | CPU Cycle |
| A | 0 | 15 |
| B | 2 | 2 |
| C | 3 | 14 |
| D | 6 | 10 |
| E | 9 | 1 |
- FCFS
- SJN
- SRT
- Round Robin (using a time quantum of 5)
Order an Essay Now & Get These Homework Help Features For Free:
Turnitin Report
Formatting
Title Page
Citation
Outline
