For each of the questions below, answer which ones are false, justifying in detail why 1. In Minix there are several pro

[answerhappygod]

For each of the questions below, answer which ones are false,justifying in detail why1. In Minix there are several process tables. One in the Kernel,and others in the servers. Each table containsof the data necessary for the service to function (Process Server,File Server, System Task). Thereforesome information is stored in more than one table/.
2. A process can receive several messages while it is blocked orready, without executing. But theMinix implementation ensures that it is not necessary to implementan outstanding message bufferassociated with each process.
3. The way to implement kernel interrupt response and processsignals is similar: there isa table of handler addresses. These routines need to deal with theproblem of savingthe context of the processing that was in progress.
5. 'Hard links' may not be used in some cases where 'soft links'may.16. In the DMA architecture (short for “Disk ManagementAccess”) we can increase the efficiency ofprotection in the operating system, as we can place an access bitin the input and output instructionswhen we want to allow access only by the kernel.
6. There is an equivalence between semaphores, monitors andmessages. Any of these schemes can beimplemented using the other.
7. There are 3 levels of process scheduling:i. high level where it is decided which processes enter the disputefor resources;ii. middle level where you decide which process to run nextiii. low level where real-time processes are scheduled
8. On non-preemptive systems, the clock is turned off and theprocess decides when to give up the CPU. Thatmay cause the system to crash.
9. In the multi-level feeback queues system, there are severalpriority queues and each process is allocated toone at the beginning of its execution. In this way the allocationof this priority is not essential for goodsystem performance because the system adapts to the behavior of theprocess.
10. A process allocated to a lower priority queue may takelonger to execute than aprocess in a higher priority queue.
11. The FAT file system has very slow random access even forsmall files due to theoverhead to loop through the linked list.
12. The fsck utility does several system checks. In particular,it checks the number of references togiven I-node in directories. This is important to prevent prematureremoval of files.
13. Interleaving is a disk sector allocation technique that aimsto increase efficiency in data reads.consecutive blocks. It is not implemented at the device-independentsoftware level.
14. Processes like text editors should be given highpriority.
15. Switching from the FAT system to I-nodes on an OS should notsignificantly worsen the performance ofsequential reading of files.
16. Monitors promote better organization of mutually exclusivecode, but need to be implementedin the language's compiler/interpreter. Traffic lights, on theother hand, have freer use and can also beoffered by the Operating System