Assignment NO. 02, Operating Systems Concepts CSC 322 (MCS).

Assignment NO. 02, Operating Systems Concepts CSC 322 (MCS).

Operating Systems Concepts CSC 322, Assignment No. 2 (Total Marks: 30)

Q.1. For a given Scheduling Algorithms the statistics regarding the processes have been provided and for your understanding the Gantt chart has also been drawn. You are only required to compute the average wait time: (20 Marks)

a)      First Cum First Serve (Non-Preemptive) 

 

b)      Shortest Job First (SJF) 

c)      Priority Based Scheduling

d)      Round Robin Scheduling (Time Quantum = 3)

 

Q.2. Scheduling Algorithms First-Come, First-Served (FCFS) for the table given below: (10 Marks)

       Process          Burst Time

          P1                                24

          P2                                  3

          P3                                  3

Suppose that the processes arrive in the order: 

a.      P1 , P2 , P3.

b.      P2 , P3 , P1 .

Draw Gantt chart and compute average wait time:

Q.3. Answer very briefly (10 Marks)

a)      What do the terms I/O bound and CPU bound mean when used to describe a process (or thread)?

b)      Multilevel feedback queue scheduling algorithm is designed to favor IO bound over CPU bound processes. How is this achieved? How does it make sure that low priority, CPU bound background jobs do not suffer starvation?

c)      Why would a round robin scheduler NOT use a very short time slice to provide good responsive application behavior?

d)      List the components of a Process Control Blocks ( Process Table).

e)      Why Disable Interrupt does not always solve the problem of Mutual Exclusion?