Scribd
Upload
70 views2 pages

CS C372/IS C362 - Operating System: Birla Institute of Technology & Science, Pilani Test 1 - Closed Book

The document is a test for an operating systems course that contains 5 questions. Question 1 asks about the difficulty implementing shortest job first, shortest remaining time, and highest response ratio next scheduling algorithms and how operating systems implement them. Question 2 asks about the motivation for introducing a suspended state in the 5-state process model and why it is split into ready/suspend and blocked/suspend states. Question 3 provides a scenario to identify process states and those that might use demand paging. Question 4 applies multi-level feedback queue scheduling to a set of processes. Question 5 shows processes and their CPU-I/O bursts to schematically show execution under FCFS, round-robin, and virtual round-robin scheduling and calculates

Uploaded by

Vishal Mittal
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
70 views2 pages

CS C372/IS C362 - Operating System: Birla Institute of Technology & Science, Pilani Test 1 - Closed Book

The document is a test for an operating systems course that contains 5 questions. Question 1 asks about the difficulty implementing shortest job first, shortest remaining time, and highest response ratio next scheduling algorithms and how operating systems implement them. Question 2 asks about the motivation for introducing a suspended state in the 5-state process model and why it is split into ready/suspend and blocked/suspend states. Question 3 provides a scenario to identify process states and those that might use demand paging. Question 4 applies multi-level feedback queue scheduling to a set of processes. Question 5 shows processes and their CPU-I/O bursts to schematically show execution under FCFS, round-robin, and virtual round-robin scheduling and calculates

Uploaded by

Vishal Mittal
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

BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI

I SEMESTER 2008-2009
Test 1 – Closed Book
CS C372/IS C362 - Operating System
Weightage: 20% (60 marks)
Date: 01/09/2008
Time: 50 Minutes

1. What is the difficulty in implementing SJF, SRT, & HRRN? How do operating
systems implement these algorithms?
[6]
2. What is the motivation behind introducing a suspended state in the 5-state
process model? Further explain why there is need to split the suspended
state into ready/suspend and blocked/suspend states?
[6]
3. Consider the scenario shown below:

I/O 1 I/O 2 I/O 3 Processor

P1
P4 Main
Memory
P2 P5

Disk
P3

The solid arrows indicate a resource allocated and dashed arrows indicate
resource seeking.
(a) Identify the states of the five processes.
(b) Identify the processes which might use demand paging.
[9]
4. Apply the multi-level feedback queue scheduling algorithm to schedule the
following processes:
Arrival Time
In Ready
Process Queue CPU bursts
P1 0 5
P2 2 4
P3 4 8
P4 5 9
P5 6 3
5. Consider the following processes, with the length of the CPU & I/O bursts (in
milliseconds):
Arrival Time
In Ready CPU-I/O-CPU
Process Queue bursts
P1 0 2-2-3
P2 1 4-0-0
P3 2 1-2-2
P4 3 3-0-0
P5 6 5-0-0

On a time line, schematically show how the processes execute under the
following scheduling algorithms:
(a) FCFS
(b) Round-robin (q=3)
(c) Virtual Round Robin (q=3)

What is the average waiting time and average normalized turnaround time for
each scheduling algorithm? Which scheduling algorithm gives the best
service quality?
[6+6+6+6]

You might also like