Modulewise_QuestionBank
Modulewise_QuestionBank
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by AICTE, New Delhi)
Chaitanya Layout , JP Nagar 8th Phase , Kothanur, Bengaluru-560076
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 provides 5M/Aug 20
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,Jun
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
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.
5. Explain multi-threading models. 6M/Jun 09,Dec 19, Jan 20, Jan 21,
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
Job 1 2 3
Burst time 8 4 1
11. Describe the action the operating system takes to context 6M/May 10, Jan 14
switch between processes.
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. *
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. *
10. Explain any one Synchronization problem for testing newly 6M/Jun 18
proposed Synchronization scheme.
11. What are monitors? Compare with semaphores with their 12M/Jun 11, Jun 12
relative advantage and disadvantages.
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
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 example. Jan 20
1. 0 1 2 0 1 2 5 2 0
2. 0 0 0
3. 3 5 4 7 5 0
1. 6 3 2
3 5 6
01 4
6 5 2
6 5 6
17. Discuss various approaches used for deadlock recovery.** 8M/Jun 09, Jan 14, Jul 19
MODULE 4
S. No. Question Marks/Year
1. Differentiate between
1. Analyze the problem in simple paging technique and explain how TLB 8M/Jun12,Jan 14,Jan
is used to solve the problem.*** 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 diagram*** 8M/Dec 09,June 11,Jan
14,Feb 21
7. What is swapping? Does it increase the operating system overhead? 6M/ Dec 09, Jan 14
Justify.
(Similar Question)
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, explain 8M/Dec 10, Jan 14, Jan
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
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 demerits. 6M/Dec 10, Jan 14, Jan
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
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
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
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)
III-Semester, Operating Systems (BCS303) Page 8 | 9
RV INSTITUTE OF TECHNOLOGY AND MANAGEMENT®
(Affiliated to Visvesvaraya Technological University, Belagavi & Approved by AICTE, New Delhi)
Chaitanya Layout , JP Nagar 8th Phase , Kothanur, Bengaluru-560076