Scribd
Upload
5 views2 pages

OS Assignment2 Questions (Repaired)

Uploaded by

meghanagowda3025
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views2 pages

OS Assignment2 Questions (Repaired)

Uploaded by

meghanagowda3025
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

OS Assignment2

1. Explain critical section problem. What are the requirements that


critical section problem must satisfy?Explain peterson’s solution.
2. What are semaphores? Explain wait () and signal () commands that
semaphores operate on.
3. Explain bounded buffer problem with semaphores.
4. Explain with an example how resource allocation graph is used to
describe the deadlock
5. Consider the following snapshot of a system. Solve the following
using Bankers Algorithm.
Allocation Maximum Available
Process
ABC ABC ABC
P0 010 753 332
P1 200 322
P2 302 902
P3 211 222
P4 002 433
● Evaluate need matrix.
● Is the system in safe state?
● Can request for (3, 3, 0) by P4 be granted?

6. Consider the following snapshot of a system:


Allocation Maximum Available
Process
ABCD ABCD ABCD
P0 0012 0012 1520
P1 1000 1750
P2 1354 2356
P3 0632 0652
P4 0014 0656
State & solve the following using Bankers Algorithm
● Evaluate need matrix.
● Is the system in a safe state?
● If a request from process P1 arrives for (0 4 2 0) can the request be
granted
7. Outline paging hardware by applying TLB concepts
8. Discuss Demand Paging. Explain the different steps in handling
page fault with appropriate diagram
9. Given a memory partition of 100K, 500K, 200K, 300K and 600K
illustrate first fit, best fit and worst fit algorithm to place 212K, 417K,
112K and 626K processes.
10. Explain Readers writers problem using Semaphore

You might also like