Operating systems

UNIT –I

1. Define Operating System and explain the various types of Operating Systems? [L1,L2][10M]
2. a) Explain Operating System Structures? [L2][5M]
b) Explain System Programs? [L2][5M]
3. Explain the different functions of an operating system and discuss the various services
provided by an operating system. [L6][10M]
4. a) Explain about the dual mode operation in OS with a neat block diagram. [L5][5M]
b) What is operating system? Explain multiprogramming and time sharing systems. [L1][5M]
5. a) Explain briefly concept of virtual machines [L2][5M]
b) Write the differences between monolithic kernel and microkernel. [L5][5M]
6. a)Explain briefly system calls with examples. [L2][5M]
b) Explain different operations performed by the operating system. [L2][10M]
7. Explain Computing Environments? [L2][10M]
8. a) Explain different types of system calls with suitable example. [L5][5M]
b) What are the functionalities of Operating Systems? Explain in detail [L1][5M]
9. a) Explain difference between Multitasking and Multi Programming? [L5][5M]
b) Explain briefly User and Operating System Interface [L2][ 5M]
10. Explain briefly different types of System calls? [L5][10M]

OPERATING SYSTEMS Page | 1

 QUESTION BANK 2020

UNIT –II

Process & Threads

1. a) Define Process? Explain process State diagram? [L1,5M]

b) Explain about process schedulers? [L2,5M]
2. Consider 3 processes P1, P2 and P3, which require 5, 7 and 4 time units [L5,10M]
and arrive at time 0, 1 and 3. Draw the Gant chart, process completion
sequence and average waiting time for.
(i) Round robin scheduling with CPU quantum of 2 time units.
(ii) FCFS.
[L5,10M]
3. Explain CPU Scheduling Algorithms with examples?
[L2,4M]
4. Distinguish among short-term, medium-term and long-term scheduling with
suitable example. [L5,6M]
5. a) Explain about Scheduling Criteria.
b) Evaluate FCFS CPU Scheduling algorithm for given Problem

Process P1 P2 P3 P4
Process Time 24 3 5 6
6. Evaluate SJF CPU Scheduling algorithm for given Problem [L5,10M]
Process P1 P2 P3 P4
Process Time 8 4 9 5
Arrival Time 0 1 2 3
7. Evaluate Round CPU Scheduling algorithm for given Problem [L5,10M]
Time slice =3 ms.
Process P1 P2 P3 P4
Process Time 10 5 18 6
Arrival Time 5 3 0 4
8. Explain in detail Inter Process Communication? [L2,10M]
9. a) With a neat sketch explain process state diagram. [L5,5M]
b)Write about Threads? [L5,5M]
10. a) Write the difference between user level thread and kernel level thread? [L5,5M]
b) What is synchronization? What are the different synchronization mechanisms? Explain in detail.
11. a) What are the criteria for evaluating the CPU scheduling algorithm? [L1,5M]
b) What is a process? Explain Process Control Block.
11. Suppose that the following processes arrive for execution at the times indicated. Each process will run
the listed amount of time. In answering the questions, use non-preemptive scheduling and base all
decisions on the information you have at the time the decision must be made.
P1 P2 P3
Process Arrival Time 0 0.4 1
Burst Time 8 4 1

OPERATING SYSTEMS Page | 2

 a. Find the average turnaround time for these processes with the FCFS scheduling algorithm?
b. Find the average turnaround time for these processes with the SJF scheduling algorithm?

OPERATING SYSTEMS Page | 3

 UNIT –III
Process Synchronization & Deadlocks

1. What is critical section problem? Explain with example?

2. State critical section problem? Discuss three solutions to solve the critical section problem.
3. What is Semaphore? Explain producer consumer problem using semaphore? [L1,L5][10M]
4. Define process synchronization and explain Peterson solution algorithms? [L1,L2][10M]
5. Explain the solution for Dining-Philosophers Problem [L5][10M]
6. Name two hardware instructions and their definitions which can be used for
implementing mutual exclusion.
7. Explain dining philosopher’s problem.
8. What is Monitor? Explain with any example using monitor?
9. a) What are the methods for handling deadlock. [L4][6M]
b) Write about deadlock and starvation? [L5][4M]
c) Explain about Deadlock Avoidance? [L5][ 5M]
d. Explain how recovery from deadlock? [L2][5M]
10. Explain Dead lock detection (Banker’s Algorithm) with Example? [L5][10M]
11. Write about Deadlock Prevention Methods?
12. Discuss about the following [L6]
A) Semaphore 5M
B) Monitor 5M
13.

OPERATING SYSTEMS Page | 4

 UNIT –IV
Memory Management & Disk Scheduling

1. Discuss about page replacement algorithms with example [L6][10M]

2. a)Consider the following reference string [L5][6M]
7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1. Assume there are three frames. Apply LRU
replacement algorithm to the reference sting 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. [L2][4M]
b) Explain about Swapping.

3. a) What is Segmentation ? Explain with Example. [L1][5M]

b) Explain about Paging.? [L2][5M]
4. Explain the following disk scheduling algorithm with proper diagram [L5][10M]
a) FCFS
b) SSTF
c) SCAN
d) LOOK
e) C-SCAN.

5. a)Discuss the procedure for page fault in demand paging. [L6][4M]

b) Suppose that a disk drive has 5000 cylinders numbered 0 to 4999. The drive is
currently serving a request at cylinder 143. The queue of pending requests in FIFO order
86,1470,913,1774,948,1509, 1022, 1750, 130 starting from current head position. What is
the total distance that disk arm moves to satisfy all the pending request for FCFS and
[L4][6M]
SSTF disk scheduling algorithm.
5. Explain about given memory management techniques. (i) Partitioned allocation (ii) Paging
and translation look-aside buffer
6. List the steps needed to handle page fault.
7. Write short notes on [L5]

a) Demand paging 3M
b) Thrashing 3M
c) Page replacement 4M
8. 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 [L5][10M]
number of page faults for LRU, FIFO and Optimal page replacement algorithm.
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.
Identify the no.of page faults would occur for the following replacement algorithms,
assuming one, two, three, four, five, six, or seven frames? Remember all frames are initially
empty, so your first unique pages will all cost one fault each. a.LRU replacement b. FIFO
replacement c.Optimal replacement
9. a) What is virtual memory? Discuss the benefits of virtual memory techniques. [L1,L5][6M]
b) Write a short notes on Disk management. [L5][4M]
OPERATING SYSTEMS Page | 5
 11. Explain the different Disk scheduling algorithms with their [L2][10M]
comparisons.
12. Elaborate about the free space management on I/O buffering and blocking.
13. . Explain the following: [L2][5M]
a) i) Paging
ii) Segmentation
b) What is contiguous memory allocation? Explain it. [L1,L2][5M]

OPERATING SYSTEMS Page | 6

 UNIT –V
File Management
1. a) Explain the concept of file with Example. [L2][5M]
b) Explain about access method with Example. [L2][5M]
2. a) Discuss about File type. [L6][5M]
b) Explain about File operation. [L5][5M]
3. a) Define UFD and MFD. [L1][5M]
b) Explain about different directory structure available. [L2][5M]
4. Write about different types of operation performed on file. [L5][10M]
5. Write short notes on
a) Directory Implementation [L5][5M]
b) File system Structure. [L5][5M]
6. Explain about bit vector and Linked list free space management Technique [L2][10M]
7. a) Explain about Grouping Free space management Technique. [L2][5M]
b) Explain how directory can be Implemented using linear list. [L5][5M]
8. a) What is free space management technique? [L1][5M]
b) Explain the implementation of directory using Hash table.. [L2][5M]
9. a) Explain the concept of the file. [L2][5M]
b) Write short notes File types [L5][5M]
10. Explain file allocation methods in detail. [L2][10M]

OPERATING SYSTEMS Page | 7