Operating System and Virtualization — Summer 2023

Define (i) Operating systems (ii) Tightly coupled Systems (iii) Loosely Coupled Systems.

Define Process. And Write various states of process with diagram.

Describe the services an Operating System provides to users, processors and other systems.

Define Thread. And write usage of threads.

Write about Process Control block.

Define Scheduler. Discuss Types of Schedulers.

Write about Multithreading models.

What is buffering? Write various types of buffers.

Write about various Scheduling criteria.

Explain preemptive Shortest Job First and preemptive priority scheduling algorithm with proper example and gantt chart. Example must show waiting time, turnaround time of each process. And also average waiting time and average turn around time.

Define Mutual Exclusion, Critical Section and Race Condition.

Write Peterson’s Solution for avoiding race condition.

Explain how Dining philosopher problem can be solved using Semaphore.

Discuss priority Inversion problem.

Define Deadlock. And also write condition responsible for deadlock.

Write Banker’s Algorithm for avoiding Deadlock for allocation of multiple instances of resource type.

Discuss what is safe state.

Write about Resource allocation graph algorithm.

Explain LRU and MRU page replacement algorithm with proper example showing number of page faults for 3 frames as well as 4 frames. (one can assume page sequence as their own)

Define Internal and External Fragmentation.

Discuss paging in Detail.

Explain RAID in detail.

Write Types of access methods.

Discuss TLB.

Explain SSTF, SCAN, LOOK Disk Scheduling algorithm with proper example showing which algorithm needs to traverse less number of cylinders. (Assume cylinder sequence as your own)