problem 1: describe any one method in which a process is allocated memory wherever it is available.

problem 2: Describe about the term segmentation.

problem 3: How memory is organized?

problem 4: What is the relationship between FIFO and clock page replacement algorithm?

problem 5: What is the basic difference between resident set management and page replacement policy?

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

problem 7: Describe about the dynamic partitioning and fixed partitioning.

problem 8: Describe the given allocation algorithms:

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

problem 9: describe different solutions for critical section problem for two processes.

problem 10: Describe readers and preparer’s problem and its solution by using semaphores.

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