Scribd
Upload
13 views4 pages

Chapter 4 Questions

Uploaded by

Piush Gogi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views4 pages

Chapter 4 Questions

Uploaded by

Piush Gogi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Chapter 4 Questions

• Repeated Questions

1) Describe I/O Burst and CPU Burst cycle with neat diagram. (4M
=W19) (2M =W22).
2) Describe different scheduling criteria. (2M =W19) (4M= S22, W22,
S23).
3) Explain deadlock? What are necessary conditions for deadlock?
(4M =W19, S22, S23, S24).
4) State difference between preemptive scheduling and non-
preemptive scheduling. (2M =S22, S23).

• 2 Marks Questions

1) Define Deadlock. (s23)

• 4 Marks Questions

1) Explain Round Robin algorithm with suitable example. (w19)


2) Write steps required for Banker’s algorithm to avoid deadlock.
(s22)
3) Calculate average waiting time for following data using First Come
First Served (FCFS) and Shortest Job First (SJF) algorithms.(s22)
Process Burst time Arrival time
P0 08 0
P1 04 1
P2 05 2
P3 03 3
4) Describe conditions for deadlock prevention. (w22)
5) Solve given problem by using SJF and FCFS scheduling algorithm
using Gantt chart. Calculate the average waiting time for each
algorithm. (w22)
Process Burst time (in ms)
P1 9
P2 7
P3 3
P4 7
6) Explain following terms with respect to scheduling (w23)
i) CPU utilization
ii) Throughput
iii) Turnaround time
iv) Waiting time
7) What is deadlock? Discuss any one method of deadlock
prevention. (w23)
8) Solve given problem by using FCFS scheduling algorithm. Draw
correct Gantt chart and calculate average waiting time and
average turnaround time – (w23)
Process Arrival time Burst time
P0 0 10
P1 1 29
P2 2 3
P3 3 7
P4 4 12

• 6 Marks Questions

1) The jobs are scheduled for execution as follows:


Process Arrival Time Burst Time

P1 0 7

P2 1 4

P3 2 10

P4 3 6

P5 4 8
i) SJF
ii) FCFS
Also find average waiting time using Gantt chart.(w19)
2) Solve given problem by using
i) Pre-emptive SJF
ii) Round Robin (Time Slice = 3 ms)
Calculate average waiting time using Gantt Chart. (w22)
Process A.T B.T (in ms)
P11 0 8
P12 1 4
P13 2 9
P14 3 5
3) Consider the four processes P1, P2, P3 and P4 with length of CPO
Burst time. Find out Avg waiting time and Avg turn around time
for the following Algorithms.(s23)
i) FCFS
ii) RR (Slice-4ms)
iii) SJF
Process Arrival time Burst time
P1 0 8
P2 1 4
P3 2 9
P4 3 5
4) With neat diagram explain multilevel queue scheduling.(s23)
5) How pre-emptive scheduling is better than non pre-emptive
scheduling by solving following problem using SJF (Solve it by
using pre-emptive SJF and non-pre-emptive SJF also). (w23)
Process Arrival time Burst time
P1 0 8
P2 1 4
P3 2 9
P4 3 5

You might also like