Explaining fcfs disk-scheduling algorithm-critical section


1) Explain about logical versus physical address space with suitable example in detail.

2) How does the system detect thrashing and eliminate the same.

3) Describe the acyclic graph directory structure.

4) Describe the FCFS disk-scheduling algorithm with suitable example.

5) List and describe the components of LINUX system.

6) Write a detailed note on design principles of WINDOWS NT.

7) Explain why are distributed systems reliable?

8) Under what situations would the user is better off using time-sharing system rather than a personal computer or single-user workstations.

9) Explain starvation and write down some solutions.

10) Relate the terms race condition, atomic action, critical section and mutual exclusion.

11) Write down the difference between logical and physical address spaces.

12) Why is memory protection significant in the multiprogramming system?

13) What are the Meta data that a file system maintains about a file?

14) What is the difference between contiguous and interleaved files.

15) Explain double buffering in detail. Why it is useful?

16) Write down the difference between block device and character device.

Request for Solution File

Ask an Expert for Answer!!
Operating System: Explaining fcfs disk-scheduling algorithm-critical section
Reference No:- TGS010368

Expected delivery within 24 Hours