RollNo.
2022371(022)
Dip. in Engg. (Third Semester)
EXAMINATION, April-May, 2024
(Scheme : NITTTR)
(Branch :CSE, IT)
OPERATING SYSTEM WITH LINUX
Time: Three Hours] [Muxlmum Marks : 70
[Minimum Pass Marks : 25
Note: All questions are compulsory. Internal choices are
given. In case of any doubt or dispute, English
version question should be trealed as final.
1. (a) Explain the need of operating system in detail.. 5
P. T. O.
Bo
(31 2022371(022)
2022371(022)
Process id Arrival Time Burst Time
[2]
Real
Operating System and
Explain Multitasking
5 P;
(6) Time Operating System. P2 1
3
P:
P4 3
Ps 4 2
Or 5
P%
(sa) If CPU scheduling policy is Shortest Remaining
Explain the operating system services. Time First (SRTF), calculate the average waiting
time and average turnaround time.
of operating system Araferfa 6ut f f gftat (4)
the process states
2. (a) Explain diagrarn. Explain the first
come
with process state
scheduling with Process id Arrival time Burst time
(FCES) CPU
first served 3, 5
|P 0
exampie.
P2 1 5
Ps 2 3
P4 3 1
Ps 4 2
P 1
Or
processes whose
Consider the following set of 6
below:
arrival time and burst time are given
P. T. O.
2022371(022)
(4) (5] 2022371(022)
how rosorce
(b) Define Deadlock. Explain Or
allocation graph can be used for deadlock (ua)
avoidance. 2, 6
Write short notes on the following :
(i) File attributes and operations 4
(ii) File system security and protection
mechanism 4
detail. 6
3. (a) Explain the concept of segmentation in
variable ()
(b) Explain the fixed partitioned and
partitioned memory allocation technique with
suitable examples. (b) Consider a disk queue where order of UO requests
is : 6
82, 170, 43, 140, 24, 16, 190
The read/write head is initially at cylinder number
Or
50. Cylinders are numbered from 0 to 199. Using
the shortest seek time first (SSTF) disk
Explain Thrashing. Explain the LRU (Least scheduling, calculate the total head movements
recently used) page replacement algorithm with (in number of cylinders).
suitable example. 3, 5
82, 170, 43, 140, 24, 16, 190
Read/write head RR. ÀHS G 50 R
4. (a) Explain the different directory structures in detail.
8
P.T.O.
9. ) tefne Viedhn Exylatn the dtteet mt ds
tmmmule in Vi wh e e*nplea 7,9
Explain the Limn wytem ndmimhtrwtm amt t4
Pesfumaitiliies.
(h) Explain the fullwing LAnun emmmats (my
(i)
(1) spli
(iv) dit
() head
(vi) grep
(vii) stt
(viil) tee
(ix) hown
(x) 2022171(42)
