Scribd
Upload
74 views2 pages

OS Module Wise Question Bank

Uploaded by

selzee040
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
74 views2 pages

OS Module Wise Question Bank

Uploaded by

selzee040
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

OS Module wise Question Bank

Module – 1
Operating System Principles
1. Explain the dual mode operation of operating system.
2. Explain layered approach structure of operating system with diagram.
3. Differentiate client server computing and peer-to-peer computing.
4. Define operating system. Explain operating system services with respect to user and
system with diagram.
5. With a neat diagram explain the concept of virtual machines.
6. What do you mean by system call? Explain the types of system call.
7. Define System program. Explain multiprogramming and time-sharing systems.
8. Explain the components of OS with diagram.
9. Explain about the computer system organization with diagram.

Module – 2
1. With a neat diagram, explain the different states of a process.
2. Explain scheduler in process execution.
3. Explain direct and indirect communication in message passing systems.
4. Discuss in detail about multithreading models.
5. Explain the benefits and issues of multithreading.
6. Explain the different scheduling criteria in process scheduling.
7. Explain in details multiple processor scheduling.
8. What is a dispatcher and dispatch latency.
9. Scheduling algorithms – Problems

Module – 3
1. Explain critical section problem. What are the requirements that critical section
problem must satisfy.
2. Illustrate Peterson’s solution to critical section problem.
3. Explain how semaphores provide solution for Reader-Writer problem.
4. State dining philosopher problem using semaphore.
5. Describe the resource allocation graph 1) with deadlock 2) without deadlock.
6. Bankers Algorithm and problem.
7. What is a deadlock? What are the necessary conditions for a deadlock to occur?
8. Explain in detail how deadlocks can be prevented.
9. Explain the different methods to recover from deadlock.
Module – 4
1. Explain paging with necessary diagrams.
2. Explain the various structure of page table.
3. Explain paging hardware using TLB
4. Explain segmentation.
5. Explain copy-on-write process in virtual machine.
6. Explain in detail about contiguous memory allocation.
7. Discuss briefly about demand paging.
8. Describe the steps in handling page fault.
9. Consider a reference string 2,1,3,4,5…. Find out the number of page faults using
FIFO, Optimal, LRU.
MODULE – 5
1. Discuss briefly about file attributes in a file system.
2. Discuss briefly about file operations and its types.
3. Explain File Mounting.
4. Explain any two disk allocation methods with diagram.
5. List the different operations on a directory.
6. Explain different directory structures.
7. Explain single level directory and two-level directory. Mention its advantages and
disadvantages.
8. Discuss in details about overview of mass storage structure.
9. Explain the various disk scheduling algorithms.
10. Explain free space management.
11. Explain Access Matrix model in protection.
12. List out the goals and principles of protection.

You might also like