Operating System Question Bank

Q1. What is the need for an operating system?

Q2. Explain the architecture of Microkernel based operating system.
Q3. Explain the features of Real Time Operating System.
Q4. Explain the architecture of Monolithic kernel-based operating system.
Q5. Explain in brief structure of operating System.
Q6. What are the services to be provided by the Operating System?
Q8. What is the difference between System Call and system program?
Q9. What is the difference between a schedular and a dispatcher?
Q10. What are the steps to be followed for process management when an interrupt comes to a
running process?
Q11. Consider the following set of processes with the length of CPU burst time given in the
mili seconds.Draw the Gantt chart and calculate Average Turnaround Time , Average
Waiting Time for FCFS and RR(Q= 2)Scheduling Algorithm.

Process CPU burst Arrival

time Time
P1 5 0
P2 2 2
P3 3 3
P4 7 5
Q12. What is Process State? Explain different states of a process with various queues
generated at each stage.
Q13. Consider the following set of processes with the length of CPU burst time given in the
mili seconds. Draw the Gantt chart and calculate Average Turnaround Time , Average
Waiting Time for Preemptive and Non-preemptive based Priority Scheduling Algorithm.

Process CPU Arrival Priority

burst Time
time
P1 6 0 2
P2 8 2 1
P3 7 3 3
P4 3 5 4
Q14. Consider the following set of processes with the length of CPU burst time given in the
mili seconds. Calculate Average Turnaround Time , Average Waiting Time for Shortest
Job First and Round Robin(Time slice = 1ms) Scheduling Algorithm.

Process CPU burst Arrival

time Time
 A 3 0
B 6 2
C 4 4
D 5 6
E 2 8
Q15. What do you know about Process Control Block?
Q16. What is CPU bound and I/O bound process?
Q17. What is a critical region? Explain with example.
Q18. What is Critical Section Problem? Explain requirements of critical Section problem.
Q19. Differentiated between Direct communication and Indirect communication.
Q20.What is Race Condition? Explain with example.
Q21. What is semaphore? How can you solve the Dining-Philosophers problem using
semaphores?
Q22. What is semaphore? How can you solve Producer- Consumer Problem using
semaphore?
Q23. Explain the different schedulers with suitable queuing diagram.
Q24. Describe an algorithm with an example related to deadlock avoidance.
Q25.Discuss Peterson’s algorithm with its merits and demerits.
Q26. Consider the following snapshot of a system:

Allocation Max Available

ABCD ABCD ABCD
P0 0012 0012 1520
P1 1000 1750
P2 1354 2356
P3 0632 0652
P4 0014 0656
Answer the following questions using the Banker’s algorithm:
1) What is the content of the matrix Need?
2) Is the system in a safe state?
3) If a request from process P1 arrives for (0,4,2,0), can the request
be granted immediately?

Q27. Describe safe state and unsafe state?

Q28. Consider a system with 5 processes and 3 resources types A, B, C. Resource type A has
7 instances, resource type B has 3 instances and resources type C has 6 instances
Allocation Max
ABC ABC
P0 001 111
P1 200 323
P2 132 431
P3 101 001
P4 001 321
Calculate Available matrix, need of matrix using the Banker’s algorithm, Is the system in a
safe state? If yes, what is the safe sequence?
Q29. Explain the must satisfied conditions to dead locked system.
Q30. Describe User level threads and Kernel level threads with its advantages and
disadvantages.
Q31. Explain the different schedulers with suitable queuing diagram.
Q32. Give the comparison between paging and segmentation.
Q33. What is compaction? Explain with example.
Q34. In a paging system with TLB, it takes 30ns to search the TLB and 90ns to access the
memory. If the TLB hit ratio is 70%, find the effective memory access time.
Q35.Discuss the implementation of LRU page-replacement algorithm using a counter, a stack
with example.
Q36. What is the principal of locality crucial to the use of virtual memory?
Q37. What is dynamic storage allocation problem? How will you provide the solution for
this.
Q38. What is the role of valid – invalid bits in a page table?
Q39. Explain Contiguous file allocation method.
Q40. Consider the following page reference string, Frame size = 3

7,0,1,2,0,3,0,4,2,3 0,3,2,1,2,0,1,7,0,1

Calculate the page fault rate for the following algorithm

i) LRU replacement
ii) FIFO replacement
Q42. What is the difference between Logical address (Vs) Physical addresses? Explain the
concept of swapping.

Q43. Explain different file operations in brief.

Q44.Differentiate between absolute and relative path name of a file.
Q45. What is disk partitioning?
Q46. Consider a disk queue with I/O request on the following cylinders in their arriving
order:

6,10,12,54,97,73,128,15,44,110,34,45

The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number
of cylinders. The disk consists of total 150 cylinders.

1) Draw track chart for LOOK, C-LOOK disk scheduling algorithm.

2) Determine total head movement in tracks in each case.
Q47. Consider a disk queue with I/O request on the following cylinders in their arriving
order:
6,10,12,54,97,73,128,15,44,110,34,45
The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number
of cylinders. The disk consists of total 150 cylinders.

1) Draw track chart for SCAN,C-SCAN disk scheduling algorithm.

2) Determine total head movement in tracks in each case.
Q48 . Consider a disk queue with I/O requests on the following cylinder in their arriving
order:

87, 171, 40, 150, 36, 72, 66, 15

The head disk is assumed to be at cylinder 60.

a) Draw track chart for FCFS, SSTF, SCAN, C-SCAN algorithms of disk
scheduling.

b) Determine total head movement in tracks in each case.

Q49. What are the reasons to provide I/O buffering? mention its types.
Q50. Write notes on

a) Copy-on-write
b) Rate – Monotonic scheduling
c)Deadlock Detection Algorithm
d) Time Sharing Operating System
e) Earliest Deadline first Scheduling
f) Optimal page replacement algorithm
g) Thrashing
h) Multiprogramming Operating System.