Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING

Module wise
Question Bank
Operating Systems-BCS303

Module 1

Sl. Question Marks/Year

No.
1. What is a multiprocessor system? Explain the advantages. (CSA) 6M/
Jan 19, Jan 18
2. Explain the role of an Operating System with respect to 6M/
(i) User view (ii) System view. Jan 19, Jan 18
OR
3. Explain the role of OS from different viewpoints. Explain the dual mode of 8M/
operation of an OS. Jan 20,Feb 21
4. What is a Microkernel? What are the main advantages of the microkernel 8M/Jan 19
approach to operating system design?
5. What is multiprogramming? Compare Multiprogramming and Time-Sharing 8M/Jan 20
Systems. What is the main advantage of multiprogramming?
6. List five services provided by an operating system. Explain how each 5M/Aug 20
provides convenience to the users.
7. What are the two models of IPC? What are the strength and weakness of the 8M/ Jan 19, Jan
two approaches? 18,Jan 20
OR
8. Describe the implementation of IPC using shared memory and message 8M/
passing. Dec
19,Ju
n 19,Jan 20
9. What is a System call? Briefly discuss the types of System calls. 8M/
Jan 20/Jan 2021
10. With a neat diagram, explain the concept of Virtual Machines. 8M/
Jun 19/Jan 20
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING
11. Distinguish between 10M/ Dec 23
(i) Multiprogramming and Multitasking
(ii) Multi Processor and Clustered System
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING

MODULE 2

Sl. No. Question Marks/Year

1. What is a process? Define Process state and give the 10M/Jan 18, Jan 19/ Jan 20
different process states with state transition diagram.
Also explain PCB with a neat diagram.

2. Explain about Process creation and Termination in 8M/Jun 19

UNIX.

3. Distinguish between the following 8M/Jan 18, Jan 19/July 19

(i) Multiprogramming and Multitasking

(ii) Multiprocessor systems and Clustered Systems
4. Analyze modular kernel approach vs layered approach 10M/Jun 19
with neat sketch

5. Explain multi-threading models. 6M/Jun 09,Dec 19, Jan 20, Jan 21,

6. Discuss the threading issues that come with 6M/Jun 19

multithreaded program.

7. Discuss the benefits of multithreaded programming. ** 6M/May 10

8. Differentiate between User and Kernel threads 6M/Dec 10,Jun 12

Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING
9. Suppose the following jobs arrive for processing at the times 10M/ Jun 19,Dec 19, Jan 19, Jan 20
indicated. Each job will run
the listed amount of time.

i. Give a Gantt chart illustrating the execution of these

jobs, using the non-pre-emptive FCFS and SJF
scheduling algorithms.
ii. What is turnaround time and waiting time of each job
for the above algorithms?
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING
iii. Compute average turnaround time if CPU is left idle
for the first 1 unit and then SJF is used. (Job1 and
Job2 will wait during this time)
10. Is CPU scheduling necessary? Discuss the 5M/Dec 19, Jan 20, Jan 21
five scheduling criteria.

11. Describe the action the operating system takes to 6M/May 10, Jan 14
context switch between processes.
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING

Module 3

Sl. No. Question Marks/ Year

1. Illustrate with examples the Peterson's solution for Critical 12M/ Jan 19, Jan 21
section problem and prove that Mutual exclusion property is
preserved. *

2. Show how semaphores provide solution to Readers and 8M/Jun 19,Jan 19, Jan 20
Writers Problem. *

3. Define semaphores. Explain its usage and implementation. 8M/Dec 10,Jun 09

4. What is a Semaphore? What are the basic operations that can 10M/Sep 20, Dec 19
be done on it? What are the advantages of using
Semaphores.

5. What are monitors? Explain Dining Philosopher Problem 10M/Jun 19,Sep 20, Dec 19
using monitors. *

6. What is race condition? What is a Critical section problem? 6M/May 10, Dec 09
Point out and explain its three requirements. *

7. What is busy waiting in Critical Section Problem? Explain 8M/Sep 20

how mutual exclusion is implemented with semaphores. *

8. Explain Mutual exclusion implementation with test and set. 8M/May 10

9. Mention three classical problems of synchronization. Explain 6M/Jun 11

any one in detail.

10. Explain any one Synchronization problem for testing 6M/Jun 18

newly proposed Synchronization scheme.

11. What are monitors? Compare with semaphores with 12M/Jun 11, Jun 12
their relative advantage and disadvantages.

12. What do you mean by a Binary semaphore and counting 10M/Dec 10

semaphores? Explain implementation of wait() and signal()
semaphore operation.

13. Define deadlock. Write notes on the four necessary and 8M/Dec 09/Jan 19/ Jan 20/Feb
sufficient condition for a deadlock to happen. ** 21
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING
14. Briefly explain the methods for handling deadlocks. 8M/May 10
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING

15. What is a Resource Allocation Graph(RAG)? Explain how 8M/Jun 09, May 10,Jun 12,
RAG is useful in describing deadly embrace with an Jan 20
example.
16. Consider the following snapshot of a system: 10M/Jun09,Dec
09,Jan14,May10, Jun12, Jul
ocation ximum ailable 19,Jan 19, Jan 20
BCD BCD BCD

1. 0 1 2 012 520
2. 0 0 0
3. 3 5 4 750
1. 6 3 2
356
014
652

656

Answer the following questions using the Banker’s algorithm;

i. What is the content of the matrix need?

ii. Is the system in a safe state?
iii. If a request from process P arrives for (0, 4, 2, 0)
1

17. Discuss various approaches used for deadlock recovery.** 8M/Jun 09, Jan 14, Jul 19
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING

MODULE 4

S. No. Question Marks/Year

1. Differentiate between

(i) Paging And Segmentation 4M/Jun 09, June 12

(ii) External and Internal Fragmentation 4M/Dec 08,Jun 09, Jun

12,Jan 19

(iii)Logical and physical address 4M/ Jun 12

(iv)First fit and Best fit 4M/Dec08,Jun 12,Jan 14

1. Analyze the problem in simple paging technique and explain how 8M/Jun12,Jan 14,Jan
TLB is used to solve the problem.*** 19,Jan 20

2. Given the memory partitions of 200k,700k,500k,300k,100k,400k- 8M/Dec08,Jan 14,Jun

Apply first fit and best fit to place 315k,427k,250k and 550k * 12,Jan 19, Jan 20

3. lllustrate with example the internal and external fragmentation 6M/ Dec 12, Jun 11, Dec
problem encountered in continuous memory location. 08, Jan 20

4. Explain the concept of forward – mapped page table 6M/ Dec 12,May 10

5. Define paging. Explain paging hardware with a neat block 8M/Dec 09,June 11,Jan
diagram*** 14,Feb 21

6. What is segmentation? Explain basic methods of segmentation with 8M/Dec 10,Jun 09

an example.***

7. What is swapping? Does it increase the operating system overhead? 6M/ Dec 09, Jan 14
Justify.
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING
8. Page replacement algorithm problems 8M/Dec 09,Jun 09, May
10,Jun 11,Dec 12,Dec
Consider the following page reference string: 7 0 1 2 0 3 0 4 2 3 0 3 2 10,Jan 19, Jan 20
1 2 0 1 7 0 1 . For a memory with three frames. How many page faults
would occur for LRU, FIFO and optimal page replacement
algorithms? Which is the most efficient among them?***
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING

(Similar Question)

9. Describe steps in handling page faults.*** 8M/Dec 09,June 09

10. Define file system. Explain different directory structure 8M/Dec 11, Jun 12

11. What do you mean by free space list? With suitable examples, 8M/Dec 10, Jan 14, Jan
explain any 3 methods for free space list implementation*** 19

12. Write short notes on Contiguous, linked and indexed allocation 6M/Dec 10,Jun 12,Dec
method with a neat diagram. *** 11,Dec 13, Jan 19
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING

MODULE 5
Sl. No. Question Marks/Year
Secondary Storage Structures, Protection
1. List the different disk scheduling techniques. Explain any two 8M/Dec 09, Jan 14,Dec
scheduling, considering the following disk queue requests: 12,Jun 11,Dec 08,May
98,183,37,122,14,124,65,67 *** 11,Jun 09,Jun 09,July
(Similar Question) 14,Dec 11,Jan 18, Jan
19
2. Explain any two file allocation methods with their merits and 6M/Dec 10, Jan 14, Jan
demerits. 20

3. Explain briefly various operations performed on files, attributes of a 8M/Dec 10,Jan 14, Jan
file and different types of files*** 20,Feb 21

4. Explain various access methods of files*** 8M/Dec 08, Dec 13,Dec

10,Jun 11,Dec 12, Jan
20

5. Explain file system mounting 4M/Dec 08, Dec 12

6. Explain the different types of directory structures with example and 10M/May 10, 13,14,
explain their advantages and disadvantages. *** Dec 08,1 3, June 11,12

7. Explain Demand Paging in detail. 8M/Jan 19, Jan 20, Feb

21

8. Write short notes on access matrix and it's implementation, by 6M/Jun 12, Jun 14, Jan
considering domain and objects.*** 19, Jan 20
9. Explain various disk scheduling algorithms in detail. 8M/Dec 10, Jul 19, Jan
20
10. Explain access matrix method of system protection 6M/Jun 11, Dec 09, Dec
10,Dec 08
11. Write short notes on: 4M/Jun 12, Jan 14
(a) Swap space management
(b) Revocation of access rights
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING
12. Consider a disk queue with requests for I/O to blocks on cylinders 47, Gate Level Question
38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is
used. The head is initially at cylinder number 63, moving towards
larger cylinder numbers on its servicing pass. The cylinders are
numbered from 0 to 199. The total head movement (in number of
cylinders) incurred while servicing these requests is .
(Similar Question)
Job 1 2 3

Arrival time 0.0 0.4 1.0

RV INSTITUTE OF TECHNOLOGY AND
Burst time 8 4 1
MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by
AICTE, New Delhi) Chaitanya Layout , JP Nagar 8th Phase , Kothanur,
DEPARTMENT Bengaluru-560076
COMPUTER SCIENCE & ENGINEERING