Scribd
Upload
9 views

Assignment 1 OS

This document contains 16 questions about operating system concepts like CPU scheduling algorithms, process scheduling, and multilevel queue scheduling. The questions ask about the behavior of scheduling algorithms like round robin and shortest remaining time first when given sample processes with different arrival times and burst times. They also ask the reader to draw Gantt charts illustrating how sample processes would be scheduled under different algorithms like shortest job first, priority scheduling, and multilevel feedback queue scheduling.

Uploaded by

ali ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

Assignment 1 OS

This document contains 16 questions about operating system concepts like CPU scheduling algorithms, process scheduling, and multilevel queue scheduling. The questions ask about the behavior of scheduling algorithms like round robin and shortest remaining time first when given sample processes with different arrival times and burst times. They also ask the reader to draw Gantt charts illustrating how sample processes would be scheduled under different algorithms like shortest job first, priority scheduling, and multilevel feedback queue scheduling.

Uploaded by

ali ahmed
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

ASSIGNMENT No 1

Operating system

Question 1
Question 2
Question 3
Question 4
Question 5
Suppose that a CPU scheduling algorithm favors those processes that have used the
least processor time in the recent past. Why will this algorithm favor I/O-bound programs
and yet not permanently starve CPU-bound processess?
Question 6
Consider the following set of processes, with arrival times and the required CPU burst
times given in milliseconds.
Process No. Arrival Time Burst Time
P1 0 4
P2 2 2
P3 3 1
What is the sequence in which the processess are completed? Assume round robin
scheduling with a time quantumof 2 millisecond.
Question 7

Question 8
Given the following mix of job, with burst times and arrival times, assume a time slice of
10 and compute and compare the completion for each job and average response time,
average waiting time and average turnaround time for the FIFO, RR, and SRTF, LRJF
algorithms.
Job Arrival Time Burst Time
P1 0 85
P2 10 30
P3 10 35
P4 80 20
P5 85 50
Question 9

Question 10
Question 11

Question 12
Question 13

Question 14
Given below are the times and burst time of five processes P1, P2, P3, P4, and P5. Draw
the gantt bahrt for LJF schedulling algorithm and calculate the average waiting time,
turnaround time.
Process ID Arrival Time Burst Time
P1 0 8
P2 1 2
P3 2 6
P4 3 4
P5 4 10
Question 15
Consider the four processess listed in the table below under multilevel feedback queue
scheduling. The queue number denotes the process’s queue.
Queue
Process No. Arrival Time Burst Time
Number
P1 0 4 1
P2 0 3 1
P3 0 8 2
P4 10 5 1

Queue 1 has highest priority than queue 2, round robin is used in queue 1 (Time
quantum=2), while FCFS is used in queue 2. Show how the multilevel feedback queue
scheduling work by drawing Gantt Chart.

Question 16
Consider the four processess listed in the table below under multilevel feedback queue
scheduling. The queue number denotes the process’s queue.
Queue
Process No. Arrival Time Burst Time
Number
P1 0 4 1
P2 0 3 1
P3 0 8 2
P4 10 5 4
Queue 1 has highest priority than queue 2, round robin is used in queue 1 (Time
quantum=2), while FCFS is used in queue 2. Show how the multilevel feedback queue
scheduling work by drawing Gantt Chart.

You might also like