Dale - Computer Science Illuminated 373

Dale - Computer Science Illuminated 373 - dynamic show...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
346 Chapter 10 Operating Systems 41. Draw a Gantt chart that shows the completion times for each process using first-come, first-served CPU scheduling. 42. Draw a Gantt chart that shows the completion times for each process using shortest-job-next CPU scheduling. 43. Draw a Gantt chart that shows the completion times for each process using round-robin CPU scheduling with a time slice of 60. 44. Given the following state of memory where the partitions are
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: dynamic, show memory after using each of the following partition selection approaches after a new job requiring 66 blocks of main memory. a. first fit b. best fit c. worst fit 45. Distinguish between fixed partitions and dynamic partitions. Operating system Process 1 Process 3 Empty 300 blocks Process 2 Service time 120 60 180 50 300 Process P1 P2 P3 P4 P5...
View Full Document

This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online