GBGS SCHEME

8P 18CS43
USN

Fourth Semester B.E. Degree Examination, July/August 2022

Operating Systems
malpractice.
Time: 3 hrs. Max. Marks: 100

Note: Answer any FIVE fullquestions, choosing ONE full question from each module.
treated
as
1
Module-1
a. Distinguish between the following terms:
be i) Multi programming and multitasking.
wil ii Multi processor systems and clustered systems. (10 Marks)
50. b. Define Operating Systems. Explain dual mode of operating systems with a neat diagram.
42+8= (05 Marks)
c. Explain about system calls with an example of handling a user application invoking the
eg open( ) system call (05 Marks)
writen
OR
tinns 2 a. What is a process? Illustrate with a ncat diagram the different states of a process and control
block. (05 Marks)
b. Discuss the implementation of 1PC using message passing systems in detail. (10 Marks)
compudr
C. List and explain the services provided by OS for the user and eficient operation of system.
(05 Marks)

Module-2
3 a. Give a brief description about multithreading and explain the different multi threading
models. (05 Marks)
b. Discuss the issues that come with multithreaded programming. (10 Marks)
c. Explain CPU scheduling criteria. (05 Marks)
answes,
OR
your 4 a. Calculate the average waiting time and the avérage turnaround time by drawing the Gantt
compleing chart using FCFS, SRTE RR (q = 2ms) and priority algorithms. Lower priority number
represents higher priority.
Process| Arrival Time Burst Time Priority
P. 0 9 3
On
P: 4 2
1. P 2 9
:Note
P. 5 4
Important (12 Marks)
M section problem? What are the requirements for the solution to critical
b. What is critical
section problem? Explain Peterson's solution. (08 Marks)
MH.

lof2
 18CS43

Module-3
a. What is a deadlock? What are the necessary conditions for the deadlock to occur? (05 Marks)
b. How to prevent the occurrence of deadlock, explain in detail. (05 Marks)
c. Consider the following snapshot of a system:
Available
Process Allocation Max
A BCDABCDA BCD
P 00 1 421|23 3 21
P 3 1|2 1 S 2 5 2
P: 2 3 2 3 6
P3 1 3 1 | 2 |1 4 | 2 4
P 1|43 2 3 6 6 5
Answer the following using Banker's algorithm.
Is the system in safe state? If so, give the safe sequence.
If process P, requests (0., 11, 3) resources can it be granted immediately? (10 Marks)
OR
6 a. Explain paging hardware with TLB. (05 Marks)
b. Explain segmentation in detail. (05 Marks)
c. Discuss structure of page table with suitable diarams,. (10 Marks)

Module-4
7 a. Describe the steps in handling page faults. (06 Marks)
b. Consider the page reference string 1, 0, 7, 1, 0, 2, 1, 2, 3, 0, 3, 2, 4, 0, 3, 6, 2, 1 for a
memory with 3 frames. Determine the number of page fauts using FIFO, optimal and LRU
replacement algorithms. Which algorithm is most efficient? (14 Marks)

OR
8 a. Explain the different allocation methods. (10 Marks)
b. Discuss the various directory structures with required diagrams. (10 Marks)

Module-5
9 a
Explain access matrix method of system protection with domain as objects and its
implementation. (10 Marks)
b A drive has 5000 cylinders numbered 0 to 4999. The drive is currently serving a request at
143 and previously serviced a request at 125. The queue of pending requests in FIFO order
is: 86, 1470, 913, 1774, 948, 1s09, 1022, 1750, 130. Starting from current head position,
what is the total distance travelled (in cylinders) by disk arm to satisfy the requests using
FCFS, SSTE, SCAN, LOOK and C-LOOK algorithms. (10 Marks)

OR
10 a. With a neat diagram, explain the components of a Linux system. (08 Marks)
b. Explain the different IPC mechanisms available in Linux. (06 Marks)
c. Discuss about
HIN scheduling in Linux. (06 Marks)

-
HIN-

2 of2
HIN

HN
 GBGS SGHEME
USN 15CS64

Sixth Semester B.E. Degree Examination, Aug./Sept.

M
2020
Operating Systems
Time: 3 hrs. Max. Marks: 80

Note: Answer any FlVE full questions, choosing ONEfull question from each module.

Module-1
a. Define operating systems. What are multiproccssor systems? Explain their three main
advantages. (05 Marks)
b. Compare multi-programming and time sharing systems. (05 Marks)
C. Point out and explain the various operating system services. (06 Marks)

OR
2 a What are microkernals? Point out their advantages. (05 Marks)
b. What arc the two modcls of inter process communications? What are the strengths and
weakness of the two approaches? (05 Marks)
c. Compare and contrast, short tem, medium term and long- term scheduling. (06 Marks)

Module-2
3 a Point out and cxplain the various bencfits of multi thrcaded programming. (04 Marks)
to b. Consider the five processes arrive at time 0, in the order given, with the length of the CPU
appeal burst given in milliseconds.
Process Burst time
identification, Pi 10
P2
P: 3
your PA 7
of
completing
revealing Ps 12

Consider the FÇES, SJF and RR (quantum = 10ms) schcduling, draw the Gantt chart for
OnAny each of the scheduling. Determine average waiting time and turmaround time for all the
1. . 3 scheduling algorithm. Which algorithm would give the minimum average waiting time?
:Note (12 Marks)

Important
OR
a. What is the critical section problem point out and explain its three requirements. (05 Marks)
b. What are semaphores, explain how mutual exclusion is implemented with semaphores.
(05 Marks)
C. What is Dimming philosopher problem explain its monitor solution. (06 Marks)

lof 2
 15CS64

Module-3
5 a What are deadlocks? Point out and explain its necessary conditions. (04 Marks)
b. Explain the various methods of recovery from deadlock. (05 Marks)
C Consider a system with five processes Po through P4 and three resources types A, B and C.
Resource type A has 10 instances, resource type B has S instances and resource type C has 7
instances suppose that, at time To, the following snapshot of the system.
Allocation Max Available
A BC A B|C ABC
Po 01 0 7 5 3 33 2
PË2 0 0 3 2 2
P3 2 2
P;2 2 2 2
P.0|0 2 433
Draw the need matrix.
The sequcnce Pi, P3, P4, P2, P is safe state or not. (07 Marks)

OR
6
a. Definc paging. Explain paging hârdware with a ncat block diagram. (08 Marks)
b What is segmentation? Explain basic method of segmentation with an example. (08 Marks)

Module-4
a
What is demand paging? Explain the steps inhandling apage fault with aneat diagram.
(08 Marks)
Consider the following sequence
7,0, 1,2, 0, 3, 0,4,2, 3, 0, 3, 2, 1, 2, 0,J,7,0, 1
How many page faults occurs with thrce page frames:
i) FIFO
ii) Optial page replacement
iii) LRU page replaccmcnt algorithm. (08 Marks)

OR
a. What is a file? What are its attributes, cxplain file opcrations. (06 Marks)
b. Explain what are the different types of files. (05 Marks)
Explain file system mounting. (05 Marks)

Module-5
a. Explain various disk schcduling algorithm with an example. (10 Marks)
b. Explain access matrix protection system of0.S. (06 Marks)
OR
10 a. Explain the various. Componcnts of thc Linux system. (08 Marks)
b. Explain the process management in Linux.
(08 Marks)

HIN HN -

2 of2
 GBGS SCHENME am
USN 15CS64

Sixth Semester B.E. Degree Examination, Dec.2019/Jan.2020

Operating Systems
Time: 3 hrs.
Max. Marks: 80
alpractic Note: Answer any FIVE full questions, choosing ONE full question from each module.

a.
Module-1
What is operating systenm? Explain multiprogramming and time sharing systems. (06 Marks)
b. Explain dual mode operating in operating system with a neat block diagram. (05 Marks)
C. What are system calls? Briefly point out its types. (05 Marks)
tbe
pages.
will OR
blank
50, 2 a. Explain process states with state transition diagram Also explain PCB with a neat diagram.
-
remaining (06 Marks)
42+8 b What is interprocess communication? Explain its types. (05 Marks)
C. With a neat diagram, explain the concept of virtual machines.
eg, (05 Marks)
thewritten Module-2
on 3 a. For the proccSs listed below, draw Gantt charts using pre-emptive and non-preemptive
equations
lines priority scheduling algorithm. A larger priority number has a higher priority. Calculate
cross Average Weighing Time and Average turnaround time.
| Jobs Arrival Time Burst Time Priority
/or
diagonal
6 4
and 3
2
evaluator 3 6
draw
J4 3
compusorily
to b. Is CPUscheduling necessary? Discuss the five different scheduling
(06 Marks)
appeal criterias used in the
computing scheduling mechanism, (05 Marks)
identification, C Explain multithreading models. (05 Marks)
answers,
OR
4 a. Define semaphores. Explain its usage and implementation.
your (06 Marks)
b. Explain Reader-Write problem with semaphore in detail.
of c. What are monitors? Explain dining Philospher's solution using monitor. (05 Marks)
completing
revealing (05 Marks)
Module-3
5 a. System consists of five jobs (J1, J2, J3, J4, Js) and three resources (RË, R2, Rs).
On Any Resource type
R, has 10 instances, resource type R> has 5 instances and R3 has 7 instances. The following
1. snapshot of the system has been taken.
:Note
Jobs Allocation Maximum Available
Important Ri R2RsRi R2 R RË R2 R
J 0 107 3 3 2
J5 3
0 9
Ja 2 1 2 2
J. 0 2 4
Find need matrix and calculate the safe sequence by using Banker's algorithm.
above system is safe or not safe. Mention the
(06 Marks)
Iof 2
 15CS64

b. What is dead lock? What are necessary conditions an operating system must satisfy for a
dead lock to occur? (05 Marks)
C What is a Resource Allocation Graph (RAG)? Explain how RAG is very useful is describing
deadly embrace by considering own example. (05 Marks)

OR
6 a. What are Translation Load aside Buffer (TLB)? Explain TLB in detail with a simple paging
system with a neat diagram. (06 Marks)
b. Given the memory partitions of 100 K, S00 K, 200 K, 300 Kand 600 Kapply first fit, best
fit and worst fit algorithms to place 212K, 417K, 112K and 426K. (05 Marks)
Describe both internal and external fragmentation problems cncountered in a contiguous
memory allocation scheme. (05 Marks)

Module-4
7 a Consider the following page reference stream: 7, 0,1.2, 0, 3, 0,4, 2, 3, 0, 3, 2, 1, 2, 0, 1,7,
0, 1. How many page faults would occur for LRU and FIFO replacement algorithms
assuming 3 frames? Which one of the above is most efficient? (06 Marks)
b. Explain demand paging system. (05 Marks)
c. What is thrashing? How can it be controlled? (05 Marks)

OR
(06 Marks)
8 a. Explain briefly the various operations performed on files. HMH
-
b. Explain the various access methods of files. (05 Marks)
c. Explain various allocation methods in implementing file systems. (05 Marks)

Module-$
9 a. Explain the various Disk Scheduling algorithms with example. (08 Marks)
b. Explain access matrix method of system protection. (08 Marks)

OR
10 a. With a neat diagram explain in detail components of a Linux system. (06 Marks)
3 1-12-201 M
b.M HM the
Explain -difterent IPC mechanisms available in Linux. (05 Marks)
c. Explain pfocess scheduling in a Linux system.
MH: (05 Marks)

-
MH

-
MH

-
MH

-
MH

-
2 of2