R20

QP Code: R20A31CS03

Anurag University
B Tech III Year I-Semester Supplementary Examinations, May-2023
Course: Operating Systems
(Common to CSE, CSE-DS, CSE-CS & IT)

Time: 3 Hours Max Marks: 60

Section –A (Short Answer type questions)
• Answer all questions: (10 x 2 =20 Marks)

1. What is an Operating system? What are the various OS Components?

2. What are the goals of operating system?
3. What is a scheduler process? Explain its role.
4. What are the necessary conditions for the Process synchronization?
5. What are the four conditions required for deadlock to occur?
6. Differentiate between unsafe state and dead lock state.
7. Distinguish between internal and external Fragmentation
8. Define Thrashing.
9. Write down the principles of protection
10. Discuss the objectives for a file management system.

Section—B (Essay answer type questions)

• Answer all questions: (5 x 8 =40 Marks)

11. A) Explain about the structure of OS. Explain about the services of operating
system.
OR
B) What is the need for system calls? Explain the types of system calls provided
by an operating system with respect to memory management.

12. A) Explain FCFS, RR and SJF scheduling algorithm with illustrations.

OR
B) What is a semaphore? Explain how producer-consumer problem is solved
using semaphores with example pseudo code

13. A) Consider the following snapshot of a system:

Allocation Max
Processes A B C D A B C D
P0 0 0 1 2 0 0 1 2
P1 1 0 0 0 1 7 5 0
P2 1 3 5 4 2 3 5 6
P3 0 6 3 2 0 6 5 2
P4 0 0 1 4 0 6 5 6
Answer the following questions using the banker’s algorithm:
a) What is the content of the matrix Need?
b) Is the system in a safe state?
c) If a request from process P1 arrives for (0, 4, 2, 0) can the request be granted
immediately?
P.T.O
 OR
B) A system has 3 devices D1, D2 and D3 and 3 processes P1, P2, and P3. P1 is
Holding D1 and waiting for D3. P2 is holding D2 and waiting for D1. P3 is
holding D3 and waiting for D2. Draw resource allocation graph and wait-for
graph. Is the system in deadlock state or not? Explain.

14. A) Consider a swapping system in which memory consists of the following hole
sizes in memory order: 10 KB, 4 KB, 20 KB, 18 KB, 7 KB, 9 KB, 12 KB, and 15
KB. Which hole is taken for successive segment requests of: (i) 12 KB (ii) 10 KB
(iii) 9 KB for first fit, best fit, worst fit, and next fit approaches.
OR
B) i) What is the need of demand paging? Explain briefly.
ii) Explain in detail about segmentation on with paging technique.

15. A) Discuss about directory and disk structure in detail.

OR
B) Discuss file access methods with suitable examples