0% found this document useful (0 votes)
10 views3 pages

Chap_4

Osy chapter wise imp

Uploaded by

yadnyabothe
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
0% found this document useful (0 votes)
10 views3 pages

Chap_4

Osy chapter wise imp

Uploaded by

yadnyabothe
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/ 3

2 MARKS QUESTION

d) State difference between preemptive scheduling and non-preemptive scheduling. *

g) Define Deadlock.

d) Define CPU and I/O burst cycle.

d) Define CPU bound program and I/O bound program.

4 MARKS QUESTION

d) Describe I/o burst and CPU burst cycle with neat diagram

b) Explain deadlock? What are necessary conditions for deadlock?

c) Explain partitioning and its types.

d) Describe sequential and direct access method.

d) Explain Round Robin algorithm with suitable example.

b) Describe prevention of deadlock occurrence with respect to hold and wait necessary condition.

d) Write steps required for Banker’s algorithm to avoid deadlock.

c) Describe any four condition for deadlock.

b) Describe conditions for deadlock prevention.

d) Solve given problem by using SJF and FCFS scheduling algorithm using Gantt chart. Calculate the
average waiting time for each algorithm.

Process Burst time (in ms)

P1 9

P2 7

P3 3

P4 7

b) What is deadlock? Discuss any one method of deadlock prevention.

d) Solve given problem by using FCFS scheduling algorithm. Draw correct Gantt chart and calculate
average waiting time and average turnaround time –

Process Arrival time Burst time


P0 0 10

P1 1 29

P2 2 3

P3 3 7

P4 4 12

6 MARKS QUESTION

a) 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
Solve the problem using: (i) SJF (ii) FCFS Also find average waiting time using Gantt chart.

a) Calculate average waiting time for following data using First Come First Served (FCFS) and
Shortest Job First (SJF) algorithms.
Process Burst time Arrival time
P0 08 0
P1 04 1
P2 05 2
P3 03 3

b) 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
Process Arrival time Burst time
P1 0 8
P2 1 4
P3 2 9
P4 3 5

a) Solve given problem by using (i) Pre-emptive SJF (ii) Round Robin (Time Slice = 3 ms) Calculate
average waiting time using Gantt Chart. Process A.T. B.T. (in ms) P11 0 8 P12 1 4 P13 2 9 P14 3 5
b) Consider the following memory map and assume a new process P4 comes with memory
requirements of 6 KB. Locate (Draw) this process in memory using. i) First fit O.S. ii) Best Fit P1
iii) Worst fit 12 KB P2 19 KB P3 7KB Memory (winter 2022)
a) 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).
Process Arrival time Burst time
P1 0 8
P2 1 4
P3 2 9
P4 3 5

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