• Attempt any five questions.
• All questions carry equal marks.
Which type of services are provided by Operating System in multiple environment? Also explain why layered approach is used for designing operating System?
Explain buffering and the different ways in which Buffering can be implemented.
Suppose the following jobs arrive for processing at the times indicated. Each job will run the listed amount of time:
| Job | Arrival Time | Burst Time |
|---|---|---|
| 1 | 0.0 | 8 |
| 2 | 0.4 | 4 |
| 3 | 1.0 | 1 |
| a) Give a Gantt chart illustrating the execution of these jobs using the non-preemptive FCFS and SJF scheduling algorithm. | ||
| b) What is turnaround time and wait time of each job for the above algorithms? |
What are the classical problems of process synchronization in Operating System? Explain in detail.
What is the difference between a deadlock prevention and deadlock avoidance methods of dealing with a deadlock problem? Explain the different approaches towards a deadlock detection problem when :
i) There is a single instance of a resource type
ii) Multiple instances of a resource type
Given 5 memory partition of 100 KB, 500 KB, 200 KB, 300 KB, 600 KB (in order) how would the first fit, best fit, worst fit algorithm place process of 212 KB, 417 KB, 112 KB, 426 KB (in order)? Which algorithm makes the most efficient use of memory?
What are the different page replacement algorithms? Also explain which page replacement algorithm is more efficient and why?
Explain the following terms :
i) File management system
ii) Absolute path and Relative path
iii) Directory structure and direct access
