Operating System and Virtualization — Winter 2022

Describe the four conditions that create deadlock.

Differentiate between single threaded and multithreaded process models.

Consider the following scenario of processes for Round Robin Scheduling with time quantum 2. Process Arrival Time Execution Time P1 0 9 P2 1 P3 2 P4 3 Draw the Gantt chart for the execution of processes, showing their start time and end time. Calculate average turnaround time and average waiting time of the processes. Examine the effect if time quantum is too large and too small.

Describe the two strategies for providing processor resources in a virtual environment.

Describe hardware approaches to mutual exclusion.

Consider a disk queue with I/Orequests of the following cylinders in their arriving order 6,10,12,54,97,73,128,15,44,110,34,45 The disk head is assumed to be at Cylinder 23 and moving in the direction of decreasing number of cylinders. The disk consists of total 150 cylinders. Calculate the disk head movement using SCAN and C -SCAN scheduling algorithm.

Calculate the number of page faults for the following reference string using LRU(Least recently used) page replacement algorithm with frame size as 3.

Describe characteristics of monitor.

Write Peterson’s solution for achieving mutual exclusion.

Write the different states a process can hold. Explain the types of events that lead to each state transition for a process.

Segmentation suffers from internal fragmentation or external fragmentation? Justify.

In a paging scheme,16 bit addresses are used with a page size of 512 bytes. If the logical address is 0000010001111101, how many bits are used for the page number and offset? What will be the physical address, if the frame address corresponding to the computed page number is 15.1

Describe the elements which uniquely characterize a process while program is executing.

Explain how resource allocation graph can depict the deadlock situation?

Explain the handling of multiple non interactive and multiple interactive jobs in case of multiprogramming.

Distinguish between

Static and dynamic allocation of memory (ii) Swapping and paging (iii) Page, frame and segment

Describe the two difficulties with the use of equal size fixed partitions.

Explain how input output is managed in virtual environment.

Consider the following scenario of processes with priority. If the scheduling of processes is priority based, Draw the Gantt chart. Calculate turnaround time and waiting time for each process. Also compute average turnaround time and average waiting time for the system. Process Arrival Time Execution Time Priority P1 0 9 P2 1 5 1 P3 2 3 P4 3 4

Describe the function of kernel in operating system.

Give example of Best fit and worst fit memory allocation strategy.

Consider a system with the following information. Determine whether the system is in safe state. If not in safe state, give reasons. If the system is in safe state, find the safe sequence of processes. Consider Need assuming Maximum Allocation. Total Resources(31) Total Resources of R1 type – Total Resources of R2 type – Total Resources of R3 type – Processes Max Alloc R1 R2 R3 R1 R2 R3

Differentiate the preemptive and nonpreemptive scheduling.

Describe Linux VServer architecture.

Discuss the race condition in producer- consumer problem. Discuss the use of semaphore to solve producer-consumer problem. Also Discuss the solution of producer consumer problem with message passing.