Considering the algorithms for page replacement, w hich of the following is true?

$($a$)$ the second chance algorithm uses an ordered pair $($ used, modified$)$ to select the

victim $($b$)$the $$additional$-$reference$-$bits $$algorithm $$gains $$additional $$ordering

information by recording the reference bits at regular intervals $($c$)$ LRU algorithm is

optimal $($d$)$ Belady$$s algorithm suffers from Belady$$s anomaly

$$A large page size results in $($a$)$ lower external fragmentation $($b$)$ more page faults

$($c$)$ lower internal fragmentation $($d$)$ efficient disk I$/$O

Which of the following statement is false $($a$)$ Banker$$s algorithm is applicable in a

single$-$instance system $($b$)$ the drawback of using RAG algorithm is low resource

utilization $($c$)$most $$operation $$systems $$implements $$some $$form $$of $$deadlock

prevention algorithms $($d$)$ livelock occurs when a thread continuously attempts an

action that fails $($d$)$

$$In Linux, the number of locks being held by a task is called $($a$)$ mutex$\_$lock$\_$count

$($b$)$ preempt$\_$count $($c$)$ lock$\_$count $($d$)$ none of the above