Operating system

Most Important Questions

Unit-1

1. Explain the services provided by operating system.

2. What is the primary functions of an operating system?

3. Explain different types of operating system.

4. Compare and contrast time-sharing and multiprogramming operating system

concepts?

5. Explain the principal advantages of multiprogramming.

6. Explain the following terms in detail:

(i) Multiprocessor operating system

(ii) Real time system

(iii) Time sharing system

7. Explain the structure and components of an operating system with a layered

architecture with diagram.

8. Write about monolithic kernel, layered, and microkernel structures of Operating

systems.

Unit-2

1. Explain the principle of concurrency.

2. What is mutual exclusion and critical section problem? Give the solution that a
solution to the critical section problem must satisfy.

3. Give the principles of mutual exclusion in critical section problem. Also discuss how
well these principles are followed in Dekker’s and Peterson solution considering their
advantages and limitation?

4. Illustrate software-based solutions to the critical section problem.

5. Explain dinning philosopher problem and its solution using semaphore.

6. Explain producer consumer problem and its solution using semaphore

7. Explain in detail about the Inter Process Communication models and Schemes.
 Unit-3

1. Define process and explain process control block. Also, describe process state
transition diagram in detail.

2. What do we need Scheduling?

3. What is the use of context switching?

4. Explain in detail about the Threads and their management.

5. Discuss the performance criteria for CPU Scheduling.

6. Consider the processes, CPU burst time and Arrival time given below: Draw the Gantt
chart and calculate the following by using FCFS, SRTF PRIORITY AND Round robin
Scheduling Algorithm, (i) Average Waiting Time, (ii) Average Turn Around time.(AKTU
2015-16)

➢ What do you mean by safe and unsafe state of a system

➢ Describe Banker’s algorithm for safe allocation.
7. Explore concept of deadlock and how it can occur in concurrent systems, Evaluate
strategies for deadlock prevention, avoidance, detection, and recovery in concurrent
systems,
8. Define deadlock in operating systems, discussing the system model, Deadlock
characterization and conditions necessary for deadlock occurrence? Explain in detail
about the Deadlock System model and.

9. Consider the given snapshot of a system with five processes (P0,P1,P2,P3,P4) and
three resources (A,B,C).

(i) Calculate the content of Need Matrix.

(ii) Apply safety algorithm and check the current system is in safe state or not.

(iii) If the request from process P1 arrives for (1,1,0), can the request be granted
immediately?
 Allocation MAX Available

Process/Resource A B C A B A B C
C

P0 1 1 2 4 3 2 1 0
3

P1 2 1 2 3 2
2

P2 4 0 1 9 0
2

P3 0 2 0 7 5
3

P4 1 1 2 11
2 3

Unit-4

1. Compare and contrast multiprogramming with fixed partitions and variable

partitions?

2. Explain the Logical address space and Physical address of a diagrammatically.

3. What is the main function of the memory-management unit?

4. Explain the difference between External fragmentation and Internal fragmentation.

How to solve the fragmentation problem using paging.

5. Explain thrashing and locality of reference.

6. Explain the principles of paging and segmentation as memory management

techniques, comparing their suitability for different system architectures?

10. Discuss virtual memory concepts, including address translation, page tables, and
demand paging mechanisms?

11. Consider the given references to the following pages by a program:

0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3

How many pages faults will occur if the program has three-page frames available to it and
uses:
(i) FIFO replacement (ii) LRU replacement (iii) Optimal replacement

12. What do you mean by Belady's anomaly? Which algorithm suffers from Belady,s
anomaly and how can it be rectified?

Unit-5

1. Define an I/O subsystem?

5. Discuss the organization of files within file systems, including contiguous, linked, and
indexed allocation methods? Explain various operations associated with a file.

6. Explain the structure and management of file directories.

7. Explain RAID and its characteristics. Also, explain various RAID levels with their
advantages and disadvantages.

8. Explain the concept of file system management. Also, explain various file allocation
and file access mechanisms in details.

9. Suppose the following disk request sequence (track numbers) for a disk with 100
tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of
the R/W head is on track 49. Calculate the net head movement using:
SSTF,SCAN,CSCAN ,LOOK

10. Explain the followings:

1. Buffering

2. Polling

3. Direct Memory Access (DMA)

4. Spooling

11. Explain in detail about the File system protection and security.

12. Explain in detail about the Disk storage and Disk scheduling.

16. A hard disk having 2000 cylinders, numbered from 0 to 1999. 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? SSTF and FCFS.