GBCS SGHIEME 18CS43

USN

Examination, June/July 2023

Fourth Semester B.E. Degree
Operating System
Max. Marks: 100
Tume: 3 hrs.
malpractce question from each nodule.
Note: Answer any FIVE fullquestions, choosing ONE full
Module-1
neat diagram.
as
treated
a. Defineoperating system. Explain the services of operating system with (08 Marks)
b What do you mean by system call? Explain the types of system call. (07 Marks)
(05 Marks)
be
will
C Define system program? Explain multiprogramming and time sharing system.
cosL9s0
blan OR
(06 Marks)
2 a. Explain the concept of virtual machine with neat diagram. (07 Marks)
b. Define process, Explain Queuing diagram representation of the process.
memory concept
C What is Inter process communication? Explain message passing and shared
of IPC. (07 Marks)

equations
/or Module-2
a Explain multithreading model with diagram. (04 Marks)
3
b What is dispatcher and dispatch latency? Explain the criteria used to select the scheduling
diagoal (07 Marks)
algorithm.
and C Calculate the average waiting time by drawing Gantt chart using FCFS (First Come First
evaluator Serve), SRTF (Shortest Remaining Time First), RR(Round Robin) (q= 2 ms) algorithms.
draw ProcessArrival Burst
compulsorily Time Time
to
appcal P
P 1 4
P: 2 9
identification,
answcrs, P4 3
(09 Marks)
your
OR
ofrevealing
complcting 4 a. What is Critical Section? What are the requirements for critical section to satisfy? (04 Marks)
b. Illustrate Petersons solution for critical section problem. (06 Marks)
C. What is Semaphore? State a dining philosopher problem give a solution using semaphore.
On Any (10 Marks)
.
Impotant
Notc
Module-3
a. What is deadlock? Explain the necessary condition for a deadlock to occur. (05 Marks)
b. Explain indetail how deadlock can be prevented. (05 Marks)
C. Determine whether the following system is safe state by using Banker's algorithm for the
SnapShot given below.

Iof2
 18CS43
8 p m

Continued

Allocation Maximum
A B C <na AB C
P ) 53 Available
P 22
P. 02 902 33 2
P, 2 1 22 2
PA 0 0 2 4 3 3
Ifa request from Pi arrives for (1,0, 2) can the rcqucsted be granted immediately? (10 Marks)
OR
6 What is paging? Illustrate with example internal and external fragmcntation problem
encountered in contigous memory allocation. (07 Marks)
b. Explain the three methods of memory allo cation. With a ncat diagram cxplain the hardware
support for relocation and limit register. (07 Marks)
C What is segmentation? Explain with a neat diagram. (06 Marks)

Module-4
7 What is demand paging? Discuss with a neat diagram steps to handle the page fault.(08 Marks)
b What is copy-on-write? Consider the reference stream 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3,
2, 1,2, 3, 6. Find the number ofpage faults using LRV and FCFS (Frames =3) (12 Marks)

OR
What is a file? Distinguish between contiguous and linked allocation methods with the ncat
diagram. (10 Marks)
b. Distinguish between single level directory structure and two level directory structurcs. What
are its advantages and disadvantages? (10 Marks)

Module-5
9 Explain various dísk scheduling algorithms indetail. (10Marks)
b. Explain access matrix method of system protection with domain as objccts and its
implementation. (10 Marks)

OR
10 a. Explain different IPC mechanism available in Linux. (06 Marks)
b. With the neat diagram, explain the different components of Linux system. (08Marks)
C. What are the design principles of Linux operating system? Explain. (06 Marks)

2 of 2