Answer to Question #175190 in Programming & Computer Science for Rania

Question

Consider six processes whose estimated arrival and duration times are given in the following table:

P1 P2 P3 P4 P5 P6

Duration 8 3 5 1 2 4

Arrival date   0 0 1 2 3 3

 For the following scheduling algorithms: 

1. a. FIFO 
2. b. Shortest Job First (SJF) 
3. c. Shortest Remaining Time (SRT) 
4. d. Tourniquet with the quantum 2 + start with the shortest process. 

➢ Give and compare the average execution time produced by each algorithm. 

Answer 1

Dear Rania, your question requires a lot of work, which neither of our experts is ready to perform for free. We advise you to convert it to a fully qualified order and we will try to help you. Please click the link below to proceed: Submit order