OPERATING SYSTEMS - QUESTION BANK (UNIT WISE) R16 (A.

Y:2020-21) ODD SEMESTER

Unit-I

S.No Question Marks

1. Define operating system and discuss its role from different
10
perspectives.
2. Describe about Operating Systems structures in detail 10
3. State about Protection and Security for an Operating Systems 05
Summarize and explain the functions of the Operating
4. 10
Systems
5. Describe about different kinds of special purpose systems 10
6. Express the various generations of various Operating Systems 05
7. What is system call? Classify and explain the system calls 10
Explain the layers and working nature of an Operating
8. 10
Systems
Describe about distributed systems and its applications in
9. 10
detail
10. List out different services of operating system and Explain. 10

Unit-II

S.No Question Marks

Describe about process concept and process scheduling in
1. 10
process management.
2. Explain about Message Passing Systems in IPC 05
3. Illustrate the Process Scheduling concepts in OS. 10
Find and explain the average waiting time of the scheduling
algorithms for the following process using FCFS,SJF,Priority
and RoundRobin scheduling algorithms

Process Burst Time

P1 29
4. 10
P2 10
P3 7
P4 12
P5 3

Quantum Time is: 10ms

Explain about process scheduling algorithms in OS
5. 10
scheduling.
6. Describe about Multithread Programming Model 05
7. Discuss about algorithm evaluation methods in detail 10
OPERATING SYSTEMS - QUESTION BANK (UNIT WISE) R16 (A.Y:2020-21) ODD SEMESTER

What is a process? Explain Process states and process

8. 10
scheduler
What do you mean by PCB? Where is it used? What are its
9. 10
contents? Explain.
Differentiate Preemption and Non-preemption scheduling
10. 10
methods.

Unit-III

S.No Question Marks

1. Describe about process of synchronization in detail 05
Illustrate about critical-section problem and Peterson’s
2. 05
solution in concurrency.
3. Explain about monitors role in process synchronization 10
4. Summarize the few examples of synchronization 05
How to apply the monitors to solve the dinning philosopher’s
5. 10
problem with example.
6. Express about Classic Problems in Synchronization 10
7. Describe about semaphores and its roles synchronization. 10
8. Explain the various methods for Hardware Synchronization 10
Recall semaphore? Explain its usage and implementation and
9. 10
solution to the Bounded-Buffer problem using semaphores.
Define monitor .State dining philosophers’ problem and give a
10. 10
solution using monitors.

Unit-IV

S.No Question Marks

Explain about three basic page replacement algorithm with an
1. 10
example.
Consider the following page reference string:
7,2,3,1,2,5,3,4,6,7,7,1,0,5,4,6,2,3,0,1
Assuming the demand paging with three frames, how many
page faults would occur for the following replacements
2. 10
algorithms?
a. LRU
b. FIFO
c. Optimal
Write a short note on Hardware support on Paging Concept
3. 05
with neat diagram.
OPERATING SYSTEMS - QUESTION BANK (UNIT WISE) R16 (A.Y:2020-21) ODD SEMESTER

4. Describe about segmentation. 05

Consider the following segment table:

Segment Base Length

0 219 600
1 2300 14
2 90 100
3 1327 580
4 1952 96
5. 10
What are the physical addresses for the following logical
addresses?
a. 0, 430
b. 1, 10
c. 2, 500
d. 3, 400
e. 4, 112
6. Explain about contiguous Memory Allocation in detail 10
7. Discuss Swapping and Paging 10
8. Differentiate external fragmentation with internal fragmentation. 10
9. Summaraize about Logical & Physical Addressing 10
10. Explain about first fit, best fit, worst fit, next fit algorithms? 10

Unit-V

S.No Question Marks

Consider the following snapshot of a system:

Allocation Max
A B C D A B C D
P0 3 0 1 4 5 1 1 7
P1 2 2 1 0 3 2 1 1
P2 3 1 2 1 3 3 2 1
P3 0 5 1 0 4 6 1 2
1. P4 4 2 1 2 6 3 2 5 10

Using the banker’s algorithm, determine whether or not each

of the following states is unsafe. If the state is safe, illustrate
the order in which the processes may complete. Otherwise,
illustrate why the state is unsafe.
a) Available = (0,3,0,1)
b) Available = (1,0,0,2)
OPERATING SYSTEMS - QUESTION BANK (UNIT WISE) R16 (A.Y:2020-21) ODD SEMESTER

Discuss about deadlock detection and recovery from

2. 10
deadlock condition methods elaborately.
Describe the optimistic assumption made in the deadlock
3. 10
detection algorithm? How can this assumption be violated?
Describe about resource allocation graph with deadlock
4. 05
condition example.
5. Write a short note on methods for handling deadlocks. 05
Explain the banker’s algorithm for deadlock prevention and
6. 10
avoidance with an example.
What are conditions under which a deadlock situation may
7. 10
arise?
8. Describe Resource Request Algorithm 05
9. Illustrate Safety Algorithm 05
Explain goals and principles of system protection in detail.
10. 05

Unit-VI

S.No Question Marks

1. Discuss about file system implementation methods in detail. 10
2. Explain the different kinds of Disk Scheduling with diagram 10
3. Write about Directory structure and file access methods. 10
Illustrate different kinds of disk scheduling algorithms with
4. 10
reference blocks.
Write a note on File System Mounting in both Linux and
5. 10
Windows Operating System
6. Describe about file system structure. 5
7. Summaraize about file attributes, file operations, and file types? 5
8. Explain file mounting and file sharing procedure 10
9. Explain about single-level, two-level directory structure? 10
Demonstrate swap space management and free space management in
10. detail. 10