CIS 320 Section 2 Concepts Homework3 Fali, 2017 (Due at beginning of class Oct. 4 or before, 10 points Possible) (Ch. 4 Non-Preemptive processor scheduling) Assume that the 5 jobs shown below arrive at the times indicated, with Processing times indicated (and for the Priority Scheduling example with the priority levels indicated) 1. Process Arrival Time Processing Time Process Priority* 10 16 2 20 24 means higher *Applies only to Priority Scheduling- assumes higher value means higher priority Unine Eicst come first served scheduing Under First come first served scheduling, the processing order would be ABCDE. a. b. Using shortest Job next scheduling the processing order would be?_____. c. Using priority Schedling without preemption the processing order would be? _-_- 2. (Ch. 4 ppt. Multi-level queue Scheduling) Assume that a multi-level queue system with a variable time quantum per queue is being used where each job advances to the next higher queue when interrupted and that an incoming job needs 120 ms to run to completion. If the Level 1 queue has a time quantum of 10 ms and each queue thereafter has a time quantum that is twice as large as the previous one, how many times will the job be interrupted, how much processing time will it use in each queue and on which queue wi it finish its execution