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