Unit-3 Concurrency & Inter-process Communication

1. What is IPC? What are the reasons for inter-process communication?

2. Explain Message Passing
3. What is race condition? Explain with an example
4. Explain Shared lock variables for achieving mutual exclusion
5. Explain TSL for achieving mutual exclusion
6. Explain how producer-consumer problem can be solved using Semaphore
7. Explain how reader-writer problem can be solved using Semaphore
8. Explain how dining philosopher problem can be solved using semaphore
9. Explain monitor
 Unit-4 Deadlock
1. Differentiate between deadlock & starvation
2. What are the strategies for dealing with deadlock
3. Explain deadlock prevention method
4. Explain deadlock detection & recovery
5. Explain deadlock avoidance method
6. Let's say we have a system with 3 processes (P1, P2, P3) and 3 resource
types (A, B, C). The system has 10 instances of resource type A, 5
instances of resource type B, and 7 instances of resource type C.

Allocation matrix Max Matrix

A B C A B C
P1 1 2 2 3 2 2
P2 1 0 3 1 4 2
P3 1 2 1 3 2 5
 Unit-5 Memory Management
1. Explain fixed-partitioned memory allocation
2. Explain dynamic-partitioned memory allocation
3. What is memory compaction?
4. Explain virtual memory
5. What is paging?
6. Explain paging mechanism in MMU
7. Explain the use of logical & physical memory address
8. What is belady's anomaly?
9. Consider we have a system with a physical memory that can hold 3 pages (i.e
frame no = 3). Sequence of page reference is: 1,2,3,4,1,2,5,1,2,3,4,5. Use page
replacement algorithms to solve this problem.
10. Consider a system with following memory blocks & processes:
Memory Blocks: Processes
BLock 1: 20kb Process A: 15kb
Block 2: 30kb Process B: 25kb
Block 3: 10kb Process C: 10kb
Block 4: 15kb Process D: 20Kb
Apply first fit,next fit, best fit & worst fit to allocate memory to these processes