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

Scribd
Upload
48 views2 pages

Operating System Handwritten Notes

The document contains a series of questions related to operating systems, focusing on CPU scheduling, cooperative processes, CPU-I/O burst cycles, semaphores, and critical problem solutions. It includes practical exercises requiring the calculation of average turnaround and waiting times for various scheduling algorithms such as FCFS, SJF, and Round Robin. The document emphasizes the importance of understanding process management and scheduling in operating systems.

Uploaded by

Aditi thakare
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
48 views2 pages

Operating System Handwritten Notes

The document contains a series of questions related to operating systems, focusing on CPU scheduling, cooperative processes, CPU-I/O burst cycles, semaphores, and critical problem solutions. It includes practical exercises requiring the calculation of average turnaround and waiting times for various scheduling algorithms such as FCFS, SJF, and Round Robin. The document emphasizes the importance of understanding process management and scheduling in operating systems.

Uploaded by

Aditi thakare
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

Assignment Opera ng System

Q1) What is meant by CPU Scheduler ? Explain the criteria for CPU Scheduling

Q2) What is co-opera ng process? Explain in brief t

Q3) With the help of diagram describe CPU- I/O burst cycle?

Q4)What is semaphore? Discuss its types?

Q5) Discuss the requirement of the cri cal problem solu on?

Q6) Consider a following set of processes with the CPU burst me and arrival me given in

Milliseconds. Draw the Gan chart and calculate the average turnaround me and wai ng me for

scheduling algorithm FCFS , SJF and Round Robin (Quantum=1 )

Process Burst Arrival Time


Time
P1 8 0
P2 2 0
P3 1 0
P4 10 0
P5 3 0

Q7) Consider the following set of process with the length of CPU Burst me and arrival me in
milliseconds ,using FCFS ,pre-emp ve priority scheduling .Calculate wai ng me and turn around
me for each process and calculate average wai ng me and average turn around me.

Process Burst Arrival Time Priority


Time
P1 5 1 1(Highest)
P2 6 0 2
P3 2 1 1
P4 4 0 3(Lowest)

Q8) Draw the Gan chart and calculate the average turnaround me and wai ng me for

scheduling algorithm using FCFS, preemp ve SJF and non- preemp ve SJF

Process Burst Arrival Time


Time
P1 8 0
P2 4 1
P3 9 2
P4 5 3
Q9) Consider a following set of processes with the CPU burst me and arrival me given in

Milliseconds Draw the Gan chart and calculate the average turnaround me and wai ng me for

scheduling algorithm using FCFS, SJF (non-premp ve), and RR ( me slice=10)

Process Burst Arrival Time


Time
P1 10 0
P2 29 0
P3 3 0
P4 7 0
P5 12 0

Q10) Draw the Gan chart and calculate the average turnaround me and wai ng me for

scheduling algorithm using Round Robin algorithm with me slice=2

Process Burst Arrival Time


Time
P1 5 1
P2 3 0
P3 2 2
P4 4 3
P5 2 13

You might also like