IMPORTANT QUESTIONS – OS- 2nd year

UNIT-1
1. What is Operating System? Explain the major functions of an OS.
2. Describe the classification of operating system with suitable diagrams.
3. Discuss the concept of operating system structure with pros and cons.
4. How does the Microkernel approach to operating system design function, and how do its advantages and
disadvantages compare to those of a Monolithic kernel with their block diagrams?
5. Write Short Notes on:-
a. Shell & Kernel b. Timesharing OS c. Re-entrant Kernel d. Boot Process e. Multiprocessor OS
UNIT-2
1. What do you mean by Concurrent Processes?
2. What is a Critical Section problem? Give the basic requirements that a solution to the Critical section
problem must satisfy with one software solution.
3. List all Classical problems of process synchronization and Explain in detail with suitable diagram.
4. What do you mean by Semaphore? Define the primitive operations including in semaphore mechanism.
5. List all Classical problems of process synchronization and explain any two of them in detail.
UNIT-3
1. What is CPU scheduling? Give the criteria for CPU scheduling.
2. How is Process life cycle different from Thread life cycle? Explain with suitable transition diagram.
3. Consider the following record of a system:
Allocated Maximum Available
Process
A B C A B C A B C
P1 0 1 0 7 5 3 3 3 2
P2 2 0 0 3 2 2
P3 3 0 2 9 0 2
P4 2 1 1 2 2 2
P5 0 0 2 4 3 3
Answer the following questions using the banker’s algorithm:
1) What is the content of the matrix need? 2) Is the system in a safe state? 3) State Diagram
4. Write short notes on :
a. PCB b. Deadlock c. Safe and Unsafe condition d. Thread e. Scheduler
5. What is deadlock? Explain all necessary conditions for Deadlock in detail. How we can prevent deadlock in
a system, if deadlock occurred then explain strategies to recover it.
6. Differentiate between: a. Deadlock and Starvation b. Preemptive and Non-Preemptive Scheduling
c. User level thread and Kernel level thread
7. Consider the following process:
Process Arrival Time Burst Time Priority
P1 0 6 3
P2 1 4 1
P3 2 5 2
P4 3 8 4
Draw Gantt chart and find the average waiting time and average turnaround time:
(i) SRTF (ii) Round Robin (time quantum:2) (iii) Priority(Preemptive) (iv) SJF (v) FCFS
 UNIT-4
1. Explain concept of Thrashing and locality of reference.
2. Differentiate between:
(i) Contiguous and Non-Contiguous method
(ii) Internal and External fragmentation
(iii) Paging and Segmentation
3. A dynamic partitioning scheme is being used, and the following is the memory configuration at a given
point in time:

20M 20M 40M 60M 20M 10M 60M 40M 20M 30M 40M 40M

The shaded areas are allocated blocks; the white areas are free blocks. The next three memory requests
are for 40M, 20M, and 10M. Indicate the starting address for each of
the three blocks using the following placement algorithms:
a. First-fit
b. Best-fit
c. Next-fit. Assume the most recently added block is at the beginning of memory.
d. Worst-fit
4. Explain the concept of Page replacement algorithm. Consider the following page reference string:
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6 How many page faults would occur for the FIFO, LRU,
Optimal page replacement algorithms, assuming three frames and all frames are initially empty.
5. Write short notes on: a. Virtual memory concept b. Demand Paging c. Cache memory
d. Resident Monitor e. Multiprogramming

UNIT-5
1. Explain the term RAID and its characteristics. Also, explain various RAID levels with their advantages and
disadvantages.

2. A hard disk having 2000 cylinders, numbered from 0 to 1999. The drive is currently serving the request at
cylinder 143, and the previous request was at cylinder 125. The status of the queue is as follows
86, 1470, 913, 1774,948,1509,1022,1750,130
What is the total distance (in cylinders) that the disk arm moves to satisfy the entire pending request for each
of the following disk scheduling algorithms?
(i) SSTF (ii) FCFS (iii) C-LOOK (iv) SCAN (v) CSCAN (vi) LOOK

3. Write short notes on : (i) I/O Buffering (ii) Disk storage and scheduling
(iii) File allocation Method (iv) File directories

***************************WISH YOU ALL THE BEST********************************