Scribd
Upload
10 views

OSQBMid 2 Jun 2023

OSQBMid2Jun2023 for student

Uploaded by

napimo5076
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

OSQBMid 2 Jun 2023

OSQBMid2Jun2023 for student

Uploaded by

napimo5076
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

S. S.

A GRA WA L I NSTITUTE OF E NGI NE ERING & T E CHNOLOGY , N AV SARI


COMPUTER DEPARTMENT
SEMESTER -VII

Question Bank Mid Sem 2 (Most Repeated Questions)


Subject: Operating System [3130702]

Ch-3 & 4 Concurrency and Inter Process Communication


Sr. No. Questions
Define following terms:
1.
(i)Critical section (ii) Mutual exclusion (iii) Bounded waiting (iv) Race condition-2
What is Semaphore? Give the implementation of Readers-Writers Problem using
2.
Semaphore.-2
3. How semaphores can be used to deal with n-process critical section problem. Explain.
4. What is monitor? Explain solution for producer-consumer problem using monitor.-3
5. Define preemption and nonpreemption.
6. What is meant priority inversion problem?
What is Semaphore? Give the implementation of Bounded Buffer Producer Consumer
7.
Problem using Semaphore.-2
8. Explain Dining philosopher problem and its solution using semaphore.
9. Explain message passing with its different models.
10. Write and explain peterson’s solution.
Ch-5 Deadlock
Sr. No. Questions

1. Define deadlock. Describe deadlock prevention in detail.-2


2. Explain Resource allocation graph.-2
3. What is deadlock? List the conditions that lead to deadlock.-3
4. Explain the Banker’s algorithm for deadlock avoidance with an example.
How does deadlock avoidance differ from deadlock prevention? Write about
5.
deadlock avoidance algorithm in detail.
6. Explain deadlock detection and recovery.
Consider following snapshot of system.

Process Allocation Max Available


R1 R2 R3 R1 R2 R3 R1 R2 R3
P1 0 1 0 7 5 3 3 3 2
7. P2 2 0 0 3 2 2
P3 3 0 2 9 0 2
P4 2 1 1 2 2 2
P5 0 0 2 4 3 3
1. Find safe sequence.
Process P2 requests (4,3,2). Check whether this will be safe state or not.
S. S. A GRA WA L I NSTITUTE OF E NGI NE ERING & T E CHNOLOGY , N AV SARI
COMPUTER DEPARTMENT
SEMESTER -VII

8. Explain preemptable and non-preemptable resource with example.

Ch-6 Memory Management (Part-2)


Sr. No. Questions

1. Explain segmentation.-3
2. What is page fault? Explain steps to handle page fault with diagram.
3. What is paging? Discuss basic paging technique in details.-2
Define Virtual Memory. Explain the process of converting virtual addresses to physical
4.
addresses with a neat diagram.
Write about Least Recently Used page replacement algorithm all its variants with an
5.
example.
Explain Demand Paging. State the need of demand paging. Explain the steps to handle a
6.
page fault using demand paging.
For the following page reference string: 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1
7. Calculate the page faults applying the following Page Replacement Algorithms for a
memory with three frames: (i) Optimal (ii) LRU (iii) FIFO
If FIFO page replacement algorithm is used with 4 page frames and 8 pages, how
8. many page faults will occur with reference string 0124720347 if four page frames are
initially empty? Solve the same problem for LRU page replacement algorithm.

Ch-7 I/O Management and Disk Scheduling (Part-1)


Sr. No. Questions

1. Discuss the major goals of I/O software.


2. Explain Disk arm scheduling algorithm.
Consider an imaginary disk with 51 cylinders. A request comes in to read a block on
cylinder 11. While the seek to cylinder 11 is in progress, new requests come in for
cylinders 1, 36, 16, 34, 9, and 12, in that order.
3. Starting from the current head position, what is the total distance (in cylinders) that the
disk arm moves to satisfy all the pending requests, for each of the following disk
scheduling Algorithms?
FCFS, SSTF, SCAN, CSCAN, LOOK, CLOOK.
Disk requests come in to the disk driver for cylinders 10, 22, 20, 2, 40, 6, and 38, in that
order. A seek takes 6 msec per cylinder moved. How much seek time is needed for
4. (a) First-come, first served.
(b) Closest cylinder next.
In all cases, the arm is initially at cylinder 20.

You might also like