Semester :- Sem IV

Branch :- Computer science and Engineering

Subject :- Operating System
 UNIT-I

1) What is an operating system? What are the operating system services? Explain in
brief.

2) Enlist the components of operating system and Explain it.

3) Give the difference between Uniprogramming and Multiprogramming. What is

the need of process control block in Multiprogramming? Explain it in detail.

4) What is a thread? What are the benefits of multithreaded programming? Explain

many to many thread model?

5) Differentiate between thread and process. Give two advantages of thread over
multiple processes.

6) What is meant by a process? Explain mechanism for process creation and process
termination by O.S.?

7) Describe the actions taken by Kernel to switch content between processes.

Draw and Describe Process State Diagram.

8) Mention and Explain Transition of states in process state Diagram.

9) What are the differences between user level threads and kernel level threads?
Under what circumstances one is better than other?

10) Describe the actions taken by thread library to context switch between user
level threads.

11) What is Interprocess Communication? Describe types of Message Passing

Systems
12) What is preemptive & non-preemptive scheduling?

13) What is TCB or PCB?Explain with diagram .

14) How to create child process from parent process ?

15) What are the different system calls in OS?

16) Explain short term scheduler, long term scheduler, and medium term
scheduler in brief.
 UNIT-II

1) What is CPU Scheduling?List & describe five scheduling criteria used in

evaluating various scheduling policies.

2) What is meant by process priority? What are different types of priorities? What
role does priority play in a process scheduling?

3) Differentiate between preemptive & non-preemptive scheduling and Explain

multiple queuing scheduling algorithm.

4) What is context swiching ?Explain with example

5) What is dispatch latency? Describe the make-up of dispatch latency.

6) What are the CPU Scheduling parameters ?

7) Explain different types of CPU Scheduling algorithm

8) What relation hold between each pair of algorithm-A) Priority Scheduling

algorithm & Shortest job first algorithm,B) Round robin Scheduling algorithm
& Shortest job first algorithm,C) Priority Scheduling algorithm & First come
first serve scheduling algorithm
What are the scheduling queues & role in process scheduling
Consider the following set of processes:
Process Arrival Time Burst Time Priority
P1 0 10 1
P2 2 1 3
P3 3 2 5
P4 4 1 1
P5 5 5 2

a) Draw Gantt charts showing the execution of these processes using FCFS, SJF, RR
and priority scheduling schemes.(TQ=2MS)
b)Compute the waiting and turnaround time for each process for each of the above
schemes.
11.Consider the following set of processes:
Process Arrival Time Burst Time Priority
P1 0 7 5
P2 3 10 4
P3 4 5 3
P4 5 3 1
P5 7 4 2
a) Draw Gantt charts showing the execution of these processes using FCFS, SJF, RR
and priority scheduling schemes.(TQ=4ms)
b)Compute the waiting and turnaround time for each process for each of the above
schemes.
12.What is multilevel queue scheduling explain with the help of diagram
13.What is multilevel feedback queue scheduling?
14.What is starvation & aging in OS?
 UNIT-III

1) What is a deadlock? Explain four necessary conditions for a deadlock to occur.

Describe in brief deadlock prevention.
2) Describe in brief deadlock detection & recovery.
3) What is semaphore? What operations are performed on semaphore?
4) What is a monitor? Write and explain the solution to the dining philosopher
problem in brief using monitor.
5) Differentiate between:
a) Critical section and critical region
b) Semaphore and monitor
c) Deadlock prevention and deadlock
d) avoidance
6) Elaborate with diagram the concept of Resource Allocation Graph.
7) Explain various techniques used for Deadlock recovery.
8) How are the wait/signal operations for monitor different from those for
semaphores?
9) List and explain various data structures used in bankers algorithm.
10) Explain safe state and unsafe state of the system.
11) Explain Readers-Writers problem using semaphores
12) List the three requirements that must be satisfied by critical section problem. What
is the difference between synchronization and mutual exclusion?
13) What are various techniques used for Deadlock detection.
14) Consider the following snapshot of a system:
Allocation Max Available
A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3

Using Banker’s algorithm to find

What is the content of matrix need
Whether the system is in safe state?
Consider the following snapshot of a system:
Allocation Max Available
A B C A B C A B C
P0 1 1 2 4 3 3 2 1 0
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

Using Banker’s algorithm to find

What is the content of matrix need?
Whether the system is in safe state?

UNIT-IV
1) List and explain activities involve in Memory Management.
2) Explain working of demand paging.
3) Explain virtual memory management in detail.
4) Explain memory protection by using relocation and limit register
5) What are strategy used to solve dynamic storage allocation problem (First fit, Best
fit, Worst fit).
6) Describe paging using translation look aside buffer.
7) Explain LRU & Optimal page replacement algorithm.
8) What is locality of reference? How this principle used in virtual memory.
Consider logical address space of 32 pages of 1024 word per page,mapped on to a
physical memory of 16 frames. Calculate
Logical address bit
Physical address bit

Differentiate between
a. Relocation and Compaction
b. Paging and Demand Paging
c. Swapping and Thrashing
d. Paging and Segmentation
E. Logical and physical address

9) What is thrashing? What are the causes of thrashing? How can be the effects
of thrashing are limited?
10) Given the memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 KB
(in order), how would each first fit, best fit and worst fit algorithms place processors
of 212 KB, 417 KB, 112 KB and 426 KB (in order)? Which algorithm makes
most efficient use of memory?
11) What is segmentation? Explain in brief the segmentation hardware?
How many page faults occur for the following reference string using 4 page
frames: 1, 2, 3, 4, 5, 3, 4, 1, 6, 7, 8, 7, 8, 9, 7, 8, 9, 5, 4, 5, 4, 2? Use
a. LRU policy
b. Optimal Policy
Consider the page reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7 and main memory
have three page frames, use FIFO, LRU and Optimal page replacement policy and
find out which policy is best and why?
What are the actions taken by operating system if page fault occurs in the system?
How logical to physical address translation is done in paging? Explain with example.
Describe the terms:
a. Internal and external fragmentation
b. Dirty Page and Clean Page

19. Consider the following segment table

Segment Base length

0 219 600

1 2300 14

2 90 100

3 1327 580

4 1952 96

What are the physical addresses for the following logical addresses?
a.0430 b.110 c.2500 d.3400 e.4112

UNIT V

What are the different types of files? What are the functions of each type of
files?
Explain in brief the following allocation method:
Contiguous Allocation
Linked Allocation
Indexed Allocation
Compare and contrast various techniques used for free space management.
With the help of neat diagrams explain index allocation and linked allocation
of disk space to a file with advantages and disadvantages.
Explain in brief the in-memory structure of a file system along with open,
read, and close operations.
What are shared files? How shared files are implemented? How the deletion
operation is dealt with shared files?
What is meant by consistency semantics? Explain implementation in modern
O.S.
Explain different operations that need to be performed on directory.
With the help of need diagrams explain the following directory structures:
Tree structure
Acyclic graph
List and explain the various File Attributes.
What are the different Accessing Methods of a File?
 Define UFD and MFD
What are the types of Path Names, Explain with example?
 Explain concept of file recovery.
What are the Functions of Virtual File System (VFS)?
Explain File system Mounting and Mount point.
Explain Single level Directory and Two level directory.

UNIT VI

Consider the disk of 0 through 199 cylinders and the head is at 53. Let the
pending requests are 98, 183, 37, 122, 14, 124, 65, 67. Compute the total no.
of cylinders traversed in following scheduling
SSTF
SCAN
C-SCAN
C-LOOK
Explain with neat diagram, the I/O hardware, explaining in brief the important
components.
Explain in brief RAID level 3, level 4, level 5 structures.
Describe the services provided by kernel I/O subsystem.
Explain in brief swap space management.
Explain blocking I/O and non blocking I/O.
Explain with example handshaking notion (polling) in brief.
What are boot block and bad blocks? Describe each in brief.
Describe spooling and device reservation.
Explain transforming I/O to hardware operations with the help of life cycle of
an I/O request.
Explain swap space management with the help of BSD text-segment swap
map.
Define interrupt. Explain it in detail.
Explain disk management in detail.
Name and describe 5 major services provided by kernel I/O subsystem.
What is DMA Controller? Explain various steps of DMA transfer process.

Explain application I/O Interface.