i have a task where i don’t understand the memory management of 2 processes by an OS using paging. As scheduling method i used round robin since they both perform I/O. There are 2 assumptions that need to be taken care of:

1. they fit seperately, but not together in memory
2. they both use a shared piece of data, namely a certificate that the computer offers to provide authentication to the online platforms

Is with the first assumption intended that the pages of both processes are in physical memory but some pages in swap space because the physical memory is full? If so, is it necessary to explain cache management with LRU or do i just show what the swap space looks like? Or is intended that only the pages of one process can be in the physical memory and all the pages of the second process on swap space?

Regarding the second assumption, do i put the certificate fixed in the physical memory without doing anything, or do i need to put the certificate as a page in each address space (but then there are 2 certificates page frames in the physical memory?) and then let it stay in physical memory by using LRU?

i am really confused.. please help me out