Scribd
Upload
17 views2 pages

Unit 4-CPU Scheduling & Algorithms

Uploaded by

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

Unit 4-CPU Scheduling & Algorithms

Uploaded by

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

Unit 4-CPU scheduling & algorithms

Winter19
1. Explain deadlock? What are necessary conditions for deadlock?
2. Describe I/o burst and CPU burst cycle with neat diagram.
3. State and describe types of scheduler.
4. Explain Round Robin algorithm with suitable example.
The jobs are scheduled for execution as follows
Process
Arrival Time
Burst Time
Solve the problem using:
(i) SJF
(ii) FCFS
Also find average waiting time using Gantt chart.

Summer22
1) State and describe any two scheduling criteria.
2) Describe prevention of deadlock occurrence with respect to
hold and wait necessary condition
3) Write steps required for Banker’s algorithm to avoid deadlock.
4) Calculate average waiting time for following data using First
Come First Served (FCFS) and Shortest Job First (SJF)
algorithms.

Winter22
1. Describe different scheduling criteria.
2. Describe conditions for deadlock prevention.
3. Compare between Long term and short term scheduler. (Any
four points)
4. Solve given problem by using SJF and FCFS scheduling
algorithm using Gantt chart. Calculate the average waiting time
for each algorithm
5. Solve given problem by using
(i) Pre-emptive SJF
(ii) Round Robin (Time Slice = 3 ms)
Calculate average waiting time using Gantt Chart

Summer23
1) State and explain four scheduling criteria.
2) Explain different types of schedulers.
3) Describe any four condition for deadlock.
4) With neat diagram explain multilevel queue scheduling.
5) 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.
i) FCFS
ii) RR (Slice-4ms)
iii) SJF
Winter23
1. Explain following terms with respect to scheduling
i) CPU utilization
ii) Throughput
iii) Turnaround time
iv) Waiting time
2. What is deadlock? Discuss any one method of deadlock
prevention.
3. Solve given problem by using FCFS scheduling algorithm.
Draw correct Gantt chart and calculate average waiting time
and average turnaround time
4. 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).

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy