0% found this document useful (0 votes)
4 views2 pages

27 Operating Systems March 2023

Uploaded by

Kiran Mani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views2 pages

27 Operating Systems March 2023

Uploaded by

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

r |fiilil lffit ilt iltil ilff illt lilt NP - 316

lll Semester B.C.A. Degree ExEmination,


:XEIITIII
21
MarchlApril2AZS
(NEP Scheme)
(Freshers) (2022 - 23 and Onwards)
COMPUTER SCIENCE
Operating Systems
Time :2/z Hours Max. Marks :60
lnstruction : Answer any faur questions

SECTION _ A Gm#
\
Answer any 4 questions. Each question carries 2 marks. (4x2=$)
1. What is operating system ? Mention any two functions of OS.
2. Mention the components of OS.
3. What is deadlock ? Give an example.
4. Define paEe fault and fragmentation.
5. Mention the various types of files.
6. What is disk formatting ?
SECTION _ B
Answer any 4 questions. Each question carries 5 marks. (4x5=20)
7. Explain different states of a process with neat diagram.
8. Explain critical section problem.
9. What is Semaphore ? Explain different types of Semaphores.
10. Explain first fit, best fit and worst fit allocation of memory.
1 1. ExBlain various file acSessing methods.

12. Explain the disk structure.


SECTION _ C
Answer any 4 questions. Each question carries B marks. (4x8=32)
13" a) Explain real time and time sharing operating system.
b) Write a note on PCB. $+al
14. a) What is system call ? Explain its types.
b) Discuss the deadlock prevention and avoidance. (a+a)

P.T.O.
NP - 316 ililItillllilrulllililffililtilt

15. consider the following set of process with cPU burst time in MS.

Proeess CPU Burst time


P1 5
P2 10

P3 6

P4 2

Draw the Gantt Chart, find average waitinE time and turn arround time using
i) FCFS ii) sJF. I
16. a) Explain different fragmentation.

b) Write a short notes on demand paging. g+a)


17. a) Explain File protection.

b) Describe the different directory structures. ( +4)

18. Explain different disk scheduling algorithms with suitable example. I

You might also like