Scribd
Upload
10 views3 pages

Csa04 Operating System

g

Uploaded by

Sbas Nagar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
10 views3 pages

Csa04 Operating System

g

Uploaded by

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

Saveetha School of Engineering

Saveetha Institute of Medical and Technical Science,


Chennai.

Subject Code : CSA0443 Subject Name: Operating Systems for CPU


Scheduling
Date: 30– 11 – 2024 FN Faculty Name: Dr.N.Poongavanam

ANALYTICAL PROBLEM

1. An operating system uses FCFS process scheduling algorithm. Consider the arrival times and
execution times for the following processes:

Process Execution time Arrival time


P1 3 15
P2 5 17
P3 8 19
What is the average waiting time and turnaround time for all processes?

2. An operating system uses Shortest Job First (SJF) process scheduling algorithm. Consider
the arrival times and execution times for the following processes:

Process Execution time Arrival time


P1 20 0
P2 25 15
P3 10 30
P4 15 45
What is the total waiting time for process P2?

3. Consider the following table of arrival time, burst time and priority values for three
processes P0, P1 and P2.
Process Arrival time Burst Time Priority
P0 0 ms 9 ms 1
P1 1 ms 4 ms 2
P2 2 ms 9 ms 3

What is the average waiting time for the three processes if priority-based scheduling is used?
4. Write a program to compute the average waiting time and turnaround time based on
Preemptive shortest remaining processing time first (SRPT) algorithm for the following set
of processes, with the arrival times and the CPU-burst times given in milliseconds

Process Arrival Time Burst Time

P1 0 5

P2 1 3

P3 2 3

P4 4 1

LAB EXPERIMENTS

1. Illustrate the concept of multithreading using a C program.


2. Design a C program to simulate the concept of Dining-Philosophers problem.
3. Construct a C program for implementation of the various memory allocation strategies.

You might also like