1.
The news assumption is that paging is only a scheme to fit a program into small memory. However, this is not the case. paging also include memory protection as well as the effective utilization of momery recources.
2.
Total time required to accomplish a task = processing time + communication time.
Since a process processing time is the same even in the different processor, then the factor that matters is "communication time". The key to solve this problem is to minimize the communication time. We may need to take advantage of the assumption that if two processes are on the same processor, the communication time is negligible.
The solution is P0 in processor A; whereas P1, P2, and P3 are in the processor B. This combination only takes communication time 1, it is optimal.
3.
A) Yes, the current allocation is possible.
B) No, the current allocation is not safe. It is because no process can proceed
in this setting.
C) No, the request cannot be granted
No, there can't be deadlock without at least two processes pending request.
4
After the 10th memory access, all are marked "used".
After the 11th memory access, all previously in memory marked unused. 6 marked "used".
After the 12th memory access, 5 replace 2. 5 and 6 marked "used".
At the end, 6, 5 , 2 , 1 are marked "used"