Os QP
Os QP
of
revealing5
PARDB
a What is virtual memory? How the yirtuàlmemory is inmplemented? (04 Marks)
b State and
explain the principle oflocality reference of a process. (06 Marks)
C. A page reference string and referencé timing string for a process P as follows :
AIIy
Page reference string :0,0 2, 0, 1, 2---.
Reference timing string : t 2, ts, t4, ts, tó, ty -
Illustrate the operation:of optimal, FIFO and LRU page replacement policies.
Assume there are3 page frames allocated to process.
(10 Marks)
l of 2
2 0 1
0 8
8: 5 3 .
10EC65
(04 Marks)
for the
Explain the fundamental technique ofscheduling. scheduling scheme
(10
Marks)
7
ofnon-preemptive
b. Explain the operation of HRN (Policy come in this scheme.
following table. How starvationzis over
Processes P P2 Ps RPP;
Arrival Time02 48
Service Time 33T3S2 5 summarize its operations. (001M4
features ofpfiorty based scheduling and
C. List the main (04 Marks)
8 in message passing.
a. What is message passing? Explain the issues and
(08 Marks)
mailbox explain its advantages.
b. Ilustrate the message passing usingcommunication
(08 Marks)
in UNIX operating system.
C. Discussthe inter process message
: 5 3
USN 10EC65
evaluator
C. Explain memory compaction'andmemory fragnen tation. (06 Marks)
draw
PART -B
compulsorily
to
appeal
a.
Find the numberoftpage fault for following page referençe tring using FIFO and LRU page
replacement polfçis. Assume there irethree page frames for allocation and first three pages
accounts for page fault.
identification,
answers, Referençe stYing : 5, 4, 3, 2, 1,3, 5, 4, 3, 2, 1,5., (08 Marks)
b. Explain with diagram demapd paging. (08 Marks)
your
C. Explajn page sharing. (04 Marks)
of
completing a. Explain facilities provdedby file system andTÓCS layers. (08 Marks)
revealing b Describe operationpefformed on files. (06 Marks)
Write note on UNX file system. (06 Marks)
On Any 7 a. Explain witk block diagram evenf bandling and scheduling. (08 Marks)
1. 2. b. Describe fmechanism and policý modules of process scheduler. (06 Marks)
:
Note C. Consider four processes P), P2, P3, and P4 with burst time 3m sec, 6m sec, 4m sec and
Important
2m sec enters scheduler An.order P1, P2, P3, P4. Calculate waiting time, average waiting
time, turnaround time and average turnaround time using FCFS scheduling method. assume
all process arrive at 0 msec. (06 Marks)
as PART-A
treated
a. Explain the batch processing system with advantages and disadvantages.
(10 Marks)
1
pages.
be b. Explain the goals and functions of operating system. (10 Marks)
will
blank
50,
design. (10 Marks)
=
remainíng
42+8 2 a. Explain the differences between mono lithic and layered based (10 Marks)
b. Explain micro kernel based operating system.
eg,
the written (10 Marks)
on 3 a. Explain programmers view and operating system view of processes. (10 Marks)
lines
equations b. Explain the difference between the threads and processes.
cross
contiguous memory allocation.
/or
diagonal 4 a. Explain the difference between contiguous and non (10Marks)
and (10 Marks)
evaluator b. Explain kernel memory allocation.
draw
compulsorily PART -B
to
appeal
(10 Marks)
a Explain virtual memory using paging.
identification, (10 Marks)
answers, b. Explain page replacement policies.
(10Marks)
On Any a Describe the real time scheduling. (10 Marks)
1. 2. b. Explain process scheduling in UNIX.
:Note
(10 Marks)
Important a. Explain message passing with example. UNIX example. (10 Marks)
b. Describe various interprocess communication schemes with
USN
LI9RARY jÐBCS
"A526217,
Sixth Sem ester B.E. Degree Examination,
Dec.2016/Jan.2017
Operating Systems
Time: 3 hrs.
Max. Marks:100
(04 Marks)
Message Control Block (IMCB). (07 Marks)
a. Explain Interprocess
mailboxes. Give the advantages of
mailboxes.
(09 Marks)
b. Write a note on communication features supported by unix.
the three interprocess
C. Explain
N
SI TUTE
10EC65
Sixth Semester B.E. Degree DRARY June/July 2016
4
Examinåtioi,
Time: 3 hrs. Operating Systems
maipractice. Note: 4nswer FIVE full Max. Marks:100
at least TWO questions, selecting
questions from each part.
a
Definc OS. What are the common tasks PART- A
as
trcated b. Explain briefly, the
different classes of
performed by an operating systemn (08 Marks)
concepts. operating system, with primary concern and key
be C.
What are the operations performed by Kernel (08 Marks)
will 2
when an interrupt occurs? (04 Marks)
a
Explai1 :() Monolithic OS and (ii)
50, Specifying advantages Microkernal OS
and dis-advantages in each case.
42+8= b. Define the fo llowing (08 Marks)
with respect to an operating system: }
(i) Policies and mechanisms.
eg, C
Briefly explain the concept ofVMOS,()withPortability and EXtensibility
an example
(08 Marks)
written 3 (04 Marks)
a. Briefly explain four kinds of process
b. With state interactign
transition diagram, explain the stat (06 Marks)
What are the advantages of threads? Explain transition
equations C.
for a process. (06 Marks)
briefly Kernel-level and user-level threads,
specifying advantages and disadvantages, (08 Marks)
73F
4 a. Explain Kernel memory allocator riethods. (10 Marks)
U b. What are the key features in stticatid dynamic memory
allocation? (06 Marks)
C.
Explain briefly memory compaction with an example. (04 Marks)
PART-B
5 a. With reference to virtsalmemory, explain the following:
(i) Demand paging.J () Page replacement policies. (10 Marks)
b. Explain UNIX virtudl memory. (10Marks)
6 a.
Explain file opèrations performed by processes. (08 Marks)
b. What are.¡hÇ facilities provided by file-system and IOCS? Write the layered architecture of
the sygten. (06Marks)
C. Explai() Sequential file organization (ü) Direct file access organization. (06 Marks)
7 Define Turn-around-time. Compare average Turn-Around-Time, for the following set of
process for FCFS and SRN scheduling. (08 Marks)
Process .
P P2 P; P4 Ps
Arrival time 02 3
Service time 3 2 3
b. Briefly explain process scheduling methods for real time applications. (06 Marks)
C. Explain briefly, scheduling in UNX. (06 Marks)
How interprocess com1nunication is achieved through mail-box? What are its advantages?
(08 Marks)