Scribd
Upload
4 views1 page

Operating System

The document is a mid-term question paper for a B.Tech CSE course on Operating Systems, dated April 8, 2026. It includes questions on critical section problems, deadlock avoidance using the Banker's Algorithm, semaphores, page replacement algorithms, memory allocation strategies, thrashing, disk scheduling, paging, file allocation methods, and directory operations. Each question requires detailed explanations and examples, indicating a comprehensive assessment of students' understanding of operating system concepts.

Uploaded by

rajesh.brigade111
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
4 views1 page

Operating System

The document is a mid-term question paper for a B.Tech CSE course on Operating Systems, dated April 8, 2026. It includes questions on critical section problems, deadlock avoidance using the Banker's Algorithm, semaphores, page replacement algorithms, memory allocation strategies, thrashing, disk scheduling, paging, file allocation methods, and directory operations. Each question requires detailed explanations and examples, indicating a comprehensive assessment of students' understanding of operating system concepts.

Uploaded by

rajesh.brigade111
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

VRS & YRN GROUP OF EDUCATIONAL INSTITUTIONS

[Link] CSE MID-II QUESTION PAPER


SUBJECT: Operating System Date:08/04/26

1. (a) Explain peterson’s solution to the critical section problem. How does it ensures mutual exclusion,
progress and bounded waiting?
(b). Explain the Bankers Algorithm for deadlock avoidance. Give an example with step-by-step
allocation and need matrix?
2. (a) Explain various methods for recovery from deadlock?
(b). What is deadlock avoidance? Explain the use of Bankers Algorithm for deadlock avoidance with
illustration?
[Link] is semaphore? Give the implementation of bounded buffer producer consumer problem using
Semaphore?
4. 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.
How many page faults would occur for the following replacement algorithms, assuming four frames?
Remember all frames are initially empty. So your first unique pages will all cost one fault each. LRU
replacement, FIFO replacement?
5(a). Explain the following allocation algorithm with example (a) First fit (b) Best fit (c) worst fit?
(b) Explain hierarchical page table and inverted page table?
6(a). What is thrashing? Explain the causes of thrashing and suggest techniques to prevent it?
(b). List and explain SSTF disk scheduling algorithms with suitable example?
7. Explain the concept of paging. How does the page table support address translation? Give an
example.
8. Explain the File Allocation methods in file systems. Compare contiguous, linked and indexed
allocation with diagrams.
9(a). Explain the concept of file system mouning. What are partitions and how are they managed during
mounting?
(b). Describe the steps involved in implementing a directory. How are directories structued and
managed on disk?
10(a). What is directory? Explain directory operations in detail?
(b). Explain file system implementation using linked list with index and I-node?

You might also like