L D College of Engineering

Department of Computer Engineering

Subject: Operating System (3140702)
CONTINUOUS EVALUATION EXAM
Total Marks: 30 B.E. IV Duration: 1.5 Hours
Date: 10/05/2022 Time: 12:30 PM to 02:00 PM

Q-1 Answer the Following Questions.

A Define Operating System. List the Services Provided by Operating System. CO1 L1: [02]
Knowledge
B Draw the Memory Hierarchy Diagram. Explain the Use of Cache Memory. CO1 L2: [02]
Understand

Q-2 Answer the Following Questions.

A Show Process State Transition using neat diagram. CO2 L1: [02]
Knowledge
B Consider the following five processes with the length of the CPU burst CO2 L3: Apply [04]
time and arrival time in milliseconds. For the below set of processes find
the average waiting time and average turnaround time for Round Robin
Scheduling using Gantt chart. Time Quantum is 3 milliseconds.
Process Burst Time Arrival Time
P1 5 0
P2 7 3
P3 3 2
P4 8 4
P5 6 1

OR
B Consider the following five processes with the length of the CPU burst CO2 L3: Apply [04]
time in milliseconds.
Processes are Assumed to have arrived at time 0. For the below set of
processes find the average waiting time and average turnaround time for
Priority Scheduling using Gantt chart. Consider 1 is highest priority.
Process Burst Time Priority

P1 10 3
P2 5 1
P3 2 3
P4 6 4
P5 4 2
Q-3 Answer Any Three of the Following Questions.
A Explain The Following terms. CO3 L2: [03]
1. Mutual Exclusion 2. Critical Section 3. Race Condition Understand
B Discuss the use of TSL instruction for Mutual Exclusion. CO3 L2: [03]
Understand
Page 1 of 2
 L D College of Engineering
Department of Computer Engineering
Subject: Operating System (3140702)
CONTINUOUS EVALUATION EXAM
Total Marks: 30 B.E. IV Duration: 1.5 Hours
Date: 10/05/2022 Time: 12:30 PM to 02:00 PM

C Write Peterson’s solution for Mutual Exclusion. CO3 L2: [03]

Understand
D List and Explain Four Condition that must be present for deadlock to CO3 L2: [03]
occur. Understand

Q-4 Answer the Following Questions.

A Consider the page reference string: CO4 L3: Apply [04]
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2. With four Frames How many
page faults would occur for the FIFO page replacement algorithms?
(assume all frames are initially empty)

OR
A Consider the page reference string: CO4 L3: Apply [04]
9,0,1,2,0,5,3,2,5,9,0,1,2,4,3,6. With four Frames How many page faults
would occur for the LRU page replacement algorithms? (assume all frames
are initially empty)
B Discuss the need of Virtual Memory. Discuss Paging Technique for Virtual CO4 L2: [04]
Memory with Example. Understand

Q-5 Answer the Following Question.

A State the Use of Following Linux Commands and System Calls. CO5 L1: [03]
1. grep Knowledge
2. chmod
3. cat
4. fork
5. exit
6. wait

***************

Page 2 of 2