Unit 3: Process Management - RGPV Syllabus
Topic 1: Process Scheduling Algorithms
1.Round Robin Scheduling:
Q- How does Round Robin scheduling work?
Ans - Round Robin assigns each process a fixed time quantum, allowing them to execute in a cyclic manner.
Q- How does the time quantum parameter affect system performance?
Ans- A shorter time quantum increases context switches, affecting throughput, while a longer one may lead to poor responsiveness.
Q - Compare Round Robin with other scheduling algorithms in terms of fairness?
Ans - Round Robin offers fair distribution of CPU time among processes, unlike algorithms favoring short processes.
2. Priority Scheduling:
Q - What is priority scheduling, and how does it relate to real-time systems?
Ans- Priority scheduling assigns priority levels to processes, crucial for real-time systems to meet specific deadlines.
Q- What are the potential issues with priority scheduling?
Ans- Starvation, where low-priority processes may not get CPU time, and priority inversion, causing priority conflicts.
Q- How does aging enhance the effectiveness of priority scheduling?
Ans - Aging gradually increases the priority of waiting processes, reducing the risk of starvation.
Topic 2: Process Synchronization
1. Semaphore Mechanism:
Q- Explain the role of semaphores in process synchronization?
Ans- Semaphores are synchronization tools that control access to shared resources, preventing race conditions.
Q - How do binary and counting semaphores differ?
Ans - Binary semaphores have two states (0 or 1), while counting semaphores can have multiple values, allowing for resource counting.
Q- Provide examples of how semaphores solve the critical section problem?
Ans - Semaphores ensure exclusive access to shared resources, preventing multiple processes from entering critical sections simultaneously.
2. Monitors:
Q - What are monitors, and how do they differ from semaphores?
Ans - Monitors are high-level synchronization constructs, simplifying synchronization compared to low-level semaphores.
Q - How do monitors handle synchronization and mutual exclusion?
Ans - Monitors encapsulate shared data and procedures, ensuring mutual exclusion through access control mechanisms.
Q- Give examples of situations where monitors are useful?
Ans - Monitors are beneficial for situations where complex data structures or shared resources need controlled access and synchronization.
Topic 3: Deadlocks and their Management
1. Deadlock Prevention:
Q - Explain the Banker's algorithm for deadlock prevention?
Ans - The Banker's algorithm checks if resource allocations will lead to a safe state, preventing potential deadlocks.
Q - How are resource allocation graphs used in deadlock prevention?
Ans - Resource allocation graphs represent resource dependencies, aiding in detecting and preventing circular waits.
Q - Highlight trade-offs involved in implementing deadlock prevention strategies?
Ans - Deadlock prevention may impact system resource utilization and throughput, requiring a balance between prevention and performance.
2. Deadlock Detection and Recovery:
Q - Describe the steps involved in deadlock detection?
Ans - Deadlock detection involves periodically examining the resource allocation graph for circular wait conditions.
Q-Discuss recovery strategies once a deadlock is detected?
Ans - Recovery may involve process termination, resource preemption, or a combination to break the deadlock.
Q - Explore the challenges of implementing deadlock recovery mechanisms?
Ans - Implementing recovery mechanisms requires careful consideration of system state consistency and potential performance impact.
Topic 4: Inter-Process Communication (IPC)
1. Message Passing:
Q- Compare message passing and shared memory as methods for IPC?
Ans - Message passing involves direct communication between processes, while shared memory allows processes to exchange data indirectly.
Q -Discuss scenarios where message passing is more suitable than shared memory?
Ans - Message passing is preferable when communication involves small, discrete messages and processes need synchronization.
Q - How does message passing contribute to inter-process coordination?
Ans - Message passing enables processes to exchange information, facilitating coordination and cooperation between them.
2. Pipes in Unix-like Systems:
Q - Explain the concept of pipes in Unix-like operating systems?
Ans - Pipes are communication channels that allow data flow between processes, often used for connecting the output of one process to the input of another.
Q - Discuss how pipes facilitate communication between processes?
Ans - Pipes establish a unidirectional communication link, allowing data to be transmitted from one process to another.
Q - Provide examples of practical use cases for pipes in process communication?
Ans - Pipes are commonly used in Unix-like systems for commands that require the output of one process to serve as the input for another.
These simple answers with concise explanations for each question within the context of RGPV syllabus.
0 Comments