0% found this document useful (0 votes)
10 views

OS - Wipro - Lab Sheet-03

Uploaded by

pavilion.ak47
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
0% found this document useful (0 votes)
10 views

OS - Wipro - Lab Sheet-03

Uploaded by

pavilion.ak47
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/ 4

Department of Computer Science and Information Technology

Operating System: SSWTZC364/ CSIWZC364/ SEWIZC364


Lab Work Sheet-03 (Assignment)
1. Objective:
At the end of this lab session, students will be:
 Create processes from programs in the CPU - OS simulator.
 Understand the working of FCFS, and RR scheduling algorithms

2. Prerequisite:
Refer to the “Process Management” video capsule available in eLearn Portal’s
Labware page.

3. Important Instructions:
a. Experiments should be conducted on the BITS Nuvepro Cloud Lab only.
Experiments conducted outside this lab platform will not be evaluated.
b. Instructions on how to access and use the Nuvepro Cloud lab platform are
available in the document “Steps to access cloud-based CS/IS virtual lab.pdf”.
c. While using the Nuvepro Cloud, save all your work in the Persistent folder,
which is available on the desktop. (Important Note: Always take backup of this
folder.)
d. The completed worksheet should be uploaded in Taxila (elearn) portal only.
The last date for uploading the document is 13-October-2024.
e. This worksheet/lab activity carries 7.5% (15 Marks) of weightage
f. Refrain from copying or sharing documents with others. Any evidence of such
practice will attract severe penalties.
g. Any queries related to LAB Activities should be asked only through eLearn
portal under discussion forum. Use the below mentioned link to access the
same:
Section Discussion Forum Link
SEWIZC364 https://taxila-aws.bits-
pilani.ac.in/mod/forum/discuss.php?d=68446#p145218
SSWTZC364 https://taxila-aws.bits-
pilani.ac.in/mod/forum/discuss.php?d=68447#p145219
CSIWZC364 https://taxila-aws.bits-
pilani.ac.in/mod/forum/discuss.php?d=68448#p145220

1
4. Lab Exercise:
Consider the following source code. Note: Name of the program should be your ID Number.
program <ID Number>
i = 0
for n = 0 to 10
i = i + 1
next
end
Following procedure to be used to create processes.
 Compile the above source code and load it in the main memory.
 Use the OS simulator to run this code. To enter the OS simulator:
 Click on the OS O… button in the current window. The OS window opens.
 You should see an entry, titled <ID Number> in the PROGRAM LIST view.
 Now that this program is available in the OS simulator, you can create as many
instances, i.e., processes, of it as you like. You do this by clicking on the CREATE
NEW PROCESS button.
This assignment has four Parts and the weightage for this assignment is 7.5 % weightage (15
Marks).
PART-A

Answer the following with reference to FCFS scheduling algorithm:


a) Initialize the OS simulator with the following:
 Select the First-Come-First-Served (FCFS) option in the SCHEDULER/Policies
view
 Time slice should be considered as seconds.
 Slide the Speed selector half‐way down and then hit the START button.
 Arrival delay should be considered in seconds in the OS simulator
Present the snapshot of the above settings.
b) Create four processes P1, P2, P3 and P4 from source code respectively. Set the arrival delay
as zero seconds. Present the snapshot of the ready queue.
c) What is the order in which processes are executed?

2
d) What is the Elapsed time, Average Process Waiting Time and Average Burst Period of each
process? (To see this, click on VIEWS button available on the left of your OS control, the
click VIEW LOG)
Process Arrival Elapsed Time Average Process Waiting Average Burst
Time/Delay (sec) Time (sec) Period
P1 0
P2 0
P3 0
P4 0

PART-B

Answer the following with reference to FCFS scheduling algorithm for processes with
different arrival times:
a) Initialize the OS simulator with the following:
 Select the First-Come-First-Served (FCFS) option in the SCHEDULER/Policies
view
 Time slice should be considered as seconds.
 Slide the Speed selector half‐way down and then hit the START button.
 Arrival delay should be considered in seconds in the OS simulator
Present the snapshot of the above settings.
b) Create four processes P1, P2, P3 and P4 from source code respectively. Set the arrival delay
as 0, 5, 10 and 15 seconds respectively. Present the snapshot of the ready queue.
c) What is the order in which processes are executed?
d) What is the Elapsed time, Average Process Waiting Time and Average Burst Period of each
process? (To see this, click on VIEWS button available on the left of your OS control, the
click VIEW LOG)
Process Arrival Elapsed Time Average Process Waiting Average Burst
Time/Delay (sec) Time (sec) Period
P1 0
P2 5
P3 10

3
P4 15

PART-C

Answer the following with reference to RR scheduling algorithm:


a) Initialize the OS simulator with the following:
a. Select the Round Robin (RR) option in the SCHEDULER/Policies view
b. Time slice should be considered as seconds.
c. Slide the Speed selector half‐way down and then hit the START button.
d. Arrival delay should be considered in seconds in the OS simulator
Present the snapshot of the above settings.
b) Create four processes P1, P2, P3 and P4 from source code respectively. Set arrival time as 0
for all the processes. Present the snapshot of the ready queue.
c) What is the order in which processes are executed? Present the snapshot.
d) What is the Elapsed time, Average Process Waiting Time and Average Burst Period and of
each process? (To see this, click on VIEWS button available on the left of your OS control,
the click VIEW LOG)

Process Arrival Elapsed Time Average Process Waiting Average


Time/Delay (sec) Time (sec) Burst Period
P1 0
P2 0
P3 0
P4 0

PART-D

a) Plot a graph from the results obtained by FCFS with same and different arrival times, and
Round Robin scheduling and explain which algorithm is better among these with proper
justification.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy