Can anyoen answer any 4 queston except 17 and 20.

12. their critical regions. The following solution to the critical region problem doesn't require the two proce sses strictly alternate in entering while (TRUE) t while (TRUE) ( while (turn!-0) /*loop. critical region ) turn 1; noncritical_ region) /loop* while (turn-1) critical_region )i turn O noncritical_region ) a. True b. False 13. Binary Semaphores are Mutexes that are initialized to 1 and used by two and only two processes to ensure that only one of them can enter its critical region at the same time. a. True b. False 14. A higher-level synchronization primitive called a monitor is a programming language concept, so it is not implemented in operating systems. a. True b. False 15. Each virtual page in a page table must have a mapped page frame in the physical memory a. True b. False 16. The classical dining philosopher problem may have potential deadlock issue a. True b. False 17. TLB without going through the page table. (Translation Lookaside Buffer) is a small hardware device for mapping virtual addresses to physical addresses a. True b. False 18. For the seco nd-chance page replacement algorithm, every page gets the second chance to stay in the memory a. True b. False 19. While paging of memory may suffer internal fragmentation, segmentation of memory may suffer external fragmentation. a. True b. False 20. An i-node lindex-node) is a data structure fo listing a file's attributes and disk addresses of the file's blocks. the size of an i-node is fixed, the size of the file is also fixed. a. True b. False 21. In the memory-mapped 1/O, all control registers are mapped into the memory space. a. True b. False