Operating Systems July 2023

Download as pdf or txt
Download as pdf or txt
You are on page 1of 2

Code No: R2021052 R20 SET - 1

II B. Tech I Semester Supplementary Examinations, July - 2023


OPERATING SYSTEMS
(Com to CSE, CST,IT,CSE(CS),CSE(IOTCSBCT), CSE(IOT),CS)
Time: 3 hours Max. Marks: 70
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~

UNIT-I
1 a) What are the various components of Operating System structure? And explain [7M]
simple layered approach of Operating System in detail.
b) i. Discuss the essential properties of Time sharing and distributed systems. [7M]
i. What is a system call? Explain how a user application invoking the open
() system call is handled.
Or
2 a) i. With a neat diagram describe how a modern computer works? [7M]
ii. Discuss briefly about the typical functions of an OS Kernel.
b) What system calls have to be executed by a command interpreter or shell in [7M]
order to start a new process? Discuss briefly various types of system calls.
UNIT-II
3 a) State critical section problem? Discuss three solutions to solve the critical [7M]
section problem.
b) Assume 5 processes arrived at 1, 2, 3, 4, with burst times 4, 2, 8, 6, 3. [7M]
Implement preemptive scheduling algorithms and compare the performance.
Or
4 a) What is the role of Scheduler? What requirement is to be satisfied for a solution [7M]
of a critical section problem? Explain briefly.
b) Describe various types and operations of semaphores. Give the solution for [7M]
producer – consumer synchronization problem with semaphores.
UNIT-III
5 What is the need of Page Replacement? Consider the given reference string [14M]
7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1. Find the number of Page
Faults with FIFO, Optimal Page replacement and LRU with four, five frames
which are empty initially. Which algorithm gives the minimum number of page
faults? Discuss.
Or
6 a) i. What is the need of demand paging? Explain briefly. [10M]
ii. Explain in detail about paging technique and its implementation.
b) Explain how protection can be ensured using paging. [4M]

1 of 2

|''|''|||''|'''|||'|
Code No: R2021052 R20 SET - 1

UNIT-IV
7 a) Explain banker’s algorithm for deadlock avoidance with an example. [7M]
b) Compare the performance of write operations achieved by a RAID level 5 [7M]
organization with that achieved by a RAID level 0 organizations?
Or
8 a) What are the objectives of file management system? Explain file system [7M]
architecture.
b) What is deadlock? Explain the conditions that lead to deadlock. Characterize it [7M]
with graph.
UNIT-V
9 a) Compare and contrast the terms external and operational security in the context [7M]
of operating systems.
b) Explain the protection mechanism illustrating the use of protection domain and [7M]
access control list.
Or
10 a) Explain the importance of Memory protection in multiprogramming systems. [7M]
b) i. Define Protection Domain with Example. [7M]
ii. Explain about C-List with Example.

2 of 2

|''|''|||''|'''|||'|

You might also like