(Solved): (a) With memon albcation block diagram, briefly explain how all the processes in table I get allocat ...
(a) With memon albcation block diagram, briefly explain how all the processes in table I get allocated assuming all the processes have arrived. The memory block has a slie of 8000 KB with an operating system space of 4830 KB . Also, state the there (3) last processes (ith-order) that will exit the job queue (state your reason(s) and show workings) (10marks) Table 1 \table[[Process,Mentory (KB),Exciution Time (ABY)],[PI,800,H],[P2,1200,06],[
P_(3),500,21],[P4,900,09],[P5,750,15]] (b) Brictly explain the following terms (i) swapping (ii) frogmentation (iii) segmentation (iv) virual memory (10marks) 8. (a) Use Table 2 to show the Gantt chart of the processes and compute the (i) average fum-around-time, (ii) ascrage waiting time. (iii) the throughput (iv) the average waiting time and (v) the response time considering if as a nonpreemptive algorithm. What is the difference between premptive and non-premptive algorithm? (T 4 marks) isble 2 \table[[Pricess,\table[[Arrival],[Time]],\table[[Execution],[Time],[(ms)]]],[P1,0,05],[P2,1,03],[P3,2,08],[P1,3,06]] (b) A computer installation has 1000 KB of main memory. The jobs amived and finished in the following sequences: Jobl requiring 200 KB arrives
f_(0b)2requiring 350 KB arrives Job3 requiring 300 KB arrives Jobl finishes Job4 requiring 120 KB amives Job5 nequiring 150KB arrives Jobe requiring 80 KB arrives (i) Draw the memory aflocation table using best fit and first fit algorithms (ii) Which algoritim performs better for this sequence (6marks)
