1. Chapter 3. Question 4Assume a program has 510 bytes and will be loaded into page frames of256 bytes each, and the instruction to be used is at byte 377. Answer thefollowing questions:a. How many pages are needed to store the entire job?b. Compute the page number and exact displacement for each of the byteaddresses where the data is stored.2. Chapter 3. Questions 5a, 5b, 5cGiven that main memory is composed of only three page frames for public useand that a seven-page program (with Pages a, b, c, d, e, f, g) that requests pagesin the following order:a, c, a, b, a, d, a, c, b, d, e, fa. Using the FIFO page removal algorithm, indicate the movement of thepages into and out of the available page frames (called a page trace  analysis). Indicate each page fault with an asterisk (*). Then compute thefailure 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 traceanalysis and compute the failure and success ratios.c. What general statement can you make from this example? Explain youranswer.3. Chapter 3. Questions 6a, 6b, 6cGiven that main memory is composed of only three page frames for public useand that a program requests pages in the following order:a, c, b, d, a, c, e, a, c, b, d, ea. Using the FIFO page removal algorithm, indicate the movement of thepages into and out of the available page frames (called a page traceanalysis)  indicating each page fault with an asterisk (*). Then computethe 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 traceanalysis and compute the failure and success ratios.c. What general statement can you make from this example? Explain youranswer.4. Chapter 4. Questions 3a, 3b, 3cFive jobs arrive nearly simultaneously for processing and their estimated CPUcycles are, respectively: Job A = 12, Job B = 2, Job C = 15, Job D = 7, andJob E = 3 ms.a. Using FCFS, and assuming the difference in arrival time is negligible, inwhat order would they be processed? What is the total time required toprocess 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, inwhat order would they be processed? What is the total time requiredto  process all five jobs? What is the average turnaround time for allfive jobs?5. Chapter 4. Question 7Using SJN, calculate the start time and finish time for each of these seven jobs:Job       Arrival Time    CPU CycleA         0          2B         1          11C         2          4D         4          1E          5          9F          7          4G         8          2

Do you need a similar assignment done for you from scratch? We have qualified writers to help you. We assure you an A+ quality paper that is free from plagiarism. Order now for an Amazing Discount!
Use Discount Code "Newclient" for a 15% Discount!

NB: We do not resell papers. Upon ordering, we do an original paper exclusively for you.