MODULE -1
INTRODUCTION TO OPERATING SYSTEMS, SYTEM
STRUCTURES, OS SERVICES
1. Explain storage structure in computer system organization.
2. Explain Multiprocessor Systems and Clustered Systems.
3. Define Operating Systems. Explain dual mode of operating systems with a neat diagram.
4. Describe Storage Management in detail.
5. Differentiate between client server computing and peer-to-peer computing.
6. Explain various OS Services.
7. Discuss briefly about Types of System Calls with illustration.
8. Discuss about System Programs in detail.
9. Explain in detail about Operating System Structure.
10. With a neat diagram, explain the concept of Virtual Machines.
MODULE -2
PROCESS MANAGEMENT, MULTI-THREADED PROGRAMMING,
PROCESS SCHEDULING
1. Explain Process states and PCB with a neat diagram.
2. Explain Scheduler in process execution.
3. Explain Operations on processes with C program.
4. Describe the implementation of Interprocess Communication using shared memory and
message passing approaches.
5. Explain benefits of Multithreaded programming.
6. Explain with diagram about Multithreading Models.
7. Explain briefly thread issues and thread libraries.
8. Explain CPU scheduling criteria.
9. Draw the Gantt Chart and calculate Average Waiting time and Turn around time for the
following process using i) FCFS ii) SJF iii) Round Robin Scheduling (Quantum = 2)
Process Burst time Arrival time
P1 6 0
P2 3 1
P3 1 2
P4 4 3
10. Explain Multilevel Queue Scheduling and Multilevel Feedback-Queue Scheduling.
11. Write a note on Thread Scheduling.
MODULE -3
PROCESS SYNCHRONIZATION, DEADLOCKS
1. What is Critical Section Problem? What are the requirements for the solution to Critical
Section problem? Explain Peterson’s solution.
2. Define Race Condition. State a dining philosopher problem, give a solution using
Semaphore.
3. What is Semaphore? Develop a C program to simulate producer-consumer problem using
semaphores.
4. Show how Semaphores provide solution to readers-writers problem.
5. What is Deadlock? List the conditions that lead to deadlock. How Deadlock can be
prevented?
6. Consider the following snapshot of a system:
Process Allocation Max Available
A B C D A B C D A B C D
P0 2 0 0 1 4 2 1 2 3 3 2 1
P1 3 1 2 1 5 2 5 2
P2 2 1 0 3 2 3 1 6
P3 1 3 1 2 1 4 2 4
P4 1 4 3 2 3 6 6 5
Answer the following using Banker’s algorithm.
i) Is the system in safe state? If so, give the safe sequence.
ii) If process P2 requests (0,1,1,3) resources can it be granted immediately?
7. Explain briefly Resource Allocation Graph Algorithm and how to convert RAG to Wait-for-
Graph.
8. Explain the methods to prevent deadlock.
9. Explain different methods to recovery from deadlock.
MODULE -4
MEMORY MANAGEMENT, VIRTUAL MEMORY MANAGEMENT
1. Write short notes on:
i) External and internal fragmentation.
ii) Dynamic loading and linking.
2. Explain how Address Binding occurs in memory management technique.
3. Briefly discuss about Contiguous Memory Allocation.
4. Given the memory partions of 200k, 700k, 500k, 300k, 100k, 400k. Apply first fit and best
fit to place 315k, 427k, 250k, 550k.
5. What are Translation Load aside Buffer(TLB)? Explain TLB in details with a simple paging
system with a neat diagram.
6. Define Paging. Explain paging hardware with a neat block diagram.
7. Explain the various Structure of Page Table.
8. What is segmentation? Explain basic method of segmentation with an example.
9. What is demand paging? Explain the steps in handling a page fault with a neat diagram.
10. Write a note on Copy-on-Write.
11. For the following page reference string 1,2,3,4,1,2,5,1,2,3,4,5. Calculate the page faults
using FIFO and LRU for memory with 3 and 4 frames.
12. Consider the following sequence: 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1
How many page faults occurs with three page frames:
i) FIFO ii) Optimal iii) LRU page replacement algorithm.
Which one of the above is most efficient?
13. What is thrashing? How can it be controlled?
MODULE -5
FILE SYSTEM, IMPLEMENTATION OF FILE SYSTEM,
SECONDARY STORAGE STRUCTURE, PROTECTION
1. What is a file? What are its attributes, explain file operations.
2. What are the different types of files.
3. Explain the various access methods of files.
4. Explain the various types of directory structures.
5. Explain file system mounting.
6. Briefly explain the concept of File Sharing.
7. Discuss in brief about File-System Implementation.
8. Explain various allocation methods in implementing file systems.
9. What do you mean by free space list? With suitable example, explain any 3 methods of free
space list implementation.
10. Write a note on the following:
i) Magnetic Disks ii) Magnetic Tapes
11. What are various Disk Attachment methods.
12. Explain various disk scheduling algorithm with an example.
13. Given the following sequences 95,180,34,119,11,123,62,64 with the head initially at
track 50 and ending at track 199. What is the total disk traveled by the disk arm to satisfy
the request using FCFS, SSTF, LOOK and CLOOK algorithm.
14. Write a note on Domain of Proctection
15. Explain access matrix protection system of O.S.
