Scribd
Upload
17 views2 pages

OS Itbl 3 - 2024 - Sec01Answers

This document outlines an operating systems exam for ITBL #3 Fall 2024-25, consisting of two questions focused on process scheduling. The first question requires students to analyze a set of processes using the Round Robin scheduling algorithm, while the second question involves a multilevel feedback queue scenario. Students must work in groups, submit a single answer sheet, and are allowed to consult various materials for assistance.

Uploaded by

MohammadShamun
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
17 views2 pages

OS Itbl 3 - 2024 - Sec01Answers

This document outlines an operating systems exam for ITBL #3 Fall 2024-25, consisting of two questions focused on process scheduling. The first question requires students to analyze a set of processes using the Round Robin scheduling algorithm, while the second question involves a multilevel feedback queue scenario. Students must work in groups, submit a single answer sheet, and are allowed to consult various materials for assistance.

Uploaded by

MohammadShamun
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/ 2

1501352: Operating Systems

ITBL # 3 Fall 2024-25


Time Allowed: 30 mins

1 ID: __________ Name: _______ANSWERS_______________________ Signature: ______________________

2 ID: __________ Name: _______________________________________ Signature: ______________________

3 ID: __________ Name: _______________________________________ Signature: ______________________

4 ID: __________ Name: _______________________________________ Signature: ______________________

Note: This is a group-based activity; but no inter-group communication is allowed. Each group is required to
answer the following questions in brief and to the point and submit one answer sheet to the instructor indicating
all names of the group. You can consult lecture slides, books, and online material.

Q1. (80 marks) Consider the following set of processes, with the length of CPU-burst time given in
milliseconds. The processes are assumed to have arrived in the order P1, P2, P3, P4, P5 all at time 0. Draw
Gantt chart. and calculate the individual and average waiting time, turnaround time and response time of each
process, assuming the Round Robin scheduling algorithm is used with time quantum 6.

Process Burst Time Waiting Time Turnaround Time Response Time


P1 10 (0-0)+(26-6)=20 30-0=30 0-0=0

P2 7 (6-0)+(30-12)=24 31-0=31 6-0=6

P3 3 (12-0)=12 15-0=15 12-0=12

P4 5 (15-0)=15 20-0=20 15-0=15

P5 8 (20-0)+(31-26)=25 33-0=33 20-0=20

Average 19.2 ms 25.8 ms 10.6

P1 P2 P3 P4 P5 P1 P2 P5
0 6 12 15 20 20 26 26 30 30 31
6 12 15 31 33

Page 1 of 2
Q2. (20 marks) Consider the following multilevel feedback queue, where there are three queues Q0 (RR with
q=8ms), Q1 (RR with q=16ms), and Q2 (FCFS). Answer the questions.

1. New processes always enter the queue …Q0……. . (Pick one from the list {Q0, Q1, Q2})
2. A process currently in Q0 with the CPU burst length=9 ms enters to the Q1 in the next round. True/False?
3. The processes in Q2 are more interactive than the processes in Q1. True/False?
4. Q2 is a part of the ‘ready queue’ in the system. True/False?
5. Suppose the short-term scheduler always selects from Q0 when not empty, and always selects from Q1 when Q0 is
empty but Q1 is not, and selects from Q2 when both Q0 and Q1 are empty but Q2 is not. Then, there is no risk of
starvation with this CPU scheduling. True/False?

Page 2 of 2

You might also like