How many pages are needed to store the entire job

Assignment Help Operating System
Reference no: EM13750673

1. Assume a program has 510 bytes and will be loaded into page frames of 256 bytes each, and the instruction to be used is at byte 377. Answer the following questions:

 a. How many pages are needed to store the entire job?

 b. Compute the page number and exact displacement for each of the byte addresses where the data is stored.

2. Given that main memory is composed of only three page frames for public use and that a seven-page program (with Pages a, b, c, d, e, f, g) that requests pages in the following order:

a, c, a, b, a, d, a, c, b, d, e, f

a. Using the FIFO page removal algorithm, indicate the movement of the pages into and out of the available page frames (called a page trace  analysis). Indicate each page fault with an asterisk (*). Then compute the failure and success ratios.

 b. Increase the size of memory so it contains four page frames for public use. Using the same page requests as above and FIFO, do another page trace analysis and compute the failure and success ratios.

c. What general statement can you make from this example? Explain your answer.

3. Given that main memory is composed of only three page frames for public use and that a program requests pages in the following order:

a, c, b, d, a, c, e, a, c, b, d, e

a. Using the FIFO page removal algorithm, indicate the movement of the pages into and out of the available page frames (called a page trace analysis)  indicating each page fault with an asterisk (*). Then compute the failure and success ratios.

b. Increase the size of memory so it contains four page frames for public use. Using the same page requests as above and FIFO, do another page trace analysis and compute the failure and success ratios.

c. What general statement can you make from this example? Explain your answer.

4. Five jobs arrive nearly simultaneously for processing and their estimated CPU cycles are, respectively: Job A = 12, Job B = 2, Job C = 15, Job D = 7, and Job E = 3 ms.

a. Using FCFS, and assuming the difference in arrival time is negligible, in what order would they be processed? What is the total time required to process all five jobs? What is the average turnaround time for all five jobs?

b. Using SJN, and assuming the difference in arrival time is negligible, in what order would they be processed? What is the total time required to  process all five jobs? What is the average turnaround time for all five jobs?

5. Using SJN, calculate the start time and finish time for each of these seven jobs:

Job       Arrival Time    CPU Cycle

A         0          2

B         1          11

C         2          4

D         4          1

E          5          9

F          7          4

Reference no: EM13750673

Questions Cloud

How could the cyber attack be dettered : A recent malicious cyber attack that cyber deterrence was used . Pre-Emp Deterence CNE Cyber attacks. How could the Cyber Attack be dettered
Describe and explain how one leadership model : Describe and explain how one leadership model (a model deemed valid by today's research standards, as discussed in the module material) relates to the most important performance outcomes with regard to teams.
Discuss the legal environment : As part of your first consulting assignment, you have been asked to research and write a short case study (three pages) in which you discuss the legal environment (i.e., policies, regulations, and laws)
Designed to maximize team efficiency and performance : This week's materials emphasize the complexity surrounding processes designed to maximize team efficiency and performance. For your initial post to this discussion forum, begin by describing how the impact of conflict on teams may be "good, bad, o..
How many pages are needed to store the entire job : Assume a program has 510 bytes and will be loaded into page frames of 256 bytes each, and the instruction to be used is at byte 377. How many pages are needed to store the entire job
Compare tony horwitzs version of the civil war : Compare their version of the Civil War to the story D.W. Griffith tells in The Birth of a Nation and make an argument about how the memory of the war has been used to imagine and construct ideas about race.
Analyze project management processes : Analyze project management processes for scheduling and sequencing work components. Analyze quality assurance processes in project management.
Clean opinion on the financial statements : Who are the firm's auditors? Do they provide a clean opinion on the financial statements? Have there been any subsequent events, errors and irregularities, illegal acts, or related-party transactions that have a material effect on the financial sta..
How a manager with integrity can help a team : Provide a 1-page reflection paper on why you feel integrity is an important value for a manager to have. Give an example of how a manager with integrity can help a team. Identify any issues that may occur if a manager lacks integrity.

Reviews

Write a Review

Operating System Questions & Answers

  Implementation of algorithms for process management

The Shortest Job Next (SJN) algorithm queues processes in a way that the ones that use the shortest CPU cycle will be selected for running rst.

  Develop a user mode command interpreter

Develop a user mode command interpreter which support list-short.

  Memory allocation in operating system

Analysis and implementation of algorithms for memory allocation in operating system, Explain First- t and best- t methods are used in memory allocation in operating systems.

  Stand alone child process

Forking the child process

  Write a multi-threaded program

Write a multi-threaded program to solve producer and consumer problem

  Marginal and average cost curves

n a competitive market place (pure competition) is it possible to continually sell your product at a price above the average cost of production.

  Simulating operating systems scheduling

Simulate the long-term scheduler, the short-term scheduler and the I/O scheduler of the computer using the First-Come-First-Serve algorithm.

  Issues with trusted platform module

Research paper discussing the issues with Trusted Platform Module (TPM)

  Threads

Explain a complication that concurrent processing adds to an operating system.

  Design and programming

Use the semaphore methods to control the concurrency of the solution

  Virtual machines

Virtual machines supported by a host operating system

  Discuss an application that benefits barrier synchronization

Discuss an application that would benefit from the use of barrier synchronization

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd