Scribd
Upload
4 views1 page

OS Assignment2

The document outlines various concepts related to operating systems, including concurrent processes, process control blocks, semaphores, critical regions, and memory management techniques. It discusses examples of interprocess communication and the application of semaphores in problems like the sleeping barber, philosopher, and producer-consumer problems. Additionally, it compares critical section problems, multiprogramming, and memory allocation strategies such as best fit and worst fit, with a focus on practical examples and diagrams for memory partitioning.

Uploaded by

manavemperor67890
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

OS Assignment2

The document outlines various concepts related to operating systems, including concurrent processes, process control blocks, semaphores, critical regions, and memory management techniques. It discusses examples of interprocess communication and the application of semaphores in problems like the sleeping barber, philosopher, and producer-consumer problems. Additionally, it compares critical section problems, multiprogramming, and memory allocation strategies such as best fit and worst fit, with a focus on practical examples and diagrams for memory partitioning.

Uploaded by

manavemperor67890
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

OS assignments II

What is concurrent processes ? how it works ? give examples

Explain the process concept and process control block

Name and explain semaphore and its categories, threads and management,

Explain the term critical region. define partitioning in memory management.

Explain contiguous memory management with an example and interprocess communication model

Explain semaphores work and principle used in i) sleeping barber problem. II) Philosopher problem iii)
producer consumer problem

Compare i) Critical Section Problem and process synchronization ii) multiprogramming and variable
partitioning iii) Best fit memory allocation and worst fit memory allocation

Explain with diagram memory partition has divided into small parts like 250K,350K,150K,250K and 750K,
how can we apply best fit and worst fit algorithms with procecsss 110k, 220k, 300k, 150k ane 510 in
order ?

You might also like