Maximum Marks 90
[This question paper contains 12 printed
pages.]
Your Roll No.......
Sr. No. of Question Paper: 1565 G
Unique Paper Code : 2342012302
Name of the Paper :
Operating Systems
Name of the Course :
[Link]. (H) (Computer Science)
Semester : III
Duration :3 Hours Maximum Marks :
90
Instructions for Candidates
1. Write your Roll No. on the top immediately on receipt
of this question paper.
2. Question No. 1
(Section-A) is compulsory.
3 Attempt any four questions from Section-B.
4. Parts of a question should be attempted together.
(Section A)
1. (a) Briefly explain how an operating system provides
efficiency to the system and convenience to the
end user.
(2)
P.T.0.
he 2 1565 3
1565
ion paper.
(b) A bit, called the bit. is added to the ldentify the following
hardware of the computer to indicate the current
() Processes
mode: (0) or (1). (2)
(i) Resources
IO requests, argue that
C
(c) For a given set of
LOOK algorithm will perform more efficiently than the system
(ii) ssignment and Request cdges
(3
LOOK algorithm. (2)
iputer to 2
() Give any three differences betwcen paging and
(d) List any two forms of user interface for an
segmentation schemes of memory management.
ill perform 2
operating systemn? (2)
2
(3)
(e) Consider the following resource allocation graph
alued
(g) Consider following statements executing processes
R R Pl and P2:
Pl: countert+
ability P2: counter-
(Assume that Initial value of counter-10.)
(8, 7)
Discuss the problem that can oceur due to race 3ent and
condition in concurrent execution of these
chemes of 3
processes? (3)
22: 3
R
R,
P.T.O.
20.
[Link]
1
1 paper.
1565 5
1565
FIEO (k) Diferentiate betwcen the following
(h) What is the Belady's anomaly in context of (2+2)
at the
page replacement algorithm? (3)
(i) Data Parallelism and Task Parallelism
a file "[Link]" in Unix system with
) Consider (ii) Turnaround Time and Waiting Time
IC System 2
permission bits 072 (in 3 octal system). For this
owner. uter to 2
7) file. find the access permissions allowed for
group and others. (3) (Section B) ill perform 2
6) What will be the output of the given code segment? 2. (a) Under what condition will a child process become
answer.
Briefly give reasons for your (3) an orphan process? WVhat
is the role of init)
process in the life cycle of an orphan process?
int q fork():
(2+2)
ral valued
emory". if (q 0)
(b) Give any two reasons due to which a parent
8, 7)
cout<< "n Inside the child": process may terminate the execution one of its
of
else child processes? Explain the phenomenon of
probability cascading termination with respect to parent and ment and
given X,t
child processes. Under what condition(s) will a schemes of 3
(8, 7) wait (NULL): terminated child process be known as a zombie 3
P2:
cout<< "n Inside the parent": process. (2+2+)
P.T.O.
20 Sh.
Maximum Marks 90
21. Sh
Pani
Show that the
in paper.
6 1565 7
1565
page reference string
(c) Consider the following
Segment Base Length
3 0
1
7 5 76 47 2 270 250 100
(8, 7)
1 350 40
are available. All
Assume that three frames 2 1345 350 he system 2
many page faults
frames are initially empty. How 3 1673 600 puter to 2
occur following algorithms? Show
would for the
1
What are the physical addresses corresponding ill perform 2
to
the steps.
the following logical addresses?
() FCFS page replacement algorithm
mtegral valued (i) 0, 120
memory". page replacement algorithm
(8, 7) () Optimal (ii) 1, 25
(3+3)
(iii) 2, 140
and
th probability any one limitation each of Monolithic
3. (a) Mention (iv) 3, 329
K1 given
X + approaches of Operating System
Microkernel
(4)
overcome (c) Suppose there is a system with 128KB of memory
(8, 7) design? How can the modular approach
limitations? (2+2) with no memory initially allocated. Given the nment and
cach of these
following sequence of requests by the processes, 3
1 schemes of
segment table :
show the memory layout at intermediate stages
(b) Consider the following 3
that is, after allocation/deallocation of memory for i P2:
cach process. Assume that the system uses a best
fit allocation algorithm. (7)
P.T.O.
19. [Link] Nam
[Link] Sait Sem
20. N
[Link] Dura
21.
Pandit Max
Drashant Na
Ins
12
1565
R1
P2
P1
R2
(b) Consider two
processes pl and p2. Write the
section
structure of process pl to solve the critical
that
problem using Peterson's solution? Justify
progress requirement is satisfied in this solution.
(4+3)
(1000)
21. [Link] Maximum Marks
Pandit
10 on paper.
1565 1565
advantagcs ofa a multiprogramming
ldentify any two
programming system2
(iü) Draw Gantt chart for Priority
based
Vstem over a single
(2) (preemptive) algorithm and calculate
waiting time for every process.
(4+4)
What is external
fragmnentation? Docs contiguous the system 2
memor organization scheme suffer from external (b) Consider a demand paging system with
the page nputer to 2
support your
fragmentation? Give arguments to table stored in memory. What should be the will perform
answer. (3+4) maximum page fault rate to achieve an cffective
access time of 200 nanoseconds
if the time taken
set of processes, with the
(a) Consider the following for a memory reference is 00
nanoseconds.
6
in milliseconds:
length of CPU burst time given Assume that a page fault is serviced in 10 ms.
(2+3)
Arival Time Burst Time Priority
Process 2 (c) Which scheduler controls the degree of
Pl 1 (Highest)
P2 2 multiprogramming? How? (2)
3 3
P3 nment and
P4 5
7. (a) What are the four necessary conditions for n schemes of
deadlock to occur? For the following resource d P2:
Shortest Job First
() Draw Gantt chart for
turnaround time for allocation graph, find if the system is in a deadlock
algorithm and calculate
state. Justify your answer. (4+4)
every process.
PTO.
|21. [Link] Maximum Marks 90
Pandit
1565 8
that the
Dn paper.
1565
Process Nature of Amount of memory (b) Under what conditions
the SCAN and C-SCAN
Number Request requested (in KB) algorithms perform better than
other disk
PO Allocation 20 scheduling algorithms.
3,
7) (3)
P1 Allocation 30
(c) Mention any three challenges the system 2
that may be faced
P2 Allocation 22 by a software developer 1puter to
2
in a multicore system.
PO Deallocation
(3) ill perform 2
P
Deallocation (d) In a file system, path names 2
for a file can be of
3
P3 Allocation 50 two types: absolute and relative. Differentiate
ral valued 20 giving an appropriate example.
emory. P4 Allocation (3)
8,7)
5. (a) Consider a 40-bit logical address.
37, Find the number
4 (a) For given queue of I/O requests 98, 183,
a
probability of bits required to represent the page number and
number of head
122, 14, 124, 65, 67 find total page offset fields. It
given X,t is given that the page size is
movements using 4 KB.
(8, 7) (4)
nment and
) SCAN algorithm
(b) Modern operating systems are interrupt 3
driven. 1
schemes of
Briefly explain how interrupts are signalled
(ü) C-SCAN algorithm by the 3
i P2:
operating system. (2)
Assume that the head
starts at 57 and starts
(6)
moving towards left end.
P.T.0.