• Attempt any five questions.
• All questions carry equal marks.
What are the functionalities of Operating Systems? Explain in detail.
What is meant by a System call? How it can be used? How does an application program use these calls during execution?
Write about Disk Space Allocation Methods.
Explain about the services of operating system.
What is a Monitor? Explain how dinning philosopher's problem is solved using monitors with example pseudo code.
Following is the snapshot of a CPU
| Process | CPU Burst | Arrival Time |
|---|---|---|
| P1 | 10 | 0 |
| P2 | 29 | 1 |
| P3 | 03 | 2 |
| P4 | 07 | 3 |
Draw the Gantt chart and calculate the turnaround time and waiting time of the jobs for FCFS (First Come First Served), SJF (Shortest Job First), SRTF (Shortest Remaining Time First) and RR (Round Robin with time quantum 10) scheduling algorithms.
Consider the following page reference strings: How many page faults would occur for the following replacement algorithm, assuming three, four frames? Remember that all frames are initially empty, so your first unique pages will cost one fault each.
i) LRU replacement
ii) Optimal replacement
What is virtual memory? Discuss the benefits of virtual memory techniques.
Explain about deadlock conditions and Banker's algorithm in detail.
Write the principles of protection? And Explain the access matrix in detail.
What do you mean by Deadlock? Explain various methods of handling deadlock.
Explain Paging Memory Management in detail.
Given memory partition of and in order, How would each of the First-fit, Best-fit and Worst-fit algorithms place. The processes of and in order? Which algorithm makes the most efficient use of memory? Show the diagram of memory status in each case.
Explain Protection Mechanism illustrating use of Protection Domain and Access Control List.
Fixed Partitioning
Explain mutual exclusion problem
File System Creation
Embedded and Mobile Operating Systems
