Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
30 views2 pages

OS Assignment Unit 3

This document is an assignment for the BCA course at G H Raisoni College of Engineering and Management, focusing on Modern Operating Systems. It includes various questions related to CPU scheduling algorithms, such as First Come First Serve, Shortest Job First, Priority Scheduling, and Round Robin, requiring students to solve examples and calculate average turnaround and waiting times. The assignment is structured to assess students' understanding of scheduling criteria and types.

Uploaded by

Mahesh Kale
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
30 views2 pages

OS Assignment Unit 3

This document is an assignment for the BCA course at G H Raisoni College of Engineering and Management, focusing on Modern Operating Systems. It includes various questions related to CPU scheduling algorithms, such as First Come First Serve, Shortest Job First, Priority Scheduling, and Round Robin, requiring students to solve examples and calculate average turnaround and waiting times. The assignment is structured to assess students' understanding of scheduling criteria and types.

Uploaded by

Mahesh Kale
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/ 2

G H Raisoni College of Engineering and Management, Jalgaon

Department of Computer Application


Course: BCA
Name of Faculty Member: Prof. Rupali Dhake
Subject Code: BCA-MCC-113 Subject Name: Modern Operating System

Assignment-03 (CO-3)
Sr. Questions (Attempt any 5) BL
No.
1 Explain Scheduling criteria in detail. 2
2 What is scheduling and its types. 1
3 Explain First Come First Serve and Shortest Job First. 2
4 Solve the following example on the CPU scheduling algorithm and 3
find out the average Turn-around time and average waiting time.

First Come First Serve


Criteria-Arrival time
Mode-non-pre-emptive
PID P1 P2 P3 P4
Arrival Time 1 0 4 2
Burst Time 4 3 1 1
5 Solve the following example on the CPU scheduling algorithm and 3
find out the average Turn-around time and average waiting time.
Shortest Job First
Criteria-Burst time
Mode-non-pre-emptive
PID P1 P2 P3 P4 P5
Arrival Time 2 5 1 0 4
Burst Time 6 2 8 3 4
6 Solve the following example on the CPU scheduling algorithm and 3
find out the average Turn-around time and average waiting time.
Shortest Job First
Criteria-Burst time
Mode-pre-emptive
PID P1 P2 P3 P4 P5
Arrival Time 3 1 4 0 2
Burst Time 1 4 2 6 3
7 Solve the following example on the CPU scheduling algorithm and 3
find out the average Turn-around time and average waiting time.
Priority Scheduling
Criteria-Priority
Mode- non-pre-emptive
PID P1 P2 P3 P4 P5 P6 P7
Priority 3 4 4 5 2 6 1
Arrival Time 0 1 3 4 5 6 10
Burst Time 8 2 4 1 6 5 1
8 Solve the following example on the CPU scheduling algorithm and 3
find out the average Turn-around time and average waiting time.
Priority Scheduling
Criteria-Priority
Mode- pre-emptive
PID P1 P2 P3 P4 P5 P6 P7
Priority 2 6 3 5 4 10 9
Arrival Time 0 1 2 3 4 5 6
Burst Time 1 7 3 6 5 15 8
9 Solve the following example on the CPU scheduling algorithm and 3
find out the average Turn-around time and average waiting time.
Priority Scheduling
Criteria-Priority
Mode- non-pre-emptive
PID P1 P2 P3 P4 P5 P6 P7
Priority 3 4 4 5 2 6 1
Arrival 0 1 3 4 5 6 10
Time
Burst Time 8 2 4 1 6 5 1
10 Solve the following example on the CPU scheduling algorithm and 3
find out the average Turn-around time and average waiting time.
Round Robin
Criteria-Time Quantum
Mode-pre-emptive
TQ- 5
PID P1 P2 P3 P4 P5 P6
Arrival Time 0 1 2 3 4 4
Burst Time 7 4 15 11 20 9

Prof. Rupali Dhake Prof. Kalyani Neve


Subject Teacher HOD

You might also like