Operating System and Virtualization — Winter 2020

Write Various Process State.

Write about Process Control Block.

Write Various Operating System Services.

What is the requirement to solve Critical Section Problem?

Write about Priority Inversion Problem.

Write various multithreading models.

Discuss preemptive scheduling.

Write benefits of Virtual Machines.

Consider the following set of processes with the length of the CPU burst given in milliseconds: Process Burst Time Priority P1 10 P2 29 1 P3 3 P4 7 P5 12 The processes are assumed to have arrived in the order P1,P2,P3,P4,P5 all at time 0. a.) Draw four Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: FCFS, SF, non preemptive priority(a smaller priority number implies a higher priority), and RR(quantum=10 millisecond). b.) What is the turnaround time and Waiting time of each process for each of the scheduling algorithms in part a? c.) What is the average turnaround time and waiting time of each process for each of the scheduling algorithms in part a?

Write about Semaphores.

Write necessary conditions for arise of Deadlock.

Explain Dining-philosophers Solution Using Monitors.1

How logical Address is mapped to physical address. Explain with diagram.

Discuss Demand Paging.

Write Banker’s Algorithm.

Explain Fragmentation.

Write about TLB.

Write Second Chance LRU approximation page replacement algorithm in detail. Also write enhanced LRU approximation algorithm.

Write about RAID level 0 and RAID level 1.

Write about Resource Allocation Graph algorithm.

Consider the following page reference string: 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, How many page faults would occur for following page replacement algorithm, considering 3 frames and 4 frames.

FIFO ii) LRU iii) Optimal

Write about I/Obuffering.

Write about RAID level 4.

Suppose that a disk drive has 5000 cylinders. Numbered 0 to 4999. The drive is currently serving at cylinder 143 and previous request was at cylinder 125. The queue of pending requests in FIFO order is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 Starting from the current head position what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of following disk scheduling algorithms.

FCFS

SSTF

SCAN

LOOK