The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 103 Weeks Ago, 3 Days Ago |
| Questions Answered: | 4870 |
| Tutorials Posted: | 4863 |
MBA IT, Mater in Science and Technology
Devry
Jul-1996 - Jul-2000
Professor
Devry University
Mar-2010 - Oct-2016
I have attached a file with 4 questions. Any help would be appreciated. Thanks!
Â
READ THE PROBLEM STATEMENTS CAREFULLY.Problem 1:ProcessArrival TimeBurst TimeP102P211P324P432P541Consider a set of processes given above with the arrival time and the length of CPU burst timegiven in cycles. Show a Gantt chart and calculations of average turnaround time and averagewaiting time of these processes under the shortest job first (SJF)withpreemption CPUscheduling algorithm and the round-robin scheduling algorithm with a time quantum of 1 cycle.(10 points)Problem 2:Assume that the OS is using a memory paging method, memory pages are1024words long, instructions are8-wordlong, and each address in memory accesses only one word.A page table for a particular process is given below:Page Number Frame Number0710223441Calculate a starting physical memory address for each of the following instructions. If theaddress cannot be calculated using the page table and the given info, say why not.(5 points)oinstruction #52oinstruction #369oinstruction #512oinstruction #612oinstruction #640Problem 3:From a given reference string below, show a snapshot of physical memory framesafter each memory page is accessed under the OPT and LRU page replacement policies then
Attachments:
-----------