OPERATING SYSTEMS(20PC0501) (R20 ) III SEM

QUESTION BANK
UNIT - I

10 Marks:
S.NO QUESTION CO PO BL

1 Explain the operating system functions? CO1 1,2,3,12 2

2 Explain the operating system structures? CO1 1,2,3,12 2

3 Explain the following i) Process concept ii) process CO1 1,2,3,12 2

scheduling

4 Explain and draw the neat sketch of the process state CO1 1,2,3,12 3
diagram?

5 Explain Operating System services? CO1 1,2,3,12 2

6 Explain in detail Inter-process Communication? CO1 1,2,3,12 2

7 Explain the term process context. Explain the process of CO1 1,2,3,12 2
context switching.

8 Explain about multiprogramming and time sharing operating CO1 1,2,3,12 2

systems?

2 Marks:
S.NO QUESTION CO PO BL

1 Define an operating system? CO1 1,2,3,12 1

2 Describe the operating system operations? CO1 1,2,3,12 2

3 List the open source operating systems? CO1 1,2,3,12 1

 4 Describe the operating system types? CO1 1,2,3,12 2

5 What is a process and process table? What are different CO1 1,2,3,12 1
states of process ?

6 What is a Thread? What are the differences between CO1 1,2,3,12 1

process and thread ?

7 What is kernel ? CO1 1,2,3,12 1

8 Describe the objective of multiprogramming ? CO1 1,2,3,12 2

9 Explain the term ‘System call’.? CO1 1,2,3,12 2

10 What are Methods for Send() and Receive() options? CO1 1,2,3,12 1

UNIT - II

10 Marks:
S.NO QUESTION CO PO BL

1 List and explain various scheduling Criteria. Discuss the CO2 1,2,3,12 2
performance of RR algorithm based on those criteria.

2 Explain Multithreading Models. CO2 1,2,3,12 2

3 What is semaphore? What are operations on semaphore? CO2 1,2,3,12 1

Explain.

4 Discuss Peterson’s algorithm with its Merits and Demerits . CO2 1,2,3,12 2

5 Consider the following set of processes, with the length of CO2 1,2,3,12 5
the CPU burst given in milliseconds and time slice is 3ms:
Process Burst Time Priority P1 10 3 P2 1 1 P3 2 3 P4 1 4
P5 5 2 The processes are assumed to have arrived in the
order P1, P2, P3, P4 and P5 all at time 0. Solve all(FCFS,
SJF, RR, Priority) CPU scheduling algorithms.

6 Explain in detail classic problems of synchronization. CO2 1,2,3,12 4

7 Give a solution to the classic five dining philosopher’s CO2 1,2,3,12 4

problem using monitors.
 8 Consider the following set of processes, with the length of CO2 1,2,3,12 5
the CPU burst given in milliseconds and time slice is 3ms:
Process Burst Time Priority P1 10 3 P2 1 1 P3 2 3 P4 1 4
P5 5 2 The processes are assumed to have arrived in the
order P1, P2, P3, P4 and P5 all at time 0. Solve all( RR,
Priority) CPU scheduling algorithms.

2 Marks:
S.NO QUESTION CO PO BL

1 Compare Pre -emptive and non -preemptive Scheduling . CO2 1,2,3,12 4

2 Define thread? List different types of threads? CO2 1,2,3,12 1

3 List the scheduling criterion? CO2 1,2,3,12 1

4 Define semaphore? List types of semaphores? CO2 1,2,3,12 1

5 List the types of multi threading models? CO2 1,2,3,12 1

6 Explain TestAndSet() and Swap()? CO2 1,2,3,12 2

7 What is the use of locks in critical section problems? CO2 1,2,3,12 1

8 Write the code for Signal() and wait() operations? CO2 1,2,3,12 1

9 Write the syntax of the monitor? CO2 1,2,3,12 1

10 Describe the thread scheduling? CO2 1,2,3,12 2

 UNIT III

10 Marks:
S.NO QUESTION CO PO BL

1 Explain about Memory Management Techniques. CO3 1,2,3,12 2

2 Explain the concept of Deadlock prevention in detail CO3 1,2,3,12 2

3 What is Deadlock? Explain about Characteristics of CO3 1,2,3,12 2

Deadlocks and explain about methods of handling
Deadlocks?

4 Explain about Demand paging and Page Replacement CO3 1,2,3,12 2

algorithms?

5 Define (a) thrashing? CO3 1,2,3,12 1

(b) Fragmentation
(c) Segmentation
(d) Swapping in Memory

6 Explain the page replacement algorithm- optimal. consider CO3 1,2,3,12 6

page reference string 7 0 1 2 0 3 0 4 2 3 0 3 2 and 4 page
slots. Perform page replacement algorithm.

7 Explain Banker’s Algorithm in detail. CO3 1,2,3,12 2

8 Consider the reference string 6, 1, 1, 2, 0, 3, 4, 6, 0, 2, 1, CO3 1,2,3,12 6

2, 1, 2, 0, 3, 2, 1, 2, 0 for a memory with three frames and
calculate number of page faults by using FIFO (First In
First Out) Page replacement algorithm.

2 Marks:
S.NO QUESTION CO PO BL

1 What is swapping and paging? CO3 1,2,3,12 1

2 Define spooling. CO3 1,2,3,12 1

3 What is segmentation? What is the difference between CO3 1,2,3,12 1

fragmentation and segmentation?

4 What is a deadlock? CO3 1,2,3,12 1

 5 What is Thrashing? CO3 1,2,3,12 1

6 Explain the deadlock system model? CO3 1,2,3,12 2

7 What is virtual memory? CO3 1,2,3,12 1

8 Distinguish between page and segment. CO3 1,2,3,12 4

UNIT IV

10 Marks:
S.NO QUESTION CO PO BL

1 Explain Overview of Mass Storage Structure? CO4 1,2,3,12 2

2 Explain in detail about file allocation strategies. CO4 1,2,3,12 2

3 Explain File access methods. CO4 1,2,3,12 2

4 Explain about Allocation methods and free space CO4 1,2,3,12 2

management .

5 Briefly explain about File System Structure CO4 1,2,3,12 2

6 Explain about File System Mounting and File sharing. CO4 1,2,3,12 2

7 Write briefly about file attributes, operations, types and CO4 1,2,3,12 5
structure.

8 Define Free Space management . List and illustrate any two CO4 1,2,3,12 2
free space management techniques.

2 Marks:
S.NO QUESTION CO PO BL

1 Write a short note on SCAN scheduling. CO4 1,2,3,12 1

2 Define seek time and latency time CO4 1,2,3,12 1

3 What are the advantages of Contiguous allocation? CO4 1,2,3,12 1

 4 Define caching. CO4 1,2,3,12 1

5 What are file access methods? CO4 1,2,3,12 1

6 Define buffering. CO4 1,2,3,12 1

7 What are the various file operations? CO4 1,2,3,12 1

8 Draw the block diagram of the disk. CO4 1,2,3,12 2

UNIT V

10 Marks:
S.NO QUESTION CO PO BL

1 Explain Goals and Principles of Protection? CO5 1,2,3,12 2

2 Explain about the Swap space management. CO5 1,2,3,12 2

3 Explain in detail about RAID structures and different levels. CO5 1,2,3,12 2

4 Explain about Disk Structure and Disk Scheduling algorithms. CO5 1,2,3,12 2

5 Explain following scheduling algorithms CO5 1,2,3,12 2

a) FCFS
b) SSTF
c) SCAN

6 Explain following scheduling algorithms CO5 1,2,3,12 2

a) CSCAN
b) LOOK
c) LIFO

7 Explain about kernel subsystems in I/O systems. CO5 1,2,3,12 2

8 Explain in detail about Linux operating systems. CO5 1,2,3,12 2

2 Marks:
S.NO QUESTION CO PO BL
1 Define RAID. CO5 1,2,3,12 1

2 List the Disk scheduling algorithms. CO5 1,2,3,12 1

3 Write a short note on FCFS scheduling CO5 1,2,3,12 1

4 What are services provided by the kernel? CO5 1,2,3,12 1

5 Write a short note on C SCAN scheduling CO5 1,2,3,12 1

6 Write a short note on C LOOK scheduling CO5 1,2,3,12 1

7 Draw the RAID levels. CO5 1,2,3,12 2

8 Give full form for FCFS, SSTF and LIFO. CO5 1,2,3,12 1