Total No.

of
Questions :
8/ (Total No. of Printed Pages :4
Roll No
CI-502 (CSIT)(GS)
B.Tech. V Semester
Examination, November 2022

Grading System (GS)

Operating System
:
Tiime Three Hours
Maximum Marks : 70

Note: i) Attempt any five questions.

ii) Allquestions carry equalmarks.

iii) In case of any doubt or dispute the English version

question should be treated as final.

1. a) What is Buffering, explain its purpose in operating system.

Elaborate itstypes with neat and clean diagram.

b) How does the distinction between kernel mode and user

mode function as a basic form of protection system?

arrival time and

2 a) Consider the following set of process
Burst time, LARGER priority number has a higher
A
priority.

PTO
(CSIT) (GS)
CL502
 [2]

Priority
Time Burst Time
JobsArrival

(ms) 4
(ms)
J 3 5 3

J,
3 |O36 3
5ib
Draw
J,5)
the Gantt
chart
2v
and calculate
waiting time and

turnaround time usings

i)
FCFS algorithm.
scheduling
ii) Preemptive priority

loups
i) FCFS
Explain in brief.
section problem?
orb) Whatis
critical

resource. The
has 4processes
and 5allocatable
are as follows:
3. a) Asystem and maximumneeds
currentallocation

Maximum
TpETREAllocated
||0T21| 1|||2I3
2 2 0
1 1

B 20 T01 12
1

9 A 2
31
1 1

o2c1 20 10
1

1
1

1|2
1

value ofx
=[00X11], what is the smallest
2P IfAvailable
this is a safe state?
for which

fordeadlock recovery.
b) Describe the two methods

CI-502(CSIT)
(GS) 89pR y 19 Contd..

(eD)20,9
 [31
4. a)
Asystem uses 3
pageframes
main memory. for
Ituses storing
the Least process pages
page 1
replacement policy. Recently Used
are
initially Assume thatall (LRU)
empty. Whatis the page
thatwill thetotal frames
occur while numberofpage
given below processing the faults
pagereference
4,7,6,1,7,6, string
Also 1,2,7,2
calculate the
hitratio and
miss ratio.

(LRU)

4,7,6,1,7,
6,1,2, 7, 2
b) Explain the
different methods
protection. of system and
password

5. a) Consider the track

requests in the disk
132, 42, 187), queue (23, 89,
head starts at
position 100.
compute the total head Explain and
movement using the following
disk scheduling
algorithms.
i)

fSFeA
SSTF
KIR (23,89, 132, 42,
ii)

187),
C-SCAN

R qR Aar

i) SSTF
b) Explain how
ii) CSCAN
access matrix is used
mechanism? as a protection

CI-502 (CSIT)(GS)
PTO
 -t.

[4]
and
of Operating systems
6. a) State different architectures
in detail.
explain Monolithicarchitecture

with state transition diagram. Also

D) Explain process states
explain PCB with a neat diagram.

7. a) Given the memory partitions of 100K, 500K,200K,

300K, and 600K apply First fit and Best fit algorithm to
place 212K, 417K, 112K, and 426K.
Which algorithm makes the most efficient use ofmemory
and why?
100K, S00K,200K, 300K,
¿t 212K, 417K, 112K, 426K
3R 600K
VEA
> A fay
feIY First Fit

b) Define a file system. What are

various components ofa
file system? State
and explain various file
methods. allocation

8. Writeshort
notes on (AnyTwo):
a) Features ofLINUX
file system
b) Directory
Structure(Single
c) Level andTwo
Threading concept Level)
d) and its types
CPU Scheduling
Criteria

)
CI-502 (CSIT)
CPUfPrfeur

(GS)
HE
******
 Total
No.of
Questions :
8] [Total No. ofPrinted Pages : 4

Roll No
C-502 (CSIT)(GS)
B.Tech., V Semester
Examination, November 2023

Grading System (GS)

Operating System
:
Time Three Hours

Note: i) Attempt any five questions.

Maximum Marks :70

i) Allquestions carry equalmarks.

ii) In case of any doubt or disputethe English version

question should be treated as final.

1. Which type ofservices areprovided by operating System in

multiple environment? Also explain why layered approach

used for designing operating System?

2. Explain buffering and the differentways in which Buffering

can be implemented.

(GS) PTO
CI-502 (CSIT)
 [2]

3. Suppose the following jobs arrivefor processing atthetimes

indicated. Each job will run the listed amountoftime:
|Job Arival Time Burst Time

0.0
2 0.4 4
1.0

i) Give a Gantt chart illustrating theexecution ofthese

jobs
using the non-preemptive FCFS and SJF scheduling
algorithm.

ii) What isturnaround time and wait timeofeach job for

the
above algorithms?

o1 0.08 2 0.4 4

3 1.0 1

i) t-RT FCFSs str sJF syfyanfR a34T

4.What are the classicalproblems of process synchronization

ltud isloxe
in Operating System? Explain in detail.

CI-502 (CSIT) (GS)

(14
(20) Contd...
 [3]

s What is the difference

between a deadlock prevention and
deadlock avoidance methods of dealing
with a deadlock
problem? Explain the differentapproaches towards a deadlock
detection problem when :

i) There is a single instance of a resource type

i) Multiple instances of a resource type

6. Given 5memory partition of 100 kB, 500kB, 200 kB,

300kB, 600 kB (in order) how would the first fit, best ft,
worst fit algorithm place,process of 212 kB, 417 kB, 112 kB,

426 kB (inorder)? Which algorithmmakes the most efficient

use of memory?

yeRH
100 kB,500kB, 200 kB,
300kB, 600 kB> 5

212kB,417kB, 112 kB,426 kB (SpH )t SDII

H

7. What are the different page

replacement algorithms? Also
explain which page replcement
algorithm ismore efficient
and why?

CI-502 (CSIT)(GS)
PTO
 (4)

8. Explainthefollowing terms:

i) File management system

ii) Absolute path and Relative path

ii)Directory structureand direct access

****k*

CI-502
(GS)