Assume you have memory partitions of sizes 100 KB, 500 KB, 2…

Assume you have memory partitions of sizes 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB (in order). You want to allocate processes of sizes 212 KB, 417 KB, 112 KB, and 426 KB using First Fit. Show the allocation process and indicate (briefly discuss) whether external fragmentation occurs.

CPU Scheduling: Consider this set of processes. Construct Ga…

CPU Scheduling: Consider this set of processes. Construct Gantt charts for the scheduling algorithms indicated below and compute average waiting time and average turn around time for each algorithm  Table Process Arrival Time Burst Time P1 0 5 P2 1 3 P3 2 8 P4 3 6   FCFS: Draw the Gantt Chart (4 points), and compute (FCFS) show all your work Per process and Average Turnaround Time (TT) (3 points) Per process and Average Waiting Time (WT) (3 points) Use the same processes as above, but now use Round Robin with a time quantum = 4. RR: Draw the Gantt Chart (5 points) , and compute: show all your work Per process and Average Turnaround Time (TT) (4 points) Per process and Average Waiting Time (WT) (4 points)