Home 
About
Blog
Define Operating System? Explain objectives of Operating System.
How can we solve producer-consumer problem using semaphore?
What do you mean by Preemptable and Non-Preemptable resources? Describe the necessary conditions for deadlock.
Given memory partitions of 200k, 600k, 300k, 400k, and 700k (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 315k, 527k, 202k, and 548k (in order)? Which algorithm makes the most efficient use of memory?
What is meant by system threat? Explain different types of program threats.
Explain methods of communication in a distributed system.
Write short notes on (Any Two):
a) Access Control Matrix
b) Process States
c) Kernel
Attempt any TWO questions
[2x10=20]The processes are assumed to have arrived in the order p1, p2, p3, p4, p5 all at time 0. Draw a Gantt chart illustrating their execution and calculate average waiting time and turnaround time for the process given below using:
a) First Come First Serve
b) Shortest Remaining Time Next
c) Priority Scheduling
d) Round Robin (quantum = 2)
| Processes | Brust Time (sec) | Priority |
| P1 | 2 | 2 |
| P2 | 1 | 1 |
| P3 | 8 | 4 |
| P4 | 4 | 2 |
| P5 | 5 | 3 |
What is Disk Access Time and Disk Response Time? Suppose that a disk has 200 cylinders, numbered (0-199). The drive is currently serving a request at cylinder 43/and previous request was at cylinder 25. The queue of pending request, in FIFO order is: 55, 58, 39, 18, 90, 160, 150, 38, 184. Starting from the current head position, what is total distance (in cylinders) that the disk arm moves to satisfy all pending request for each of following disk scheduling algorithms?
a) FCFS
b) SSTF
c) C-SCAN
d) LOOK
Differentiate between internal and external fragmentation? Explain briefly with examples and procedure to remove the types of fragmentation.