Reference no: EM13751356

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. Chapter 3. Questions 5a, 5b, 5c  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. Chapter 3. Questions 6a, 6b, 6c  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. Chapter 4. Questions 3a, 3b, 3c 

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 

G 8 2