RUNGTA COLLEGE OF ENGG.

& TECHNOLOGY, BHILAI

Question Bank – Operating Systems
CSE (Data Sciences) – B109313 (022)
CSE (AIML) – B109313 (022)

UNIT-1
Sr.No. Questions CO BT
1 Explain the functions of OS? CO1 L1
How operating system plays an important role between user & system? CO1
2 L2
OR Why Os is defined as Resource Manager? (with diagram)
3 CO1
Compare different types of OS with their needs & Advantages L1,L2
4 Give difference between hard & soft real time systems with their CO1
L2
applications?
5 What are the major components of OS, explain with their architecture & CO1
L2,L1
functions?
6 Explain the distributed computing & parallel computing with suitable CO1
L2
examples?
7 CO1
Define Kernel & its types? L1
8 CO1
Explain System Call? L1
9 CO1
Explain the logical & physical structure of OS? L1,L2
10 CO1
Explain following in OS -: (I) Protection (II) Input Output Trends? L1
UNIT-2
Sr.No. Questions CO BT
Explain the term “Process”. What are its states? OR L1
1 CO2
What are operations has been performed on processes? L2
CO2
2 Explain process state transition with its diagram? 05/07 states L1
3 CO2
What is Convoy effect in SJF & FCFS. L1
4 Explain the following with their solution-: (with diagram) CO2
I Critical Section problem. VI. Process Control Block
II. Reader’s Writer’s Problem. VII. Semaphore.
L3
III. The dining Philosopher Problem.
IV. Mutual Exclusion.
V.RACE Condition.
5 CO2
What is scheduler? Explains its types? Explain its characteristics? L2
6 Consider the following-: Arrival of processes – P1,P2,P3,P4,P5 AT time 0. CO2
Process Burst Time Priority
P1 10 3
P2 1 1
L5
P3 2 3
P4 1 4
P5 5 2
Solve it using FCFS, SJF, & RR (quantum=1) calculate avg. TAT,WT,CT.
7 Process Arrival Burst Priority Consider the following-: Arrival of
Time Time processes –
P1 0 4 2 If the CPU scheduling policy is
P2 1 3 3 priority non-preemptive, calculate
L5
P3 2 1 4 the average waiting time and CO2
L6
P4 3 5 5 average turnaround time. (Higher
P5 4 2 5 number represents higher priority).
OR Compare all scheduling
algorithm for this problem.
Sr.No. Questions CO BT
8 What is inter process communication? CO2 L1
9 What is Parallel Processing in concurrent process. CO2 L1,L2
10 Solved example w.r.t to critical section, semaphore? CO2 L1

UNIT-3
Sr.No. Questions CO BT

1 Explain term deadlock in context of Operating system? CO3 L1

Exaplin the conditions with diagram which leads to deadlock CO3 L2
2
Explain Resource Allocation Graph? – Vertices & Edges, Single & Multiple CO3 L1
3
Instances? Solved examples of GALVIN L2
Explain following methods of Deadlock handling-: L2
CO3
4 Deadlock Ignorance Deadlock Prevention L3
Deadlock Avoidance Deadlock detection
How Deadlock detection & Recovery could be implemented? CO3 L2
5
Explain Banker’s Algorithm with its flowchart/steps? CO3 L2
6
Any Numerical (SOLVED or UNSOLVED) of Banker’s algorithm for CO3 L5
7 L6
deadlock detection & recovery? (TO be done in class)

8 CO3 L6

UNIT-4
Sr.No. Questions BT BT

1 What is resident Monitor OR Explain the term page fault & why it occurs? CO4 L2
2 What is Thrashing? How system does detects the Thrashing? CO4 L2

3 CO4 L5

4 Explain multiprogramming with fixed partition with suitable example? CO4 L1,L2
 5

L5
CO4
L6

6 Explain Demand Paging? CO4 L2

7 Explain the following Segment Table-:
What are physical addresses for the following logical addresses?
A.0430 B. 110 C. 2500 D. 3400 E. 4112
Segment Base Length
L5
0 219 600 CO4
L6
1 2300 14
2 90 100
3 1327 580
4 1952 96
9 What is Segmentation? Explain virtual to physical address mapping in a
CO4 L5
segmented syatem with the help of a diagram?
10 How many page faults occur for any one of the algorithm for the following
reference string, for 04 page frames- L5
CO4
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2 L6

UNIT-5
Sr.No. Questions CO BT
Suppose that a disk drive has 5000 cylinders numbered from 0 to 4999. The
drive is currently serving a request at cylinder 143, and the previous request
was cylinder 125, The queue of pending requests in FIFO order is
86,1473,913,1774,948,1509,1022,1750,130
1 Starting from current head position what is the total distance (in cylinders) that CO5 L5
the disk arm moves to satisfy all the pending requests for each of the following
disk-scheduling Algorithm
A.FCFS B. SSTF. C.SCAN
D. LOOK E. C-SCAN F. C-LOOK

2 CO5 L5

3 Explain difference between sequential, indexed & indexed sequential file? CO5 L2

4 Explain different types of Buffering? CO5 L1

5 Explain different types of file access methods with suitable diagram? CO5 L2

6 Explain the concepts of Virtual Machine & its benefits? CO5 L1

7 Explain Program driven & Interrupt driven Input & Output? CO5 L2

8 Explain Directory Organization & File Organization & access mechanism? CO5 L1

9 Explain various disk scheduling algorithm with proper example? CO5 L2

10 What is Latency Time CO5 L1

11 Explain contiguous,linked, indexed allocation methods? CO5 L2