1. come up with a 6-job set , each having a 3-tuple. 3-tuple: [release time, computation time, deadline]. due: Saturday at 6pm. POST HERE STATE IF PREEMPTABLE OR NOT mine is as follows and its preemptable. j1=(0,1,9) j2=(1,3,8) j3=(0,2,6) j4=(2,1,11) j5=(0,1,5)

2a. choose a student job set that hasn't been chosen yet and make an ad-hoc schedule, figuring out how many processors are needed for that set. late job completions aren't worthwhile [ie. hard deadlines]. [email me if you have no one's to solve].

2b. calculate response times for each job AND overall average response time AND overall median response time AND overall mode response time [none if no repeated numbers]

2c. calculate overall set completion time