Ex/TIU/ESA/Sem-V//2023

CSE DEPARTMENT, 3RD YR. END SEMESTER (AUTUMN) EXAMINATIONS, 2023

Subject Name:OPERATING SYSTEM

Subject Code: TIU-UCS-T317

Full Marks: 70​ ​ Time Allotted: 3 hours

The figures in the right margin indicate full marks.
Candidates are required to give their answer in their own words as far as applicable.
Unless otherwise specified, the notations / symbols have their usual meanings.
Use of non-programmable calculator is allowed.

Group-A

1.​ (Answer all of the following questions)​ 2 x10 = 20

i)​ For the RR scheduling algorithm, Burst time of five processes (p0,p1,p2,p3,p4) are as
follows (2ms, 3ms, 15ms, 1ms, 2ms) and time quantum=5ms, all arrived at 0th ms, calculate
the number of context switching to schedule the five processes.
OR

Point out the major problems of the FCFS CPU scheduling algorithm. Which CPU
scheduling algorithm can be used to address this issue?
ii)​ Justify with proper example that — ​
“Segmentation is a memory management scheme which supports the user view of memory.”

OR

For the Shortest-Remaining Time First (SRTF) CPU scheduling algorithm, Burst time and
arrival time of four processes (p11,p21,p33,p14) are (3ms, 1ms, 5ms, 2ms) and (0, 1ms,
2ms, 3ms) respectively. Calculate the number of context switching.
iii)​ State Belady anomaly in the context of page fault and also give an example for the same.

OR

Differentiate between Deadlock prevention and Deadlock avoidance strategies.

iv)​ Consider a 32bit system, where the number of lines in the address bus is 16, estimate the
amount of physical memory space and logical address space.

OR

Differentiate between logical address space and physical address space.

v)​ Consider a system whose Hard disk transfer rate = 128MB/ Sec and process size(in Primary
Memory) =56 MB, process size (in Secondary Memory) = 40MB and hard drive
latency=10ms. Can these two processes be swapped? If yes then calculate the context
switching time.

OR

Briefly explain the term “Thrashing” in case of virtual memory management.

Page 1 of 7
 Ex/TIU/ESA/Sem-V//2023

vi)​ Define Process mix. Justify with a suitable example that good process mix would help in
higher throughput.

OR
Describe the Process State Transitions using an appropriate schematic diagram.
vii)​ Discuss with a suitable example that paging technique also suffers from internal
fragmentation.

OR

Briefly explain the term “Copy-on-Write” (COW) for Virtual Memory management.

viii)​ Illustrate with an example that classical semaphore technique of synchronization wastes the
CPU clock cycles.

OR

Describe the classical Dining Philosopher problem. State the solution strategy of Dining
Philosophers Problem using Monitor.

ix)​ Consider a disk scheduler that implements SSFT scheduling having a sequence of cylinders
as follows: 51,56,44,89,34,23,5,98,77. Calculate the total amount of cylinder head seek.
Consider the starting head at 54 and the total number of cylinders is 120.

OR

Consider a system where, Process={p0,p1,p2,p3}, Arrival time={0,1,2,0} burst

time={4,2,3,2}, In SJF method CPU scheduling of uni-processor system, which process is
executed after p3?
x)​ Consider two systems:

System 1: Hard disk transfer rate = 20 MB/ Sec and Average process size= 40MB and hard
drive latency=10 ms.

System 2: Hard disk transfer rate = 75 MB/ Sec and Average process size= 120 MB and
hard drive latency=10ms. Which system has faster context switching?

OR

Consider the following code snippet

int main()

if (fork() | | fork())

fork();

printf(“Hello ”);

Page 2 of 7
 Ex/TIU/ESA/Sem-V//2023

Using parent-child relationship evaluates the count of “Hello” statements.

Group- B

(Answer all the following questions) 5x4 = 20

2.​ Draw the Resource Allocation Graph of the given following information and check if it is a
deadlock or not. If there is any deadlock, terminate all the processes involved in deadlock all at
a time and redraw the RAG again.

Process={p0,p1,p2,p3,p4}, Resource={r0,r1,r4,r5,r2},edge list={p0→r5,r5→p1,r2→p4,

p4→r0,p4→r5,r1→p4,p2→r2}

OR

Consider the following segment table:

Length
Segment Base

0 219 600

1 2300 14

2 90 100

3 1327 580

4 1952 96

Compute the physical address for the following logical addresses(i)0,430 (ii) 1,12 (iii) 2,500
(iv)3,400 (v) 4, 167

3.​ Consider a Primary Memory having a space total 256 MB, where OS resident area is 30MB
and consider the dynamic partitioning is implemented to allocate the processes in primary
memory. We have the following sequence of processes to accommodate.

Page 3 of 7
 Ex/TIU/ESA/Sem-V//2023

P1 P2 P3 P4 P5 P6 P7 P8 P9 P10

22MB 28MB 36MB 8MB 40MB 10MB 11MB 15MB 52MB 3MB

Use Best fit and Worst fit Algorithm to allocate the processes. Identify the type of fragmentation
and calculate the total fragmented memory.

OR

Consider the following snapshot of a system:

Allocation ,request vectors of the processes as follows for the resources {A,B,C}
Po <010> <000> Available vector=<0 0 0>
pl <200 > <202>
p2 <303> < 001>
p3 < 211> < 100>
p4 < 002> < 002>
Check whether the system is deadlocked? If so, list the processes which are now under deadlock
state.
4.​ Consider a system consisting of m resources of the same type being shared by n processes. A
process can request or release only one resource at a time. Show that the system is deadlock free
if the following two conditions hold:

a. The maximum need of each process is between one resource and m resources.

b. The sum of all maximum needs is less than m + n.

OR

Define virtual memory? Explain paging technique to implement virtual memory. Consider the
virtual page reference string: 1,2,3,2,4,1,3,2,4,1 on a demand paged virtual memory system
running on a computer system that has a main memory size of 3 frames which are initially
empty. Now find out the number of page faults in FIFO and LRU page replacement algorithm.

5.​ Consider a paging system with the page table stored in memory. a) If a memory reference takes
200 nanoseconds, how long does a paged memory reference take? b) If we add TLBs, and 75
percent of all page-table references are found in the TLBs, what is the effective memory
reference time? (Assume that finding a page-table entry in the TLBs takes zero time, if the entry
is there.)

OR

Define internal fragmentation. Suppose that we have free segments with sizes: 6KB, 15KB,
25KB, 12KB, and 19 KB respectively. Place a program with size 10KB in the free segment
using first-fit, best-fit and worst-fit methods.

2.​
3.​
Page 4 of 7
 Ex/TIU/ESA/Sem-V//2023

4.​ ()()
5.​ (()
and Q-
Group C

(Answer all the following questions) 10x3 = 30

6.​ Consider the following allocations, request and claim of the multiple resources( all are of
single instance) by multiple processes in a system are represented as matrix as follows:

Allocation R0 R1 R2

P0 1 0 0

P1 0 0 0

P2 0 1 0

P3 0 0 1

Request R0 R1 R2

P0 0 1 1

P1 1 1 0

P2 0 0 0

P3 1 0 0

Claim R0 R1 R2

P0 0 0 0

P1 0 0 0

P2 1 0 0

P3 0 1 0
Draw the RAG and check the state of the system is Unsafe / Safe. Identify the particular
claim/s which might cause the system to be unsafe. Give your justification that a safe state
never leads to deadlock.
7.​ Consider the following Wait-for graph of a system where you have 5 resources {r0,r1,r2,r3,r4}.

Page 5 of 7
 Ex/TIU/ESA/Sem-V//2023

Draw the possible RAG for the given Wait-for graph. Consider all the resources having a single
instance. Also find the deadlock(if any). To recover it from the deadlock, we terminate the
processes one after another based on their maturity level and on each termination again draw the
wait-for graph till the deadlock is removed. Consider the processes have the maturity level can
be defined as follows:
p0>p2, p1>p2 and p1>p3. greater than symbol implies higher maturity.

8.​ Consider a Multi-level feedback queue scheduling system, where there are three
queues(q0,q1,q2). q0 implements SJF scheduling where each process is given a time quantum
of 3ms. q1 uses RR scheduling scheme where each process is given a time quantum of 5ms and
q2 implements FCFS. Draw the Gantt chart of the scheduling and calculate the average wait
time of the system.

Process Burst Time

p11 14

p01 5

p12 2

p13 10

p10 7
Consider all the processes arriving at the system at the same time.

OR

For the processes listed in below table (i) draw the Gantt chart illustrating their execution (ii)
find the average turnaround time, (iii) find the wait time using (a) First- Come First- Served (b)
Shortest Job First (c) Shortest Remaining Time (d) Round Robin(quantum=2)

Page 6 of 7
 Ex/TIU/ESA/Sem-V//2023

Process Arrival Processing

Time Time

A 0.000 3

B 1.001 6

C 4.001 4

D 6.001 2

Page 7 of 7