BCS1333 OS: 5 April 2015

'Test 1' akan di adakan pada ketetapan berikut:-

Tarikh : 12/4/2015

Masa : 8.30 am - 9:30 am

Chapter: 2- OS Structures, 3- Processes, 4: Threads

Latihan Chapter 5: CPU Scheduling

  Consider the following table 4.1. Four processes are arrived at time 0, with the length of the CPU burst given in milliseconds:

Process          Burst Time     _______ * Priority

P1                                10                                3

P2                                15                                1

P3                                3                                  3

P4                                5                                  2

*smaller priority number implies a higher priority

Table 4.1 List of processes that are arrived at time 0

The processes are assumed to have arrives in order P1, P2, P3, P4 all at time 0.

      I.        Draw FOUR (4) Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SJF, Priority, and RR (quantum = 5).