Scribd
Upload
8 views

OPERATING SYSTEM final print

The document outlines an examination paper for Operating Systems for NEP-BCA 3rd Semester, consisting of three parts with varying question formats and marks. Part A includes short answer questions, Part B covers more detailed explanations, and Part C requires in-depth analysis and problem-solving related to CPU scheduling, file protection, and disk scheduling algorithms. The total marks for the exam are 60, with a time limit of 2½ hours.

Uploaded by

kkabhinav01
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
8 views

OPERATING SYSTEM final print

The document outlines an examination paper for Operating Systems for NEP-BCA 3rd Semester, consisting of three parts with varying question formats and marks. Part A includes short answer questions, Part B covers more detailed explanations, and Part C requires in-depth analysis and problem-solving related to CPU scheduling, file protection, and disk scheduling algorithms. The total marks for the exam are 60, with a time limit of 2½ hours.

Uploaded by

kkabhinav01
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/ 1

OPERATING SYSTEM

NEP-BCA 3rd SEM


Time:2½ Hour Max.Marks:60
PART-A
Answer any 4 Questions. Each question carries 2 marks. (4x2=8)
1. What is Operating System? Mention any two goals of OS.
2. Define page fault and fragmentation.
3. What is disk formatting?
4. What are different methods for handling deadlock?
5. What is a directory?
6. Mention the various types of Files.
PART-B
Answer any 4 Questions. Each question carries 5 marks. (4x5=20)
7. What is Semaphore? Explain different types of Semaphores.
8. Explain any 5 functions of OS.
9. What is system call? Explain the working of system call with a diagram.
10. Explain different states of a process with neat diagram.
11. Define Deadlock. Explain deadlock prevention and avoidance.
12. Explain Critical Section Problem.
PART- C
Answer any 4 Questions. Each question carries 8 marks. (4x8=32)
13. a) Explain the following CPU scheduling algorithms.
1)FCFS 2) Priority scheduling
b) Explain Demand paging.
14. a) Explain File Protection.
b) Define Booting and explain its types.
15. a) Explain various File Accessing Methods.
b) Write a note on PCB.
16. Consider the following set of process with cPU burst time in MS.

Draw the Gantt Chart, find average waiting time and turn arround time using
i) FCFS ii) SJF.
17. Explain different disk scheduling algorithms with suitable example.
18. a) Explain real time and time sharing operating system.
b) Write short notes on LINUX system.

*******************************************************

You might also like