Module4_Memory Management Notes

Module 4 Memory management notes

Optimal and LRU

Optimal and LRU

Page Replacement Algorithm (FIFO)

Page Replacement Algorithm

Introduction to Virtual Memory

Introduction to Virtual Memory

Hash Table and segmentation

hash table and segmentation

Paging

paging

Memory Management

Memory management

Contiguous memory allocation

Contiguous memory allocation

Module3_Deadlock & Memory management Notes

Deadlock and Memory Management notes

Resource Request Algorithm

Resource Request Algorithm

Deadlock Recovery

Deadlock Recovery

Methods of Handling deadlock

Methods of Handling Deadlock

Deadlock Detection

Deadlock Detection

Deadlocks

deadlocks

Monitors

Monitors

Semaphore

Semaphore

Classical Synchronization Problem

Classical Synchronization Problems

Module2_Process Synchronization Notes

Process Synchronization Notes

critical Section Hardware Solution

Critical Section Hardware Solution

Banker's Algorithm Problem

Banker's Algorithm solution

Banker's Algorithm

Banker's Algorithm

Process Syncronization

Process SyncronizationCritical Section Problem

Operating System Assignment 2

Trust ®

Operating System(15/17CS64 &18CS43)

Assignment 2:

1.  What are semaphores? Explain any three use cases of semaphores. What do you mean by a binary semaphore and a counting semaphore.

2. Describe an n-process solution to critical section problem which uses test and set () hardware instruction. Prove how its algorithm satisfies all the requirements of critical section problems solution.

3.   Discuss how Readers-Writers problem can be solved using semaphores.

4.   Explain Peterson’s solution to critical section problem.

5.   Explain Dining-Philosopher’s problem using monitors.

6. What is busy waiting in a critical section concept? How semaphore is used to solve critical section problem? What are the advantages of semaphore.

7. What is semaphore? Explain how it can be used to solve the producer-consumer problem.

8. Explain the range of monitors with a schematic view of its structure; write a monitor solution to bounded buffer problem.