02000csT206052102

APJ ABDUIY KALAM TECHNOLOGICAL UNIVERSITY

Name:
1$
s/ w
r)
{
Fourth Semester B.Tech Degree Supplementary Examination June 2023 (201

$)
Course Code: CST206
Course Name: OPERATING SYSTEMS
Max. Marks: 100 Duration: 3 Hours

PART A
(Answer all questions; each question carries S
yy*g Marks

I what are the operations taking place when a system cail is executed? 3
2 what are multiprocessor systems? What are the advantages\of multiprocessor J
systems?
a
J Write the difference between process and thread. J
4 Differentiate between the two common models of interprocess communication. 5
5 Write the three requirements that a solution to critical-section problem must J
satisfo.
6 Explain the priority inheritance protocol for solving the priority inversion
problem.

7 What do you understand by external and internal fragmentation in case of

memory management schemes. r,

8 Explain the concept of demand paging?

\ 5
9 Explain the linked allocation of file allocation with merits and demerits. J
t0 Point out the differences between C-SCAN and C-LooK scheduling algorithms. J

PART B
(Answer onefull questionfrom each anodule, each question carries 14 molks)

Module -I
ll a) Explain the essential properties of the following types of operating systems: r0
i) Batch operating system
ii) Time sharing operating system
iii) Realtime operating system
iv) Distributed operating system
b) Explain the layered approach of the operating system structure.

Page I of 3
v

't

02000csT2060s2102

12 a) Explain any four Kernel data structures with suitable examples. 8

b) Justif the statement "Olerating System can be viewed as a govemment. 6

resource allocator and a control program".

Module -2
l3 a) With the help of a diagram, explain the operations taking place when the CPU 7

switches from one process to another.

b) Explain how the logical communication link is established and the messages are 7

passed in case of direct and indirect communication, in a message passing

system.

14 a) For the following set of processes draw the Gantt chart and find the average 9

waiting time for :

(i) FCFS (ii) sJF (iii) sRrF

Process Arrivaltime (in sec) Burst Time(in sec)

Pl. 0 4

P2 1 2

P3 2 5

P4 3 4

b) Explain-theworking of multi-level feedback queue scheduling.

Module -3

I 5 a) Consider a system with four processes Pl, P2, P3, P4 and four types of resources 8

Rl, R2, R3, R4. The maximum number of instances of resources of each type
s a re 5, 7 , 7 and 7 respectively. What will be the order of
processing of jobs if th.e

allocated matrix and the maximum demiilA matrix are as given below.

Allocated Mntrix Marimum Claim

RI R2 R3 R4 RI R2 R3 R{

PI 2 -) 2 J 5 6 4

P2 0 0 I 2 I J 4 6

I 4
P3 2 I
1 I 1
.P4 I 0 ? J

Page 2 of 3
 't

02000csr206052102

b) Explain how semaphores can be used to solve Readers-Writers problem. 6

l6 a) State dining philosopher's prcblem and give a solution using semaphores. Write 8

structure of philosopher.
b) Explain the methods for deadlock prevention. 6

Module -4

l7 a) Consider the following page reference string 9

' 1,2,3,4,2, 1,5,6,2, 1,213,7,6,3,2, 1,2,3,6
Find the number of page faults if there are 4-page frames, using the following
page replacement algorithms (i) LRU (ii) FIFO (iii) Optimal.

b) With the help of an example explain the concept of shared pages in a paging 5

system.

18 a) Memory is divided into fixed partitions of sizes l00KB, 500K8, 200K8, 8

300K8, 600KB in the order and all these partitions are available. Suppose

processes of size requirements 2l2KB, 4l7KB, I l2KB, 426K8 are arrived in

the system in that order. Show how the first fit, best fit and worst fit algorithms
works to place processes into partitions. Which is the best algorithm?

b) Explain the concept of a hashed page table with a diagram. 6

Module -5

19 a) Explain FCFS, SSTF and SCAN disk scheduling algorithms, using the given 9

disk queue of requests: 20,89,130,45 and 180. Assume that, the disk has 200
r plaffers ranging from 0 to 199 and the current position of head is at cylinder 100.

b) Explain the different methods used for keeping track of free disk space. 5

20 a) There are 4 domains (Dl ,D2,D3, D4) and 4 objects (files - Fl,F2, F3, F4). A 7

n process executing in Dl can read and write files Fl, F3 and F4. A process in D4
can read Fl, & write F3 and executf,F2. A process inD2/D3can read F2
read
and execute F4. A process in Dl can switch to D2 or D4. A process in }1 can
switch to D3. Draw the access matrix showing all these details.

b) How can we make a new magnetic disk ready for use (to store files)? 7

tr**

Page 3 of 3
D 02000csT206062207

Reg No.:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERS

B.Tech Degree 54 (R,S) / 52 (PT) (R,S) Examination June2023 (201

Course Code: CST 206

Course Name: OPERATING SYSTEMS
Max. Marks: 100 Duration: 3 Hours

PART A
Answer all questions, eoch canies 3 marks. Marks
I What are the major activities of an operating system with regard to file management? (3)
2 system.
Write the operations taking place during the booting of a (3)
J Explain the different buffering mechanisms used in message passing systems? (3)

4 Define the parameters for multilevel feedback queue scheduling? How it is better (3)

compared to multilevel queue scheduling?

5 What are the three conditions to be satisfied by a solution to critical section problem? (3)

6 deadlocks?
Explain with an example the improper usage of semaphore causing (3)

7 Differentiate Logical address Space and Physical Address Space (3)

8 Explain the terms (i) Dynamic Loading (ii) Dynamic Linking (3)

9 Discuss the steps in handling apage fault? (3)

I 0 How is disk formaffing done? (3)

t
*ARTB
Answer any one questionfrom each module

Module I
I I " (a) What is an Operating System? Explain any 3 types of Operating System. , (7\

(b) What is a system call? What are the different ways to pass parameters to system (7)

call? List basic types of system call with examples.

OR
l2 (a) Write notes on the following operating system structures. (8)

(i) Microkernel structure (ii) Simple Structure (iii) Layered Structure

(b) Describe the differences between symmetric and asymmetric multiprocessing. (6)
What are the advantages and disadvantages of multiprocessor systems?

Page I of4
 02000csT206062207

Module 2
13 (a) Define process. With the help of a neat diagram explain different states of (7)
process.

(b) With an example, illustrate the interprocess communication using Shared (7)
memory
OR
14 (a) Assume you have the following jobs in a system that to be executed with a (8)
single processor. Now,

Process ID Arrival Time Burst Time (ms)

PO 0 75

PI l0 40
P2 l0 25

P3 55 30
P4 95 45

i) Create a Gantt chart illustrating the execution

ii) Find the average waiting time
Iii) Find the average turnaround time
For the above processes, when the system uses
a) Preemptive Scheduling b) RR Scheduling (Time Quantum: 15 ms)
(b) What are threads? What are the benefits of multithreaded programming? List (6)
the ways of establishing relationship between user threads and kernel thread.

Module 3
15 (a) Explain Dining Philosophers Problem. Give a solution for the problem using (6)
monitors. .
(b) What do you mean by deadlock? WHat are the four necessary conditions for a (8)
deadlock to occur? Describe various deadlock prevention mechanisms.

OR
16 (a) What is a semaphore? Describe how semaphores can be used as a process (7)
synchron isation mechanism?
(b) Consider the following snapshot of the system with five processes Pl. P2, (7)
P3,P4,P5 and four resources A, B, C, D. Using Bankers Algorithm, check
qhether the system is in safe state or not.

Page2 of 4
 02000csT206062207

Allocation Max Available

A B c D A B c D A B C D
a
PI I 0 2 2 J 2 5 2 J 0 0 I
P2 0 2 I 2 J 4 2
P3 2 4 ) 0 2 7 7 J

P4 J 0 0 0 5 5 0 7
a
P5 4 2 I J 6 2 I 4

Module 4
17 (a) With the help of a diagram explain how logical address is translated to physical (5)
address in case of segmentation scheme.

Consider the following segment table of a process.

Segment Base Limit

0 2t9 600
I 2300 t4
2 90 100
J 1327 580
4 1952 96
Computetheresultantphysica|addressesforthef@
(i) 0,430 (ii) l, l0 (iii) 2,500 (iv) 3,400 (v) 4, tt2
| (b) consider the following page reference stream, R:3, 2, 4,3, 4,2,2,3, 4, 5, 6,7, (9)
7, 6, 5, 4, 5, 6,7,2, l. Assuming demand paging with three frames, how many
page faults would occur for the following page replacement algorithms.

i) LRU replacement ii) FIFO replacement iii) optimalreplacement

" OR* .

l8 (a) Define Demand Paging. Explain Swapping with a neat diagram. (6)
(b) Consider a fixed partitioned memory management scheme with fixed partitions (S)
are 150K,300K,550K,400K,250K and 200K (in order). Five processes are
ready for execution each with memory requirement as Pl(240K), p2(120K),
P3(380K), P4(300K) and P5(350K). Write the allocation in each of rhe
following cases and calculate the internal fragmentation and external
fragmentation (if any) in each case.
(i) First Fit (ii) Best Fit (iii) Worst Fit

Page 3 of4
 0200(rcsT2060622W

Module 5
19 (a) List out the logical structtrres of a directory with figures. (5)
(b) With neat sketches illustrate the following disk space allocation algorithms (9)
(i) Contiguous allocation (ii) Linked allocation (iii) Indexed allocation?
OR
20 (a) Discuss Protection. Write notes about the protection strategies provided for (6)
files.
(b) Consider a disk queue with requests for VO to blocks on cylinders 98, 183, (8)
41,122, 14, 124,65,67. The head is initially at cylinder number 53. The
cylinders are numbered from 0 to 199. Find out the total hcad movement
incurred while servicing these requests, if following scheduling algorithms ar€
.I
used-(i) FCFS (iD SSTF (iiD C-SCAN (iv) LooK

Page 4 of4
 r EDUn\
c 02000csT206062206 d-J,^r
\,
a
RegNo.: Name:

APJ ABDUL KALAIV TECHNOLOGICAL UNMRSI

Fourth Semester B.Tech Degree Examination June 2022 (2019

Course Code: CST206

Course Name: OPERATING SYSTEMS
Max. Marks: 100 Duration:3 Hours
PART A
(Answer all questions; each question carries 3 morks) Marks

I Describe the role of bootstrap loader in booting a computer system. J

2 How is distinction of kernel code from user code achieved at hardware level? J

't 3 How many times will 'Forked' get printed by the below code and justiff your a
J

answer.

int main0 {
fork0;
fork0;
print("Forked\n");
return 0;)
4 List and explain the various synchronous and asynchronous methods of message 3

passing in IPC.
a
5 What is meant by race condition? Explain with the help of an example. J

6 Explain the two strategies used to recover from a deadlock. J

7 Differentiate between compile time and load time address binding. -t

8 Consider a logical address space of 256 pages with a 4-KB page size, mapped onto J

a physical memoqfbf 64 frames. Find the (i) number of bits in the logical address
(ii) number of bits in the physical address (iii) number of bits in the offset part of
logicaladdress - ,*;
9 Define seek time, rotational latency and disk bandwidth of disks. J

l0 Explain two level directory structure with the help of a diagram. J

PART B
(Answer onefull questionfrom eoch module, each question corries 14 marks)

Module -l
I I a) What is the purpose of a system call? Describe how a system call made by a user
application is handled.

Page 1 of 3
 02000csr206062206

b) Explain the micro kernel approach to system design with the help of a diagram. 7

How do user programs andkernel services interact in microkernel architecture?

12 a) Describe in detail about the various functions of Operating systems. 12

b) What are the advantages of multiprocessor systems? 2

Module -2
13 a) What is meant by context switching? Illustrate the timeline of context switching 6

between two processes using PCBs with the help of a diagram.

b) Differentiate between the following schedulers. 8

(i) Short-term and long term scheduler

(iD Pre-emptive and non-preemptive scheduler

,l 14 a) Assume you have the following jobs shown in the table to execute with one 9

processor. Draw the Gantt chart and calculate the average waiting time and average

turnaround time if the system uses the following scheduling algorithms

(i) Preemptive priority scheduling (ii) Nonpreemtive priority scheduling
(iii) Non-preemptive Shortest Job first scheduling.
Assunie higher priority is indicated with lower numbers.

Process Arrival CPU Burst Priority

Time(ms) Time(ms)
PO 0 4 J

PI 2 5 1

P2 3 I I
P3 4 3 4

b) Explain the different states of a process and transition between them with the help 5

of 6 diagram

Module -3
15 a) What is a critical section? State and'exp*ain the conditions to be satisfied by'a 6

solution to the critical section problem.

b) Illustrate how resource allocation graph can be used to (i) detect deadlocks and (ii) 8

avoid deadlocks.
16 ,a) $rite the algorithm or pseudocode for solving the Dining-Philosophers problem 5

using semaphores. Is the solution prone to deadlocks or starvation? Discuss.

b) Given the following snapshot of a system at time T0. 9

Page 2 of 3
 02000csT206062206

Allocation Max Availahle

A B c D A B c D
PO t
I-ATBTCIilI
0
P1 I
0
0 0
0
I
0 1
l-f-sl-:l-tl
t 0 ? 0
P2 I f 4 ,|
.) f, 6
P3 0 6 -] 0 6
.r
P4 0 0 It 4 0 6 6

Find whether the system is in a safe state

using Banker's algorithm. Ifpl generates
a request for (0,4,2,0), can the request
granted
be immediatelv?
Module -4
17 a) calculate the number of page faults for
the following reference string with three
,f page frames, using the following
algorithms.
9,2, 3, 1,2, 5, 3, 4, 6, g, g, l, 0, 5, 4, 6,2, 3,
0,I
(i) FIFO (ii) Optimat(iii) LRU
b) compare the memory organization schemes
of pure paging and pure segmentation
with respect to the following issues: (i) External
Fragmentation (ii) Internal
Fragmentation
l8 a) Explain how a process larger than the physicat
memory can be executed with the
help of virtuar memory. Describe the
concept using demand paging.
b) How does transration rook-aside bufrer (TLB)
herp to speed up the page access?
Illustrate address translation using TLB.

r Module _5
l9 a) List and explain the difrerent access methods for files_
4
b) Describe linked ard indeled allocation methods for files
with the help of neat t0
diagrams.
20 " a) suppose that a disk drive has 200 cylindersnupbered
from 0 to 199 and the curent 9
position of the head is at cylinder 100.
For the given disk queue of requests: - 20,
89, 130, 4s, 120 and rg0, draw the head
movement in FCFS, ssrF, GSCAN disk
scheduling algorithms and compute the
total head movements (in cylinders) in
each.

b) Describe the general scheme of using

three classifications of users in connection
with file access control with the help of an
example.
***

Page 3 of 3
D 02000csr20605210r

Reg No.:

APJ ABDT]L KALAM TECHNOLOGICAL TJNIVE

Fourth Semester B.Tech Degree Examination July 2021 (20

Course Code : CST206

Course Name: OPERATING SYSTEMS
Max. Marks: 100 Duration: 3 Hours
i'
PART A
(Answer all questions; each question carries 3 marks) Marks
I Which are the three methods used to pass parameters to operating system ? 3
('
2 Write three advantages of peer-to-peer system over client server system. )a
a
J Differentiate Pre-emptive and Non-pre-emptive scheduling giving the 3

application of each of them.

4 Why is context switching considered to be an overhead to the system?
5 What are necessarv conditions which can lead to a deadlock situation rna
system?

6 Explain the wait and signal operations used in semaphores. J

7 Horv does srvapping result in better memor\ management?

8 Explain the concept of virtual memory. Write one memory management scheme J

which supports virtual hemory.

9 Compare sequential access and direct access methods of storage devices.
l0r Write notes on disk formattins.

PART B
(Answer one full question from each module, eoch question camies 14 marks)
, Module -1
l1 a) Distinguish among the following terminologies associated with the operating 9

system and explain each of them in detail.

(i) Multiprogramming systems (ii) Multitasking systems
S

(iii) Multiprocessor systems.

b) Explain, how the long-term scheduler directfy affects the system performance. 5

l2 a) systems.
Explain in detail about the various functions of operating 6

b) Write notes on the following operating system structures. 8

(i) Layered approach (ii) Microkemel

Page 1 of 3
 02000csT206052t0t

Module -2
l3 a) A writer process like to send some bulk information to a reader process. Explain 8
the IPC mechanism that can be used for this purpose.
b) How many child process will be created for the following code ? 6
void main0 { fork0; fork0; prinr("HELLO\n,,); fork0;
printf("WELCOMEVT); )
How many times HELLO and WELCOME will be printed? Justify your answer.

,,, tO a) FivebatchjobsAthroughEarriveatacomputersystemintheorderAtoEat 12
almost the same time. They have estimated running fimes of 6, 4, 1,3, and 7

\
seconds. Their (externally determined) priorities are 3, 5, 2, l, and 4
respectively, with 5 being the highest priority. For each of the following
scheduling algorithms, determine the average process waiting time. Ignore
process switching overhead.

(i) Round Robin (assume quantum :2 sec) (ii) First-come first-served

(iii) Shortest job first (iv) priority scheduling
b) Point out the significance of Zero capacity queue in IpC? 2

l\{odule -3
l5 a) Consider the following snapshot of a system with five processes Pl , P2, p3, p4, 8
P5 and fout resources A, B. C. D. \\'hat is the total number of instances of A. B.
C, and D? Using Bankers Algorithm check whether the system is in safe state
or not.

Allocatian lvlax Availablc

A. B C D A l] L D 1-t 13 C: D
PI I 0 z .{. J r 5 ? 0 () I
I

P2 0 2 t _1 4 z
P3 2 4 5 0 ? I 7
P4 '.1 0 0 0 5 5 0 I
I I
F5 4 2 J 6 ? 4

b) What is critical section problem? What are the requirements that need to be 6
satisfied by any solution to critical section problem? Give a solution to a 2
process critical section problem.

16 a) Describe the Bounded - buffer problem and give a solution for the same using 8
semaphores. write the structure of producer and consumer processes.

Page 2 of 3
 02000csT206052101

b) why is deadlock state more critical than starvation? Draw the resource
6

allocationgraph(i)withdeadlock(ii)withacyclebutnodeadlock.
Module -4

|7a)Explainwiththehelpofsupportingdiagram,howtranslationlook-asidebufferS
(TLB) improves the performance of a paging system'
-b)Withadiagramwritethestepsinvolvedinhandlingapagefault.6
For a 9
l8\r, a) Consider the page reference string 1,2,3,4,2,1,5,6,2,1,2,3,7'6'3'2'l'2'3'6'
system with 3 frames compute the number of page
faults for the following page

q replacement methods: (i) FCFS (ii) Optimal (ii) LRU'

b) Consider the following segment table: 5
'if
Segment Base Address Length

0 L00 400

1 3700

2 700

3 2500 500 I
I

ir
4 15OO 1000

wing logical addresses?

.t
(i) 4,350 (ii) 2, 100 (iii) 3,70 (iv) 0,25 (v) I' 130

Module -5
' using the given 9
19 a) Explain FCFS, SSTF and scAN disk scheduling algorithms,
the total seek time for
disk queue of requests: 82,170,43,140,24,16,190. Find
0 to 199 and
each case.Assume that, the disk has 200 cyrinders ranging from

the current position of head is at cylinder 50'

b) Explain indexed allocation method with an examfle'

t0
20 a) Explain the different directory structures used in file system'
b) Different users may need different types of access to a file
or directory' Explain 4

themostgeneralschemetoimplementidentitydependentaccess.
***

Page 3 of 3
 D 0200ocsT206062204
t+-
?}
RegNo.: ol
t
APJ ABDUL KALAM TECHNOLOGICAL
B.Tech Degree 54 (S, FE) / 52 (PT) (S) Examination January

Course Code: CST 206

Course Name: OPERATING SYSTEMS
Max. Marks: 100 Duration: 3 Hours
PART A
(Answer all questions; each question carries 3 morhs) Marks
I Define Operating System. Mention its purpose and objectives. 3
2 which are the three methods used to pass parameters to operating system? J
J With a figure, explain how process is created using fork 0 system call? 3
4 What is the use of Process Control Block (PCB) in operating system? J
5 What is meant by critical section? What is critical section problem? 5
6 Explain with an example, how waitfor graph is used to detect deadlocks? a
J

7 Does paging suffer from fragmentation? Justiff your answer. 3

8 consider a logical address space of 64 pages with 1024 bytes per page mapped a
J
to a physical memory of 256 frames. Calculate the
(i) Number of bits required for logical address.
(ii) Number of Bits required for physical address.
)g Define the terms i) Seek time ii) Rotational delay iii) Disk bandwidth. J
l0 Briefly explain about file attributes. a
J

PART B
(Answer onefall questionfrom each module, each question corries 14 marks)

Mo@le -1 I
II a) Explain the features of single processor, multiprocessor and clustered systems? g

b) What do you understand by system calls? List and explain the system calls used 5

a in process control. c ir .,
12 a) Describe the services provided by an operating systems in d€tail. g

b) " With a figure, explain the microkernel architecture? 5

Module -2
l3 a) Draw the Gantt Chart, Calculate the average waiting time and average turnaround g

Page 1 of 3
a-v

02000csT206,062204

. time for the processes given in the table, using the following algorithms:
i) SJF iitSRTF iii) RR (time slice = 4 ms)

Process Arrival Time (ms) CPU Burst Time(ms)

PI 0 l0
P2 2 6
a
P3 J 4

P4 6 2
P5 l0 8

b) What is a process? With the help of a ai"@rocess 5

states.

14 a) Discuss briefly the various issues involved in implementing Inter process 8

Communication (IPC) in message passing system.
b) Describe the differences among shoft-term, medium-term and long term 6
scheduling.

Module -3
15 a) Discuss about any two classic problems of synchronization. How producer 8
consumer problem is solved using semaphores?
b) Describe the various methods of recovery from deadlocks. 6
16 a) Consider the following snapshot of a system with five processes pl, p2, p3, p4, I 0
P5 and four rcsources A,B,G,D. using Bankers Algorithm, find the following

i) How many resources of type A, B, C, D are there?

ii) Calculate the Need Matrix.
iii) Is system is safe state? If yes, find the safe sequence?
iv) If the request from P2 arrivessr (0,3,2,0), Can the request be
immediately granted?
Process Allocation Max Available
'ABCD ABCD 'ABCD t
Pl 00t2 0012 t520
P2 1000 1750
P3 1354 23s6
P4 0632 0652
P5 0014 0656

Page 2 of 3
 0zo(Xrcsr206062204

' b) Describe how the compare_and_swap 0 instructions can be used to provide 4

mutual exclusion that sihisfies the bounded waiting requirement.

Module -4
17 a) Explain the First-fit, Best-fit, and Worst-fit algorithms for contiguous memory 8

allocation.
b) With a diagram, write the steps involved in handling a page fault. 6
' l8 a) Considerthereference string: 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. 9
Assuming demand paging with 3 frames, how many page faults would occur for:-

D FIFO replacement algorithm

. ii) Optimal replacement algorithm
iii) LRU replacement algorithm
What is the hit Ratio for the above algorithms?
b) Differentiate between Internal Fragmentation and External Fragmentation. 5

Module -5
19 a) Systems?
Discuss the concept of Virtual File 8

b) Explain how access matrix is used as a protection mechanism. 6

20 a) Assume that a magnetic disk has 400 cylinders (numbered 0 to 399). The cunent 9
position of the head is at cylinder 120. The request queue is 80, 130, 60,230,
100, 300, 250, and 170. Draw the head movement in each of the following disk

cheduling algorithms and compute the total head movement in each case:
(i) ssrr (ii) scAN (iiD LooK
t b) What are the different access methods of files? How are they implemented? 5
***

Page 3 of 3
 D 0200csT206052402

RegNo.: Name:

APJ ABDUL KALAM TECIINOLOGICAL UNIVERSITY

B.Tech Degree 54 (S, FE) / 52 (PI) (S, FE) / 54 (WP) (S) Examination December

Course CaiUsSeST206
Course Name: OP,$R#TING SYSTEMS
Max. Marks: 100 Duration:3 Hours
PART AI..
marks)
(Answer all questions; eucn question canies 3 Marks

I Differentiate single processor and multip.r_ssor systems. 3

2 Explain the steps taking place in bootifig. 3

3 Explain the difference types of scheduling queues. 3

4 How many times "hello" will be printed"ifter executing the following code. 3

Justiff your answer.

void mainQ

fo*0;
fork0;
fo*0;
printf("hello\n");

)
'5 Explain the necessary conditions for a deadlock 3

6 What is a monitor? 3
'7 Explain Belady's anomaly with an exalRle? 3

.8 Does segmentation suffer from fragmentation? J0stiff your answer. 3

9 Explain two level directory sffucture wj$ an example. ' 3

l0 Define the terms seek time, rotational latency and transfer time. 3

PART B
(Answer onefall questionfrom eoch module, eoch qaestion carries 14 morhs)

Modulo-l
ll a) What is a system call? Explain any three different types of system call. 9

b) Explain the dual mode operations of operating system. 5

Page 1 of 3
9
I
 0200csr206052402

12 a) Explain the following operating system structures with suitable diagrams 9

(i) Simple (ii) Layercd (iii) Microkernel.

b) What are the major functions of operating system related to process management. 5

Module -2

13 a) Calculate the average waiting time and tumaround time for the processes given in 9

the following table after displaying the Gantt charts for the following scheduling
algorithms
a) Non-pre-emptive SJF b) Pre-emptive SJF c) RR scheduling (time slice:4 ms)
Process Arrival time (ms) CPU burst time (ms)

P1 0 l0
n 2 6

P3 3 4

P4 6 2

P5 t0 8

b) Explain the different process states with a suitable diagram. 5

14 a) Differentiate between the following 8

(i) Short term scheduler and medium-term scheduler

(ii) Pre-emptive and non-pre-emptive scheduler.
b) Explain shared memory model IPC mechanism with a suitable example 6

Module -3

15 a) Consider the following snapshot of a system in which four nesources A, B and C l0

are available.
Allocation Max Need Available

A B c A B C A B c A B c

Po 0 0 7 5 3 3 3 2
Pl 2 0 0 3 2 2
Pz 3 0 2 9 0 2
Pr 2 I I 2 2 2
Pr 0 0 2 4 3 3

Do the following problems using banker's algorithm.

a) Compute what each process must still request and fill this under the column
Need.
b) Is the system in a safe state? Why or why not?
c) If a request from Pr arrives for ( I ,0,2), can the request be granted immediately?

Page 2 of 3
?
I
 0200csT20ffi52402

b) Describe how test and set instruction can be used to provide a solution to critical 4
section problem. .

16 a) Explain dining philosophers' problem. How it can be solved using semaphores? 8

b) Explain with an example how wait for'gtrph can be used to detect a deadlock. 6

Mridul'e-4
17 t), Consider the page reference string 7,0,1,2,0,3,0,42,3,0,3,2,1,2,0,1,7,0,1. For a 9
,', system with 3 frames compute the number of page faults for the following page
replacemCnt algorithms (i) FIFO (ii) Optimal (iiD LRU
b) examples.
Differentiate internal and external fragmentqtion with suitable 5
:'.',
18 a) consider:,six memory partitions of siee'200 KB,400 KB, 600 KB, 500 KB, 300 9

KB and 2S0 KB. These partitions need to be allocated in order to four processes
' of size 357 KB, 210 KB, 468 KB, 491 I(8. Perform (i) First fit (iD Best fit (iii)
Worst fit.
b) Explain the concept of paging with TLB using suitable diagrams. 5

Module -5
19 a) Explain linked and indexed file allocation strategies mentioning each method's l0
advantages and disadvantages.

b) Explain access matrix with an example. 4

20 4 Suppose that a disk drive has 200 cylinders numbered from 0 to 199 and the cunent 9
position of the head is at cylinder 100. For the given queue of requests: - 20, E9,
, 130, 45, 120 and 180, draw the head movement in FCFS, SSTF and C-SCAN disk

scheduling algorithms and compute the total head movements (in cylinders) in
each.

b) Explain different file access methods.

**t
;

Page 3 of 3
3
I