799
CS-04/IT-04
December - Examination 2019
BA/BSC Pt.II Examination
Operating System
Paper - CS-04/IT-04
Time : 3 Hours ] [ Max. Marks :- 55
Note: The question paper is divided into three sections A, B and C.
Write answers as per the given instructions.
{ZX}e : ¶h àíZ nÌ "A', "~' Am¡a "g' VrZ IÊS>m| ‘| {d^m{OV h¡& à˶oH$
IÊS> Ho$ {ZX}emZwgma àíZm| Ho$ CÎma Xr{OE&
Section - A 7×1=7
(Very Short Answer Questions)
Note: Answer all questions. As per the nature of the question
delimit your answer in one word, one sentence or
maximum up to 30 words. Each question carries 1 mark.
IÊS> - "A'
(A{V bKw CÎmar¶ àíZ)
{ZX}e : g^r àíZm| Ho$ CÎma Xr{OE& Amn AnZo CÎma H$mo àíZmZwgma EH$ eãX,
EH$ dm³¶ ¶m A{YH$V‘ 30 eãXm| ‘| n[agr{‘V H$s{OE& à˶oH$ àíZ
1 A§H$m| H$m h¡&
CS-04/IT-04 / 200 / 5 (1) (P.T.O.)
799
1) (i) Define logical address.
Logical address H$mo n[a^m{fV H$ao&
(ii) What is kernel level thread ?
Kernel level thread ³¶m h¡?
(iii) Give examples of sharable resources.
Sharable resources Ho$ CXmhaU Xmo&
(iv) What is major problem with priority scheduling?
Priority scheduling Ho$ gmW ‘w»¶ g‘ñ¶m ³¶m h¡?
(v) What is boot strap loader?
Boot strap loader ³¶m h¡?
(vi) Name any two file system call.
{H$gr Xmo File system call Ho$ Zm‘ {bImo&
(vii) What is a Real-Time System?
Read time system ³¶m h¡?
Section - B 4 × 6 = 24
(Short Answer Questions)
Note: Answer any four questions. Each answer should not
exceed 200 words. Each question carries 6 marks.
(IÊS> - ~)
(bKw CÎmar¶ àíZ)
{ZX}e : {H$Ýht Mma àíZm| Ho$ CÎma Xr{OE& Amn AnZo CÎma H$mo A{YH$V‘
200 eãXm| ‘| n[agr{‘V H$s{OE& à˶oH$ àíZ 6 A§H$m| H$m h¡&
CS-04/IT-04 / 200 / 5 (2) (Contd.)
799
2) Define operating system. Explain how operating system acts
as a resource manager.
Operating system H$s n[a^mfm {bIo& Operating system g§gmYZ
à~§YH$ Ho$ ê$n ‘| H¡$go H$m¶© H$aVm h¡?
3) What is a process? What is the difference between a program
and a process? Explain PCB using a suitable example.
Process ³¶m h¡? Program Am¡a Process ‘| ³¶m A§Va hmoVm h¡?
PCB H$mo CXmhaU g{hV g‘Pm¶o&
4) What is CPU Scheduling? What is CPU bound and I/O bound
job? Give scheduling criteria.
CPU scheduling ³¶m h¡? CPU bound Am¡a I/O bound ³¶m h¡?
Scheduling criteria H$mo g‘Pm¶o&
5) What is deadlock? What are the necessary conditions for
the deadlock? What is the method to avoid deadlock in the
system?
Deadlock ³¶m h¡? Deadlock H$s Amdí¶H$ eV© ³¶m h¡? {gñQ>‘ ‘|
Deadlock go ~MZo Ho$ VarH$m| H$mo g‘Pm¶o&
6) Explain the difference between logical and physical address
space. Explain fragmentation.
Logical Am¡a Physical address space ‘| A§Va ~Vm¶o& Fragmentation
H$mo g‘Pm¶o&
7) Differentiate between the purpose of using cache memory &
virtual memory.
Cache memory Am¡a virtual memory Ho$ CX²oí¶ ‘| A§Va ~Vm¶o&
CS-04/IT-04 / 200 / 5 (3) (P.T.O.)
799
8) What is directory? Explain tree and acyclic graph directory.
Directory ³¶m h¡? Tree Am¡a acyclic graph directory H$s g‘Pm¶o&
9) What do you understand by Belady’s anomaly? Explain with
an example.
Belady’s anomaly go Amn ³¶m g‘PVo h¡? CXmhaU g{hV g‘Pm¶o&
Section - C 2 × 12 = 24
(Long Answer Questions)
Note: Answer any two questions. You have to delimit your each
answer maximum up to 500 words. Each question carries
12 marks.
(IÊS> - g)
(XrK© CÎmar¶ àíZ)
{ZX}e : {H$Ýht Xmo àíZm| Ho$ CÎma Xr{OE& Amn AnZo CÎma H$mo A{YH$V‘ 500
eãXm| ‘| n[agr{‘V H$aZm h¡& à˶oH$ àíZ 12 A§H$m| H$m h¡&
10) Consider the following set of process with the arrival time and
CPU burst time given in milliseconds.
{ZåZ{b{IV process Ho$ goQ> na {X¶o J¶o arrive time Am¡a CPU burst
time ({‘{b g§H$S>) na {dMma H$ao&
Process Arrival time CPU burst time
P1 0 24
P2 3 7
P3 5 6
P4 10 10
Determine the average waiting time and average turnaround
time for these processes with the FCFS and SJF.
C³V Process Ho$ {bE Average waiting time Am¡a average
turnaround time H$m ‘mZ FCFS Am¡a SJF Ho$ gmW nVm H$ao&
CS-04/IT-04 / 200 / 5 (4) (Contd.)
799
11) What are different operations performed on file? List the
attributes of file.
’$mBb na {H$E JE {d{^ÝZ Am°naoeZ ³¶m h¡? ’$mBb H$s {deofVm H$mo
gyMr~Õ H$a|&
12) What are the benefits of threads? Explain context switching of
processes and threads.
Threads go ³¶m bm^ h¡? Process Am¡a Threads Ho$ context
switching H$mo g‘Pm¶o&
13) Consider the following snapshot of the system.
{gñQ>‘ Ho$ ñZ¡nem°Q> na {dMma H$ao …-
Allocation Max Available
Process A B C A B C A B C
P0 1 0 0 6 5 3 4 3 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 1 2 1 2 2 2
P4 0 1 2 4 2 3
a) Is the given state is safe?
³¶m {X¶m JB© state safe h¡?
b) If a request from process P1 arrives for (1, 0, 2), can the
request be granted immediately? What is the content of
Need matrix ?
A‘a P1 à{H$«¶m go EH$ request (1, 0, 2) AmVr h¡ Vmo ³¶m request
VËH$mb ñdrH$ma hmoJr? Need matrix Ho$ content ³¶m hmoJo?
CS-04/IT-04 / 200 / 5 (5)
