OS_Module5_PPT

OS_Module5_PPT

OS_Module4_PPT

OS_Module4_PPT

OS_Module3_PPT

OS_Module3_PPT

OS_Module2_PPT

OS_Module2_PPT

OS_Module1_PPT

OS_Module1_PPT

Operating System Question Bank

Operating System Question Bank

Question Bank _3_OS

Question_Bank_3_OS

Module_5_Notes

Module_5_Notes

Implementation of Access matrix

Implementation of Access Matrix

Protection

Protection

Disk Management

Disk Management

Disk Scheduling

Disk Scheduling

Introdduction to Mass Storage

Introduction to Mass Storage

File System Implementation

File System Implementation

File Allocation Method

File Allocation Methods

Protection and File System Structure

Protection and File System Structure

Module4_Files_Notes_OS

Module4_Files_Notes_OS

File Mounting and File Sharing

File Mounting and File Sharing

Access Method and File Directory

Access Method and File directory

Files Concept

Files Concept

ModuleIV_QB_OS

ModuleIV_QB_OS

ModuleIII_QB_OS

ModuleIII_QB_OS

ModuleII_QB_OS

ModuleII_QB_OS

Module1_QB_OS

Module1_QB_OS

Question Bank II(Operating SYstem)

Question Bank II(Operating System)

Question Paper VTU June 18

Question Paper VTU June 18

Question Paper VTU JAN 2020

Question paper VTU Jan 2020

Question Paper VTU JAN 2019

Question Paper JAN 2019

Question Paper VTU July 2019

Question paper July 2019

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.