Code No: R20A0504 R20

MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY

(Autonomous Institution – UGC, Govt. of India)
II B.Tech I Semester Regular Examinations, February 2022
Operating Systems
(CSE, CSE-AI&ML, CSE-CS, CSE-DS & CSE-IOT & IT)
Roll No

Time: 3 hours Max. Marks: 70

Note: This question paper Consists of 5 Sections. Answer FIVE Questions, Choosing ONE
Question from each SECTION and each Question carries 14 marks.
***
SECTION-I
1 With a neat Diagram, Discuss the Architecture of LINUX Operating System? [14M]
Recall its features?
OR
2 Define Operating System? Explain various operating System Services with clear [14M]
examples?
SECTION-II
3 Discuss in detail about importance of Shells and how they contribute to execute [14M]
commands? Write a sample shell script to find greatest among three numbers
OR

4 Consider the following set of processes, with the length of the CPU burst given in [14M]
milliseconds:
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 4
P4 1 5
P5 5 2
The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at
time 0. Draw Gantt chart that illustrate the execution of these processes using the
non preemptive priority (a smaller priority number implies a higher priority)
scheduling algorithm. What is the turnaround time and waiting time of each
process?
SECTION-III
5 How Semaphores and Monitors Solve the Synchronization problem. Illustrate [14M]
them with clear examples.
OR
6 Consider the following snapshot of a system: [14M]
Allocation Max Available
--------------- ------------ -----------
ABC D ABCD ABCD
Po 0012 0 012 1520
P1 1000 1 750
p2 1354 2 356
p3 0632 0 652
p4 0014 0 656
Apply Banker’s Algorithm and determine whether the system is in safe state or
not?

Page 1 of 2
SECTION-IV
7 Define Message Queues? Write the syntax for Creation, Sending and Receiving [14M]
information by using Message Queues? Discuss with clear examples?
OR
8 Illustrate any three Page Replacement Algorithms with clear examples. [14M]
SECTION-V
9 Discuss any five system calls for file I/O operations with programming examples [14M]
OR
10 What is disk Management? Discuss the Following Disk scheduling Algorithms [5M]
with suitable examples: [5M]
a)FCFS [4M]
b)SSTF
c)SCAN
**********

Page 2 of 2
R18
Code No: R18A0504
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
II B.Tech I Semester Supplementary Examinations, July/August 2021
Operating Systems
(CSE & IT)
Roll No

Time: 3 hours Max. Marks: 70

Answer Any Five Questions
All Questions carries equal marks.
***
1 a. Explain about the components of modern computer system? [7M]
b. What are three advantages and one disadvantage of multiprocessor [7M]
systems?

2 a. Distinguish among following terminologies i) Multiprogramming [7M]

systems ii) Multitasking Systems iii) Multiprocessor systems.
b. Describe the actions taken by a kernel to context-switch between kernel- [7M]
level threads.

3 Explain different types of CPU Schedulers.

i. Preemptive and non preemptive scheduling [5M]
ii. I/O bound and CPU bound [5M]
iii. Scheduler and dispatcher [4M]

4 Five batch jobs A, B, C, D and E arrive at a computer center at almost at the [14M]
same time. They have estimated running times of 10,6,2,4 and 8 minutes. Their
priorities are 3,5,2,1 and 4 respectively, with 5 being the highest priority. For
each of the following scheduling algorithm determine the turnaround time of
each process and waiting time of each process. Ignore process switching
overhead. Mention which algorithm results in minimal average waiting time.
i) Round Robin
ii) Priority scheduling
iii) First come first served
iv) Shortest job first.

For case i) Assume that system is multiprocessing, and each job gets its
fair share of the CPU. (time quantum 2 minutes0. For cases (ii), (iii) and
(iv) assume that only one job runs at a time, until it finishes. All jobs are
completely CPU bound.

5 Consider a swapping system in which memory consists of the following hole [14M]
sizes in memory order: 12 KB, 4 KB, 24 KB, 15 KB, 9 KB, 7 KB, 10 KB, and 11
KB. Which hole is taken for successive segment requests of: (i) 14 KB (ii) 8 KB
(iii) 5 KB for first fit, best fit, worst fit, and next fit approaches?

Page 1 of 2
6 a. Describe the hardware implementation of a page table with translation [7M]
Look-aside Buffer.
b. What is virtual memory? Explain Suppose we have a demand paged
memory. The page table is held in registers. it takes 8ms to service a page [7M]
fault if an empty page is available or the replaced page is not modified,
and 20ms if the replaced page is modified. memory access time is 100ns.
Assume that the page to be replaced is modified 70% of the time. what is
the maximum acceptable page fault rate for an effective access time of no
more than 200ns?

7 Explain about the linear list and hash table data structures to implement a [14M]
directory.

8 a. A system has 3 devices D1, D2 and D3 and 3 processes P1, P2, and P3. [7M]
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.
b. Is disk scheduling, other than FCFS scheduling, useful in a single-user [7M]
environment? Justify your answer.
***

Page 2 of 2
R18
Code No: R18A0504
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
II B.Tech I Semester Supplementary Examinations, Dec-21/Jan-22
Operating Systems
(CSE & IT)
Roll No

Time: 3 hours Max. Marks: 70

Note: This question paper Consists of 5 Sections. Answer FIVE Questions, Choosing ONE
Question from each SECTION and each Question carries 14 marks.
***
SECTION-I
1 What is an Operating System? Explain the types and services of operating system [14M]
with examples.
OR
2 Define a Process. Explain the different states of a Process, Process State [14M]
transitions, and Process Control Block (PCB) in detail with a neat sketch.
SECTION-II
3 Analyze which of the following algorithms could result in starvation: FCFS, SJF, and [14M]
Priority. How to overcome the problem of starvation?
OR
4 Explain Dining Philosopher’s Problem in detail. [14M]
SECTION-III
5 Write a detailed note on internal & external fragmentation and compaction. [14M]
OR
6 Consider the following page reference strings:1,2,3,4,2,1,5,6,2,1,2,3,2,1,2,3,6 [14M]
Identify how many number of page faults would occur for the LRU and Optimal
Page replacement algorithm, assuming three frames. Remember that all frames are
initially empty, so your first unique pages will cost one fault each.
SECTION-IV
7 Explain the different file access methods in detail. [14M]
OR
8 Write a detailed note on Device drivers and Device independent I/O software. [14M]
Explain the use of directory organization of files. Explain in detail the
implementation of Tree structured directory.
SECTION-V
9 What is a Deadlock? Explain Banker’s algorithm to avoid a Deadlock. What are [14M]
the problems in its implementation?
OR
10 Consider a disk queue with requests for I/O to blocks on cylinders 183, [14M]
37,122,14,124,65,67. If the disk head is start at 53, then find out the total head
movement with respect to FCFS, SSTF, SCAN, C-SCAN and LOOK scheduling.
**********

Page 1 of 1
R18
Code No: R18A0504
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
II B.Tech I Semester Supplementary Examinations, June 2022
Operating Systems
(CSE & IT)
Roll No

Time: 3 hours Max. Marks: 70

Answer Any Five Questions
All Questions carries equal marks.
***
1 Explain in detail the types of system calls provided by a typical operating system. [14M]

2 What do you mean by a Thread? Explain the various types of threads. Also, [14M]
explain the concept of Multi-threading with its benefits in detail.
3 What are the main objectives of Process Scheduling? Write about different types of [14M]
Schedulers and Scheduling Criteria. Give an example of Round Robin Scheduling
Algorithm.
4 Differentiate how Inter process Communication happens through Semaphores and [14M]
Message Passing.

5 What is meant by Paging? What are the principles for Page allocation? Explain the [14M]
details of hardware support for paging? What are the advantages and
disadvantages of paging?

6 Compare the performance of Page replacement algorithms: Not Recently Used [14M]
(NRU) and Least Recently Used (LRU).

7 Explain the use of directory organization of files. Explain in detail the [14M]
implementation of Tree structured directory.

8 What is a Deadlock? Explain the optimal techniques for Deadlock prevention and [14M]
avoidance.

**********

Page 1 of 1
R18
Code No: R18A0504
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
II B.Tech I Semester Supplementary Examinations, November 2022
Operating Systems
(CSE & IT)
Roll No

Time: 3 hours Max. Marks: 70

Note: This question paper Consists of 5 Sections. Answer FIVE Questions, Choosing ONE
Question from each SECTION and each Question carries 14 marks.
***
SECTION-I
1 A Briefly discuss about Case study on UNIX and WINDOWS Operating [7M]
System.
B Describe Various states, Benefits of threads, Types of threads and Concept of [7M]
Multithreads.

OR
2 A State and explain operating system services that provide functions which are [7M]
helpful to the user.
B Explain with a neat example how system calls used. [7M]
SECTION-II
3 A Explain Peterson’s solution for critical section problem. [7M]
B Explain the solution for the Dining Philosophers problem using semaphore. [7M]
OR
4 A Explain Scheduling algorithms in operating system. [7M]
B Explain how you can implement a monitor using semaphores. [7M]
SECTION-III
5 A Briefly discuss about Optimal, First in First Out (FIFO), Second Chance [7M]
(SC) and Not recently used (NRU).
B What is demand paging. [7M]
OR
6 A Write in brief on the Fixed partitioning and dynamic partitioning memory [8M]
management techniques
B Write short note on paging. [6M]
SECTION-IV
7 A Explain the three allocation methods in file system implementation. [7M]
B State and explain four approaches to free space management. [7M]
OR
8 A Write a short note on Goals of Interrupt handlers, Device drivers and Device [7M]
independent I/O software.
B Explain about I/O devices, Device controllers and Direct memory access [7M]
Principles of I/O

1
SECTION-V
9 A Briefly explain about deadlock prevention methods with examples of each. [7M]
B Explain FCFS and SSTF disk scheduling algorithm. [7M]
OR
10 A Explain about deadlock avoidance. [7M]
B Explain SCAN and C-SCAN disk scheduling algorithm. [7M]

****

2
R17
Code No: R17A0513
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
III B.Tech I Semester Supplementary Examinations, July/August 2021
Operating Systems
(CSE & IT)
Roll No

Time: 3 hours Max. Marks: 70

Answer Any Five Questions
All Questions carries equal marks.
***
1 State and Explain Various types of Computer Systems. [14M]

2 What is OS? Describe the different types of Operating Systems with the examples. [14M]

3 Define Scheduling? Explain any Two CPU Scheduling Algorithms with Examples. [14M]

4 Explain in detail about Inter Process Communication with examples. [14M]

5 Consider the following reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. [14M]

Assume there are three frames. Apply LRU replacement algorithm to the reference
string above and find out how many page faults are produced. Illustrate the LRU page
replacement algorithm in detail and also two feasible implementation of the LRU
algorithm.

6 Explain Optimal Page Replacement Algorithm with Example. [14M]

7 Explain any four File access methods for information in a file with neat diagrams. [14M]

8 Define Deadlock? State and explain four conditions that are necessary for deadlocks [14M]
to occur with neat example.
**********

Page 1 of 1
R17
Code No: R17A0513
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
III B.Tech I Semester Supplementary Examinations, Dec-21/Jan-22
Operating Systems
(CSE & IT)
Roll No

Time: 3 hours Max. Marks: 70

Note: This question paper Consists of 5 Sections. Answer FIVE Questions, Choosing ONE
Question from each SECTION and each Question carries 14 marks.
****
SECTION-I
1 a. Explain about various process states with a neat diagram [7M]
b. Discuss about system calls [7M]
OR
2 With a neat sketch, describe the services that an operating system provides to [14M]
users, processes and other systems.
SECTION-II
3 Illustrate Critical Section problem. Give the conditions that a solution to the [14M]
critical section problem must satisfy.
OR
4 List and describe different types of schedulers. [14M]
SECTION-III
5 Consider the following page reference string: [14M]
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. How many page faults would occur for the
optimal page replacement algorithm, assuming three frames and all frames are
initially empty.
OR
6 What is paging? How it is different from segmentation? Also explain hardware [14M]
support for paging.
SECTION-IV
7 What do you mean by a file system? Summarize the various file access methods in [14M]
detail.
OR
8 Explain in detail about disk scheduling algorithms with examples. [14M]
SECTION-V
9 Write the various deadlock conditions? Explain in detail. Also write banker [14M]
algorithm.
OR
10 What are the goals of protection and explain Language-Based Protection. [14M]
**********

Page 1 of 1
R17
Code No: R17A0513
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
III B.Tech I Semester Supplementary Examinations, June 2022
Operating Systems
(CSE & IT)
Roll No

Time: 3 hours Max. Marks: 70

Answer Any Five Questions
All Questions carries equal marks.
***
1 State the various components of operating system structure and explain the simple [14M]
and layered approach of operating system in detail.

2 Explain the actions taken by a thread library to context-switch between user level [14M]
threads. Also, Briefly explain the inter-process communications.

3 Differentiate the following with examples:

a) Process scheduling and thread scheduling [7M]
b) Optimal and LRU Page replacement algorithm [7M]

4 Does preemptive scheduling give same performance as non-preemptive scheduling [14M]

algorithm? Compare their performance by assuming at least 5 processes arrived at
different time intervals.

5 Demonstrate about Dining Philosophers problem? Discuss the solution to Dining [14M]
philosopher’s problem using monitors.

6 Write a short notes on:

i) Demand Paging. [7M]
ii) Segmentation. [7M]

7 Explain various file access methods with suitable examples. [14M]

8 Explain the Resource-Allocation-Graph algorithm for deadlock avoidance. [14M]

**********

Page 1 of 1
R15
Code No: R15A0513
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
III B.Tech I Semester Regular Examinations, November 2017
Operating Systems
(CSE)
Roll No

Time: 3 hours Max. Marks: 75

Note: This question paper contains two parts A and B.
Part A is compulsory which carriers 25 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 (25 Marks)

1. (a)List the services provided by the operating system.[2]
(b) What are multiprocessor systems? Give its advantages. [3]
(c) What is Semaphore [2]
(d) List the fields of PCB [3]
(e) What is Demand Paging? [2]
(f) What is page fault? [3]
(g) Explain file attributes [2]
(h) Explain various methods of accessing disk file [3]
(i) Give the necessary conditions for dead lock . [2]
(j) Explain the principles of protection. [3]

PART – B (50 Marks)

SECTION – I
2. (a)Explain the various types of system calls in detail.[5]
(b)Explain Evolution of Operating Systems [5]
(OR)
3. Explain different types of operating systems. [10]
SECTION – II

4. (a)Explain types of schedulers. [5]

(b)What is race condition explain. [5]
(OR)
5. (a)Solve dining philosophers problem using monitors [5]
(b) Explain the Round robin algorithm with example.

SECTION – III
6. Explain various Page Replacement Algorithms with examples.[10]
(OR)
7. Explain the structure and implementation of Page Table.[10]
SECTION – IV

8. (a)What is File System Mounting? Explain.[5]

(b)Explain the layered File System Structure.[5]
(OR)

9. Explain the various file allocation methods.[10]

SECTION – V

10. How the deadlocks can be avoided? Explain with the help of bankers algorithm.[10]
(OR)
11. How the access matrix helps in protection of a system? Explain with examples.[10]

****
Code No: R15A0513
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY R15
(Autonomous Institution – UGC, Govt. of India)
III B.Tech I Semester supplementary Examinations, May 2018
Operating Systems
(CSE)
Roll No

Time: 3 hours Max. Marks: 75

Note: This question paper contains two parts A and B
Part A is compulsory which carriers 25 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 (25 Marks)
1. (a) What is a kernel.[2M]
(b) What is meant by Batch Systems? [3M]
(c) What is context switching [2M]
(d) What is mutual exclusion [3M]
(e) Give the two differences between physical and logical addresses.[2M]
(f) How does the system detects the thrashing? [3M]
(g) List the File attributes and files operations. [2M]
(h) Explain the performance characteristics of mass-storage devices.[3M]
(i)What is deadlock ? [2M]
(j) What are Goals of Protection? [3M]
PART – B (50 Marks)
SECTION – I
2. (a) What are the differences between batch processing and Real time processing
system.[5M]
(b)Explain the concept of virtual machine. [5M]
(OR)
3(a) Define microkernel? Explain its advantages. [5M]
(b) What are the goals of operating system ? Explain briefly. [5M]
SECTION – II
4. (a)What is Critical section explain. [5M]
(b)Explain the round robin algorithm with example. [5M]
(OR)
5.(a) Explain the Scheduling Criteria. [5M]
(b)Find the average waiting time using FCFS and SJF , consider P1,P2,P3,P4 and 21,3,6,2
are burst times in( ms). [5M]
SECTION – III
6.(a) Explain briefly about demand paging. [5M]
(b) Consider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1,
2, 3, 6, frame size 3.How many page faults would occur for the LRU replacement [5M]
(OR)
7. Explain various techniques for structuring of the page table. [10M]

.SECTION – IV
8. Explain the implementation of local file systems and directory structures. [ 10M]
(OR)
9. (a) Explain the structure of disk, with a neat Diagram. [5M]
(b)Explain any three disk scheduling algorithms. [5M]
SECTION – V
10. Define dead lock. Explain the methods to recover from a dead lock. [10M]
(OR)
11. (a) Explain about Cambridge CAP system.[5M]
(b)How does the programming language Java support protection? Explain [5M]

********
R15
Code No: R15A0513
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
III B.Tech I Semester Regular/supplementary Examinations, November 2018
Operating Systems
(CSE&IT)
Roll No

Time: 3 hours Max. Marks: 75

Note: This question paper contains two parts A and B
Part A is compulsory which carriers 25 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 (25 Marks)

1). a Define Operating System. List out the objectives of an operating system. [2M]
b Define system calls. Explain the main purpose of an operating system [3M]
c What is semaphore? [2M]
d Describe different process states. [3M]
e Write the difference between internal and external fragmentation [2M]
f Write the first ,best fit memory allocation techniques [3M]
g Define boot block. How it initiated from disk [2M]
h What are the various attributes that are associated with an opened file [3M]
i Describe the Safe, unsafe, and deadlock state spaces [2M]
j List the goals and principles of protection [3M]
PART-B (50 MARKS)
SECTION-I
2 Discuss about the evolution of operating system [10M]
OR
3 Explain the purpose of system calls and discuss the system calls related to process [10M]
control and communication in brief
SECTION-II
4 Discuss any five process scheduling algorithms with examples [10M]

OR
5 a) Write the solution to Dining Philosophers problem using Monitors [5M]
b) Explain the Round Robin scheduling algorithm with a suitable example [5M]
SECTION-III
6 Given page reference string: 1,2,3,2,1,5,2,1,6,2,5,6,3,1,3,6,1,2,4,3. Compare the number [10M]
of page faults for LRU, FIFO and Optimal page replacement algorithm
OR
7(a) Discuss about paging with neat diagram [5M]

Page 1 of 2
(b) Explain the various structure of page table [5M]

SECTION-IV
8 a)Explain the three allocation methods in file system implementation. Illustrate [5M]
with proper diagram
b)How to organize the mass storage? Explain [5M]
OR
9 Discuss various disk scheduling algorithm with examples. [10M]
SECTION-V
10 Consider the table given below for a system, find the need matrix and the safety sequence, [10M]
using Banker’s algorithm.
Resource – 3 types
A – (10 instances)
B – (5 instances)
C – (7 instances)
Process Allocation Maximum Available
A B C A B C A B C
p0 0 1 0 7 5 3 3 3 2
p1 2 0 0 3 2 2
p2 3 0 2 9 0 2
p3 2 1 1 2 2 2
p4 0 0 2 4 3 3
OR
11 a)Discuss about Access Matrix [5M]
b)Write a note on domain of protection [5M]
******

Page 2 of 2
R15
Code No: R15A0513
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
III B.Tech I Semester Supplementary Examinations, July/August 2021
Operating Systems
(CSE&IT)
Roll No

Time: 3 hours Max. Marks: 75

Answer Any Five Questions
All Questions carries equal marks.
***
1 In a multiprogramming and time sharing environment several users share the [15M]
system simultaneously. This situation can result in various security problems.
Discuss these problems?

2 Explain various operating System Generations? [15M]

3 a. What are various issues to be considered in Multiple-Processor [7M]

scheduling?
b. Explain about various states of process with neat diagram. [8M]

4 What are various operations performed on a process? Explain each one in detail [15M]
considering operating systems examples?

5 Illustrate the following Page Replacement algorithms with clear examples. [15M]
FIFO (b)Optimal

6 Analyze the concept of Segmentation with paging and its use in OS Memory [15M]
Management

7 Classify different types of files and list their extensions. [15M]

8 Consider the following snapshot of a system: [15M]

Allocation Max Available
--------------- ------------ -----------
ABC D ABCD ABCD
Po 0012 0 012 1520
P1 1000 1 750
p2 1354 2 356
p3 0632 0 652
p4 0014 0 656
Apply Banker’s Algorithm and determine whether the system is in safe state or
not?
******

Page 1 of 1
R15
Code No: R15A0513
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
III B.Tech I Semester Supplementary Examinations, Dec-21/Jan-22
Operating Systems
(CSE&IT)
Roll No

Time: 3 hours Max. Marks: 75

Note: This question paper contains two parts A and B
Part A is compulsory which carriers 25 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 (25 Marks)
1). a Give any two differences between Parallel and Distributed Systems. [2M]
b List Various OS Objectives. [3M]
c Differentiate Micro and Macro Kernel. [2M]
d Write any two classical problems of synchronization [3M]
e How to calculate the performance of Demand Paging. [2M]
f A system with a 32-bit logical address space, if the page size is 4KB, then the [3M]
page table may consists of how many entries?
g List the operations of a Directory. [2M]
h Differentiate Constant Linear Velocity and Constant Angular Velocity in disks. [3M]
i Explain thread scheduling [2M]
j Recall the Principles of Protection [3M]
PART-B (50 MARKS)
SECTION-I
2 What are the main functions of operating system? Explain OS Structure. [10M]
OR
3 Compare the Batch, Multi programmed and time shared. [10M]

SECTION-II
4 Consider the following set of processes, with the length of the CPU burst given in [10M]
milliseconds:

Process Burst Time Priority

P1 10 3
P2 1 1
P3 2 4
P4 1 5
P5 5 2

The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at
time 0. Draw Gantt chart that illustrate the execution of these processes using the

Page 1 of 2
non preemptive priority (a smaller priority number implies a higher priority)
scheduling algorithm. What is the turnaround time and waiting time of each
process?
OR
5 Write and explain Producer-Consumer classical synchronization problem. [10M]

SECTION-III
6 Illustrate the following Page Replacement algorithms with clear examples. [10M]
(a) FIFO (b) Optimal
OR
7 Sketch the structure of page table. What is the purpose of paging the page tables [10M]

SECTION-IV
8 What is a file? What are the different operations that can be performed on [10M]
a file?
OR
9 Discuss the Following Disk scheduling Algorithms with suitable examples: [10M]
a)FCFS b)SSTF

SECTION-V
10 Illustrate the Principles of Protection. [10M]
OR
11 How resource allocation graph is useful in Deadlock detection? Explain? [10M]
******

Page 2 of 2
R15
Code No: R15A0513
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
III B.Tech I Semester Supplementary Examinations, June 2022
Operating Systems
(CSE)
Roll No

Time: 3 hours Max. Marks: 75

Answer Any Five Questions
All Questions carries equal marks.
***
1 Explain various operating System Generations? [15M]

2 Define a Process. Describe Process State transition diagram with a neat [15M]
sketch.

3 Describe necessary conditions for deadlock occurrence. [15M]

4 What are various operations performed on a process? Explain each one in detail [15M]
considering operating systems examples?

5 Briefly explain about different Contiguous allocation memory management [15M]

techniques.

6 Explain Page Replacement algorithms with clear examples. [15M]

7 Explain in detail about disk scheduling algorithms with examples [15M]

8 Explain the Deadlock Avoidance and Deadlock Prevention. [15M]

******

Page 1 of 1
R15
Code No: R15A0513
MALLA REDDY COLLEGE OF ENGINEERING & TECHNOLOGY
(Autonomous Institution – UGC, Govt. of India)
III B.Tech I Semester Supplementary Examinations, November 2022
Operating Systems
(CSE)
Roll No

Time: 3 hours Max. Marks:

75
Note: This question paper contains two parts A and B
Part A is compulsory which carriers 25 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 (25 Marks)

1). a List some examples for OS? [2M]

b What's the main purpose of an OS? What are the different types of OS? [3M]
c What is a Scheduling Algorithm? Name different types of scheduling [2M]
algorithms.
d Explain about Context Switching? [3M]
e What is virtual memory? [2M]
f What is Contiguous Memory Allocation in Operating Systems? [3M]
g What are the various File Operations? [2M]
h Demonstrate on Disk Scheduling concept. [3M]
i What is a Capability-based System? [2M]
j What is a deadlock in OS? What are the necessary conditions for a [3M]
deadlock?
PART-B (50 MARKS)
SECTION-I
2 Define a system call and Write a system call sequence to copy one file to [10M]
another file.
OR
3 What are the important issues involved in the design and implementation [10M]
of operating systems?
SECTION-II
4 What is the role of PCB? Illustrate various attributes of PCB. [10M]
OR
5 Describe the Process synchronization in detail. [10M]
SECTION-III
6 Analyze any three page-replacement algorithms with their merits and [10M]
demerits.
OR
7 “Swapping increases degree of multiprogramming in a system”- Justify. [10M]

1
SECTION-IV
8 Elaborate the overview of mass-storage structure. [10M]
OR
9 Elaborate in detail about various file allocation methods with their merits
and demerits.
(i) Contiguous allocation [4M]
(ii) Linked allocation [3M]
(iii) Index allocation [3M]
SECTION-V
10 State banker’s algorithm for deadlock avoidance. [10M]
OR
11 Explain the following concepts in terms of OS
i) Protection [4M]
ii) Goals of protection [3M]
iii) Principles of protection [3M]
******