Scribd
Upload
13 views

OS QuestionBank

question bank

Uploaded by

24a51d5807
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
13 views

OS QuestionBank

question bank

Uploaded by

24a51d5807
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

II-B.

TECH II-SEMISTER CSE


OPERATING SYSTEMS QUESTION BANK

UNIT-1
1. What are the system components of an operating system and explain them?
2. What are the various process scheduling concepts?
3. Explain about inter process communication.
4. Define system call. List various types of system calls.
5. Explain the System Structure of Operating System.
6. Explain the concept of multithreading with neat sketch.
7. Describe various scheduling evaluation methods.
8. Write about the various CPU scheduling algorithms.

UNIT-2
1. Explain the various classic problems of synchronization
2. Write note on TSL and SWAP instruction
3. Write the Peterson’s algorithm is? Algorithm for the mutual exclusion problem and
explain the same.
4. What are the principles of concurrency and explain the execution of the concurrent
process with a simple example.
5. Write the critical section problem and what are the constraints should require
avoiding critical section problem?
6. How to acquire locks while using Synchronize Hardware to avoid the critical section
problem?
7. Explain semaphore, and implement semaphores using mutual exclusions?
8. Describe how the swap and TestAndSet instructions can be used to provide mutual
exclusion that satisfies bounded waiting requirement?

UNIT-3
1. Give a detailed description about deadlocks and its characterization
2. What are the conditions for occurring the deadlocks and give the solutions to avoid
deadlocks.
3. Explain about the methods used to prevent deadlocks
4. Explain the Banker’s algorithm for deadlock avoidance.
5. Describe briefly about recovery from dead lock.

UNIT-4
1. Write in brief on the following memory management techniques comparing their
relative strengths and weaknesses
a) Fixed partitioning b) Dynamic portioning
2. Write a short note on paging?
3. Write a short note on page table structure?
4. Write a short note on segmentation?
5. How memory protection can be accomplished in a paged environment? Explain?
6. Explain the following allocation algorithms?
7. Describe the hardware that is required to support paging with an acceptable amount
overhead
8. Why are segmentation and paging sometimes combined into one system?
9. What is fragmentation? Give different types of fragmentation and also give solutions?
10. Explain about contiguous memory allocation.
11. Give the basic concepts about paging.
12. Explain about the techniques for structuring the page table.
13. Explain the basic concepts of segmentation
14. Explain the various page replacement strategies.

UNIT-5
1. What are files and explain the access methods for files?
2. Explain File system implementation
3. Explain the various Directory structures
4. Write notes about the protection strategies provided for files
5. Explain the various File allocation methods
6. Write note on (i) Log structured file system
(ii) Efficiency and Usage of disk space
(iii) File system mounting

UNIT-6
1. Explain the various disk scheduling techniques
2. Write notes about disk management and swap-space management.
3. Compare the performance of C-SCAN and SCAN scheduling,
4. Explain Disk management in detail
5. Explain briefly about the disk structure with neat diagram.
6. Explain briefly about the block and character devices.
7. Write briefly about disk attachment.
8. Write short notes on the following.
a) Seek time b) Rotational delay c) Access time d) Transfer time

You might also like