Scribd
Upload
60 views

Operating Systems

Uploaded by

pndileepmaruthi
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
60 views

Operating Systems

Uploaded by

pndileepmaruthi
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/ 3

Code No: R22A0509

R22
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
II B.Tech I Semester Supplementary Examinations, June/July 2024
Operating Systems
(CS&IT, CSE-CS, CSE-AIML, CSE-DS, CSE-IOT & B.Tech-AIML)
Roll No

Time: 3 hours Max. Marks: 60


Note: This question paper contains two parts A and B
Part A is compulsory which carries 10 marks and Answer all questions.
Part B Consists of 5 SECTIONS (One SECTION for each UNIT). Answer FIVE Questions,
Choosing ONE Question from each SECTION and each Question carries 10 marks.
***.
PART-A ( 10 Marks)
Write all answers of this part at one place
1 A Define operating system? [1M]
B Write the syntax of mkdir command and give an example for it. [1M]
C Sketch process state diagram. [1M]
D Differentiate between preemptive and non-preemptive scheduling [1M]
algorithms.
E List the various methods for handling deadlocks in a system. [1M]
F What is a semaphore? [1M]
G Compare shared memory and message passing systems for IPC. [1M]
H Define Logical Address [1M]
I Identify the various approaches for accessing a file. [1M]
J What are the operations performed on a file. [1M]
PART-B
SECTION-I
2 A Describe the characteristics of the following operating systems [5M]
i) Multi Programming Systems
ii) Real Time Systems
B What is Linux? How do Linux operating system differ from Unix? [5M]
Explain the advantages of it.
OR
3 A Explain the following services of operating system. [5M]
i) User Interface
ii) Communication
iii) Accounting
B What is a Time Sharing System? Outline the characteristics of it. [5M]
SECTION-II
4 A Why do we need to program using shell? Write a shell program to find [3M]
the reverse of a given number.
B Consider the following 4 processes with the length of the CPU burst [7M]
given in nsec.

Page 1 of 3
Process Burst Time
P1 8
P2 4
P3 4
P4 5
Find the average waiting time and average turnaround time using Round
Robin Scheduling with a time quantum of 2 nsec.
OR
5 A What is a process? Explain the operations on processes. [5M]
B Why do operating system uses a PCB? Describe the various fields of [5M]
PCB.
SECTION-III
6 A What is the purpose of resource allocation graph? [3M]
B Explain the solution for Dining Philosopher’s using semaphores and [7M]
write the pseudo code for it.
OR
7 A Consider the following snapshot of a system: [7M]

If available resources are (0,3,01). Using Banker’s Algorithm


i) What is the content of need matrix?
ii) Is the System in Safe state or not?
iii) What is the safe sequence?
B What is critical section problem? Describe the conditions a critical [3M]
section problem has to satisfy.
SECTION-IV
8 A What is Pipe? Compare ordinary pipes and message queue. [3M]
B Consider a main memory with the following sequence of page [7M]
references: 0, 1, 2 ,3, 0 ,1, 4, 0 ,1, 2, 3, 4. How many page faults does
occur using 3 page frames and 4 page frames using FIFO page
replacement?
OR
9 A Why do we need demand paging system? Demonstrate with a neat [5M]
sketch how page fault is handled.
B Given six memory partitions of 300 KB, 600 KB, 350 KB, 200 KB, 750 [5M]
KB and 125 KB (in order), how would the first-fit and best-fit
algorithms place processes of size 115 KB, 500 KB, 358 KB, 200 KB,
and 375 KB (in order)? Rank the algorithms in terms of how efficiently
they use memory.
SECTION-V
10 A Explain any three forms of directory structures organization. [5M]
B Explain various forms of the file allocation methods [5M]

Page 2 of 3
OR
11 A Describe with a neat diagram following approaches [3M]
i) Linked File Allocation
ii) Indexed File Allocation
B Suppose that a disk drive has 2000 cylinders, numbered 0 to 1999. The [7M]
drive is currently serving a request at cylinder 143, and the previous
request was at cylinder 105. 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 total distance that the disk arm
moves to satisfy all the pending requests for FCFS and SCAN
scheduling.
***

Page 3 of 3

You might also like