UNIT : 1 :- INTRODUCTION
1)Explain structure of Operating System. (3)
2)State features of distributed operating system. (3)
3)Explain different services provided by operating system. (3)
4)Give the difference between multitasking OS and multiprogramming OS. (3)
5)Explain need of Virtual Machines. (3)
6)Define the essential properties of the following types of operating systems:(1) Batch (2) Time-sharing (3) Real-time (3)
7)What are the advantages of multiprogramming? (3)
8)Compare virtual machine and non virtual machine. (4)
UNIT : 2 :- PROCESS AND THREAD MANAGEMENT
1)Draw and explain five state Process State Transition Diagram. (4)
2)Solve following example by FCFS and SJF CPU scheduling algorithm. Draw Gantt Chart and calculate Average Waiting Time and Average Turnaround time. (7)
Process Arrival Time Burst Time
P0 0 10
P1 1 6
P2 3 2
P3 5 4
3)Explain process control block with diagram. (4)
4)Explain Thread Scheduling with suitable example. (7)
5)Give the difference between multitasking OS and multiprogramming OS (3)
6)What are the disadvantages of FCFS scheduling algorithm as compared to shortest job first (SJF) scheduling? (3)
7)What is the thread? What are the difference between user-level threads and kernel-supported threads? Under what circumstances is one type “better” than the other? (7)
8)What is Process? Give the difference between a process and a program. (3)
9)What is Process State? Explain different states of a process with various queues generated at each stage. (4)
10)What are the disadvantages of FCFS scheduling algorithm as compared to shortest job first (SJF) scheduling? (4)
11)What are various criteria for a good process scheduling algorithm? Explain any two preemptive scheduling algorithms in brief. (7)
12)Winter 2020 Q.2 (a)
UNIT : 3-4 :- CONCURRENCY AND INTER-PROCESS COMMUNICATION
1)Explain principle of concurrency in brief. (4)
2)Explain Dining philosopher problem and its solution using semaphore. (7)
3)Explain Mutual Exclusion in brief. (4)
4)Explain producer-consumer problem and solve it using semaphore. Write pseudo code for the same. (7)
5)Write a bounded-buffer monitor in which the buffers (portions) are embedded within the monitor itself. (7)
6)What is Semaphore? Give the implementation of Readers-Writers Problem using Semaphore. (7)
7)Define the term critical section. (3)
8)What is meant priority inversion? (3)
9)What is Semaphore? Give the implementation of Bounded Buffer Producer Consumer Problem using Semaphore. (7)
10)What is advantage of using Monitor? Give the implementation of Bounded Buffer Producer Consumer Problem using Monitor. (7)
11)List criterions used to evaluate the performance of CPU scheduling algorithms. (4)
UNIT:-5 DEADLOCK
1)What is deadlock? List the conditions that lead to deadlock. (4)
2)How Resource Trajectories can be helpful in avoiding the deadlock? (4)
3)What is deadlock? Explain deadlock prevention in detail. (7)
4)What is deadlock? Explain deadlock Avoidance in detail. (7)
5)What is resource allocation graph? (3)
6)When is a system in a safe state?
UNIT :- 6 MEMORY MANAGEMENT
1)State the need of demand paging. Explain the steps to handle a page fault using demand paging. (7)
2)Given memory partitions of 100 KB, 500 KB, 200 KB, 300 KB and 600 KB (in order), how would each of the first-fit, best-fit and worst-fit algorithms place processes of 212 KB, 417 KB, 112 KB and 426 KB (in that order) ? Which algorithm makes the most efficient use of memory? (7)
3)What are Pages and Frames? What is the basic method of Segmentation? (4)
4)Explain need of Virtual Machines (3)
5)Briefly explain and compare, fixed and dynamic memory partitioning schemes. (7)
6)Differentiate external fragmentation with internal fragmentation. (4)
7)Explain the best fit, first fit and worst fit algorithm. (7)
8)Explain the concept of virtual machines. (3)
9)Compare virtual machine and non virtual machine. (4)
10)Explain paging technique. (4)
11)Explain the following allocation algorithms: (1) First-fit (2) Best-fit (3) Worst-fit (7)
12)Explain segmentation. (4)
13)What is fragmentation? Explain the difference between internal and external fragmentation. (7)
14)Why is segmented paging important (as compared to a paging system)? What are the different pieces of the virtual address in a segmented paging? (7)
UNIT :-7 : I/O MANAGEMENT AND DISK SCHEDULING
1) Disk requests come in to the disk driver for cylinders 10, 22, 20, 2, 40, 6, and 38, in that order. A seek takes 6 msec per cylinder moved. How much seek time is needed for
(a) First-come, first served.
(b) Closest cylinder next.
In all cases, the arm is initially at cylinder 20. (7)
2)Explain RAID level system in detail. (7)
3)Explain Disk arm scheduling algorithm. (7)
4)What are the Allocation Methods of a Disk Space? (4)
5)Distinguish between CPU bounded, I/O bounded processes. (4)
6)Explain RAID. How it is helpful to increase CPU performance? (3)
7)Explain i/o buffering. (3)
