problem 1: Define the term Semaphore primitives and describe Semaphore mechanism with an ex.

problem 2: Describe the hardware approaches for process synchronization.

problem 3: How semaphores can be used to control access to a given resource comprising of finite number of instances.

problem 4: What are the principles of concurrency and describe the execution of the concurrent process with a simple ex.

problem 5: Describe different solutions for critical section problem for two processes.

problem 6: describe readers and preparer’s problem and also its solution by using semaphores.

problem 7: prepare the Peterson’s algorithm for the mutual exclusion problem and describe the same.

problem 8: prepare notes on:

a) Compaction.
b) External fragmentation.
c) Internal fragmentation.

problem 9: Describe the demand paged memory management in detail with an illustration.

problem 10: Describe the given allocation algorithms:

a) First fit.
b) Best fit.
c) Worst fit.

problem 11: Consider the given page reference string: 1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6. How many page faults would take place for the given replacement algorithms, supposing one, two, three, four, five, six or seven frames? Initially all frames are empty, therefore the first unique pages will also cost one fault each.

a) LRU replacement.
b) FIFO replacement.
c) Optimal replacement.
d) Second chance replacement.