Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
SlideShare a Scribd company logo

Os Question Bank

•
•
Sonali Chauhan
Sonali Chauhan

This document contains a question bank on various topics in operating systems including: 1. Process synchronization questions focusing on critical section problems, semaphores, and solutions for two processes. 2. Memory management questions on paging and segmentation. 3. Deadlock questions on safe/unsafe states, bankers algorithm, prevention/avoidance strategies, and recovery from deadlocks. 4. CPU scheduling questions on algorithms like FCFS, RR, SJF and characteristics like short term, long term and medium term schedulers. 5. Process management questions on states, control blocks, creation/termination, and interprocess communication. The questions provided are meant to help students study notes

1 of 5
Download to read offline
Question bank Of Operating System| Note: Study my notes and assignments and Tutorial Question. These are just few questions. Just don’t rely on these questions. Process Synchronization 1. State The critical section problem. What requirements must a solution to the critical section problem satisfy? 2. State the structure of semaphore highlighting how it can be used for process synchronization 3. Define Semaphore 4. a. Consider the following snapshot of a system and Answer the following 1) Find the content of NEED Column. 2) Find whether system is safe or not using banker’s Algorithm 3) Apply the resource-request algorithm when the request of P5=(1 0 2) 4) If yes then give the safe sequence Process Allocation Maximum Available R1 R2 R3 R1 R2 R3 R1 R2 R3 P1 0 1 0 7 5 3 3 3 2 P2 2 0 0 3 2 2 P3 3 0 2 9 0 2 P4 2 1 1 2 2 2 P5 0 0 2 4 3 3 5. What are 2 process solutions? 6. Explain Peterson Algorithm. How it fulfill all the requirement of Critical Section 7. Explain Binary Semaphore 8. Explain all 3 algorithm solution for process synchronization for 2 process? 9. Define Starvation 10. Explain Bakery Algorithm? 1 Compiled By Sonali Chauhan, U.D.I.T
Question bank Of Operating System| Memory Management 1. What is paging? Explain basic method used for paging? 2. What is segmentation? Explain basic method used for segmentation? 2 Compiled By Sonali Chauhan, U.D.I.T
Question bank Of Operating System| Deadlock 1. What do you understand by safe and unsafe state? Explain Bankers algorithm with necessary data structure for deadlock avoidance 2. Explain 2 strategies used for eliminating deadlocks 3. What is deadlock? State the necessary condition for deadlock and explain any one strategy of deadlock prevention 4. Explain Bankers algorithm with necessary data structure for deadlock avoidance. 5. State the necessary condition for deadlock occurrence. 6. Define Deadlock Prevention and Deadlock Avoidance. Explain 4 criteria for deadlock Prevention 7. Explain how can we eliminating deadlock by aborting a process? - Abort all deadlocked processes - Abort 1 process at a time until the deadlock cycle is eliminated. 8. Explain how we eliminating deadlock by Resource preemption can. - Selecting a victim - Rollback - Starvation 9. How can we recover from deadlock? - Process Termination - Resource preemption 10. Explain a algorithm that examines whether a deadlock has occurred? - Single instance of each resource type - Several instance of resource type 11. Explain 2 deadlock avoidance algorithms? - Safe State - Resource allocation graph algorithm 12. Explain how can we prevent deadlock? 3 Compiled By Sonali Chauhan, U.D.I.T
Question bank Of Operating System| CPU Scheduling 1. State and explain various characteristic criteria for CPU Scheduling algorithm 2. Describe priority scheduling algorithm 3. List the various scheduling criteria in CPU Scheduling 4. State and explain FCFS scheduling algorithm 5. Describe the difference between 3 type : Short term, long term ,midterm scheduler 6. What is process scheduling? Explain the basic of ANY TWI Algorithm: 1. FCFS 2. RR 3. SJF 7. Difference between all the scheduling algorithm 8. Problems/Sums on CPU scheduling 4 Compiled By Sonali Chauhan, U.D.I.T
Question bank Of Operating System| Process Management 1) What is process? Explain 2 stated process 2) Explain 5 state process model 3) Explain task control block. 4) Explain operation on process - Creation - Termination 5) Explain process scheduling. 6) What are schedulers: explain Short term, long term, medium scheduler. 7) Write a short note - Multitasking /time sharing system - Batch systems - Clustered system - Multiprocessor - Multiprogrammed systems - 8) Services of OS 9) What is cooperative process? 10) What is interprocess communication 11) Short note on: a) Message passing system b) Direct indirect communication c) Synchronization (synchronous and asynchronous) d) Buffering 12) Explain single threaded process and multi threaded process 13) What are threads? What are it benefits? 14) Explain multithreading models? 15) Explain context switch? 5 Compiled By Sonali Chauhan, U.D.I.T

More Related Content

Os Question Bank

  • 1. Question bank Of Operating System| Note: Study my notes and assignments and Tutorial Question. These are just few questions. Just don’t rely on these questions. Process Synchronization 1. State The critical section problem. What requirements must a solution to the critical section problem satisfy? 2. State the structure of semaphore highlighting how it can be used for process synchronization 3. Define Semaphore 4. a. Consider the following snapshot of a system and Answer the following 1) Find the content of NEED Column. 2) Find whether system is safe or not using banker’s Algorithm 3) Apply the resource-request algorithm when the request of P5=(1 0 2) 4) If yes then give the safe sequence Process Allocation Maximum Available R1 R2 R3 R1 R2 R3 R1 R2 R3 P1 0 1 0 7 5 3 3 3 2 P2 2 0 0 3 2 2 P3 3 0 2 9 0 2 P4 2 1 1 2 2 2 P5 0 0 2 4 3 3 5. What are 2 process solutions? 6. Explain Peterson Algorithm. How it fulfill all the requirement of Critical Section 7. Explain Binary Semaphore 8. Explain all 3 algorithm solution for process synchronization for 2 process? 9. Define Starvation 10. Explain Bakery Algorithm? 1 Compiled By Sonali Chauhan, U.D.I.T
  • 2. Question bank Of Operating System| Memory Management 1. What is paging? Explain basic method used for paging? 2. What is segmentation? Explain basic method used for segmentation? 2 Compiled By Sonali Chauhan, U.D.I.T
  • 3. Question bank Of Operating System| Deadlock 1. What do you understand by safe and unsafe state? Explain Bankers algorithm with necessary data structure for deadlock avoidance 2. Explain 2 strategies used for eliminating deadlocks 3. What is deadlock? State the necessary condition for deadlock and explain any one strategy of deadlock prevention 4. Explain Bankers algorithm with necessary data structure for deadlock avoidance. 5. State the necessary condition for deadlock occurrence. 6. Define Deadlock Prevention and Deadlock Avoidance. Explain 4 criteria for deadlock Prevention 7. Explain how can we eliminating deadlock by aborting a process? - Abort all deadlocked processes - Abort 1 process at a time until the deadlock cycle is eliminated. 8. Explain how we eliminating deadlock by Resource preemption can. - Selecting a victim - Rollback - Starvation 9. How can we recover from deadlock? - Process Termination - Resource preemption 10. Explain a algorithm that examines whether a deadlock has occurred? - Single instance of each resource type - Several instance of resource type 11. Explain 2 deadlock avoidance algorithms? - Safe State - Resource allocation graph algorithm 12. Explain how can we prevent deadlock? 3 Compiled By Sonali Chauhan, U.D.I.T
  • 4. Question bank Of Operating System| CPU Scheduling 1. State and explain various characteristic criteria for CPU Scheduling algorithm 2. Describe priority scheduling algorithm 3. List the various scheduling criteria in CPU Scheduling 4. State and explain FCFS scheduling algorithm 5. Describe the difference between 3 type : Short term, long term ,midterm scheduler 6. What is process scheduling? Explain the basic of ANY TWI Algorithm: 1. FCFS 2. RR 3. SJF 7. Difference between all the scheduling algorithm 8. Problems/Sums on CPU scheduling 4 Compiled By Sonali Chauhan, U.D.I.T
  • 5. Question bank Of Operating System| Process Management 1) What is process? Explain 2 stated process 2) Explain 5 state process model 3) Explain task control block. 4) Explain operation on process - Creation - Termination 5) Explain process scheduling. 6) What are schedulers: explain Short term, long term, medium scheduler. 7) Write a short note - Multitasking /time sharing system - Batch systems - Clustered system - Multiprocessor - Multiprogrammed systems - 8) Services of OS 9) What is cooperative process? 10) What is interprocess communication 11) Short note on: a) Message passing system b) Direct indirect communication c) Synchronization (synchronous and asynchronous) d) Buffering 12) Explain single threaded process and multi threaded process 13) What are threads? What are it benefits? 14) Explain multithreading models? 15) Explain context switch? 5 Compiled By Sonali Chauhan, U.D.I.T