Scribd
Upload
86 views3 pages

OS Sample Ques Paper MLRIT

Uploaded by

dhatri.ammulu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
86 views3 pages

OS Sample Ques Paper MLRIT

Uploaded by

dhatri.ammulu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

H.T NO.

R 2 MLR20
Course Code: A5CS13

MLR INSTITUTE OF TECHNOLOGY


(An Autonomous Institute)
II B.Tech. II Semester Regular/Supplementary Examination August-2023
OPERATING SYSTEM
(Common to CSD & CSM)
Time: 3 Hours. Max. Marks: 70
Note: 1. This question paper contains two parts A and B.
2. Part -A is Compulsory which carries 20 marks. Answer all Questions in part A.
3. Part -B consists 5units.Answer any one question from each unit. Each question
carries 10 marks and may have a, b, c as sub questions.

PART- A 10 x
2Marks=20M
a What are the different categories of system 2 CO
BL1
) programs? M 1
b Distinguish between CPU bounded and I/O bounded 2 CO
BL2
) processes. M 2
1 c What are the conditions under which a deadlock 2 CO
BL1
. ) situation may arise? M 3
d 2 CO
List the different file accessing methods. BL1
) M 5
e Why the bit map for file allocation must be kept on 2 CO
BL2
) mass storage rather than in main memory? M 4
a Distinguish between batch systems and time sharing 3 CO
BL2
) systems. M 1
b State the assumption behind the bounded buffer 3 CO
BL2
) producer consumer problem? M 2
2 c 3 CO
What is the purpose of paging the page table? BL2
. ) M 3
d 3 CO
Explain any four common file attributes in brief. BL1
) M 5
e Why rotational latency is not considered in disk 3 CO
BL2
) scheduling? M 4
PART – B [50M]
a Explain different operating system structures with CO
5M BL2
) neat sketch. 1
3
b CO
Discuss in detail about Distributed systems. 5M BL2
) 1
OR
a Discuss the view of an operating system as a CO
5M BL2
) resource manager. 1
4
b Explain different sub components of an operating CO
5M BL2
) system in detail. 1

5 a Consider three processes (process id 0, 1, 2 5M CO BL4


) respectively) with compute time bursts 2, 4 and 8 2
time units. All processes arrive at time zero.
Consider the longest remaining time first (LRTF)
scheduling algorithm. In LRTF, ties are broken by
giving priority to the process with the lowest process
id. Compute average waiting time and average
turnaround time of each process.
b Explain dining philosopher’s problem with a neat CO
5M BL2
) sketch. 2
OR
Page 1 of 2
a Explain the process state transition diagram with CO
5M BL2
) neat sketch. 2
6 Define semaphore. Explain the method of
b CO
application of semaphore for process 5M BL2
) 2
synchronization?

Consider the following page reference string


7,0,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0
Assuming three frames, how many page faults
a 10 CO
7 would occur in each of the following cases. BL3
) M 5
i) LRU ii) FIFO
iii) Optimal Page replacement algorithms.
Note that initially all frames are empty.
OR
a How a deadlock can be detected? Explain with CO
5M BL2
) suitable example. 3
8
b When page faults will occur? Describe the actions CO
5M BL2
) taken by operating system during page fault. 3

a Illustrate the functions of file and file system CO


5M BL2
) implementation. 5
Consider a file system where a file can be deleted
and the disk space reclaimed while the links to that
9
b file still exist. What problems may occur if a new file CO
5M BL4
) is created in the same storage area or with the 5
same absolute path name? How this problem be
avoided?
OR
a CO
Explain about directory structure in detail. 5M BL2
1 ) 5
0 b Discuss in detail about file allocation methods. CO
5M BL2
) Discuss them in detail. 5

Consider that a disk drive has 5,000 cylinders,


numbered 0 to 4,999. The drive is currently serving
request at cylinder 143, and the previous request
was at cylinder 125. The queue of pending requests,
in FIFO order, is:
86, 1470, 913, 1774, 948, 1509, 1022,
1750, 130
Starting from the current head position, what is the
1 a 10 CO
total distance (in cylinders) that the disk arm moves BL3
1 ) M 4
to satisfy all pending requests for each of the
following disk scheduling algorithms?
i. FCFS
ii. SSTF
iii. SCAN
iv. C-SCAN
v. LOOK
vi. C-LOOK
OR
1 a Discuss in detail the performance issues of 5M CO BL2
2 ) secondary storage management. 4
b Distinguish between a STREAMS driver and CO
5M BL2
) STREAMS module. 4

---oo0oo---
Page 2 of 2

You might also like