Q1. Draw the process transition diagram and describe the meaning of ‘ready to swap in’ method.
Q2. Give an illustration of classical problem of concurrent programming and illustrate how it leads to the deadlock?
Q3. Describe the concept of Least Recently Used memory page replacement method and how it is distinct from the First In First Out (FIFO) page replacement method.
Q4. Illustrate the use of process table in the process management? How does OS update the process table?
Q5. Illustrate how memory compaction works? Write down an algorithm for the memory compaction.
Q6. For a given reference strings: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5. By using LIFO algorithm of the page replacement, calculate the number of page faults for number of frame = 3 and number of frame = 4.