Explain Reader’s Writer’s problem. Give an illustration. (9) b. What is Banker’s Algorithm of Deadlock Avoidance? Explain. (9) Q.5 a. Explain any three disk scheduling techniques. Give an example. (9)...

Explain Reader’s Writer’s problem. Give an illustration. (9) b. What is Banker’s Algorithm of Deadlock Avoidance? Explain. (9) Q.5 a. Explain any three disk scheduling techniques. Give an example. (9) b. On a simple Paged system, associative registers hold the most active page entries and the full page table is stored in the main memory. If references satisfied by the associative registers take 90 ns and reference through the main memory page table take 220 ns, what is the effective access time if 60% of all memory references find their entries in the associative registers.