Part -1:
Study Questions
1. What are the main features of processes?
2. What information is included in PCB?
3. What data structures are involved in process scheduling?
4. What is the rationale for each kind of scheduler: long-term, short-term, and medium-term schedulers?
5. How do you use fork() to create a process?
Part -2:
1. Why is process cooperation supported in modern operating systems? What are the benefits?
2. What is the difference between IPC and RPC?
3. How are shared memory, message passing, RPC, sockets, and pipes implemented practically in systems such as POSIX, Mach, and Windows?
Part -3:
1. What is the motivation for using multiple threads in a process?
2. What are the benefits of using multithreaded programming?
3. What are the differences between user-level threads and kernel-level threads?
4. How do POSIX, Java, and Windows implement their thread libraries?
5. How can thread libraries be used for multithreaded programming?
Part -4:
1. Why is CPU scheduling very important in modern operating systems?
2. What are the differences between pre-emptive and cooperative scheduling? How are pre-emptive scheduling and cooperative scheduling used in operating system design?
3. What are the main CPU scheduling algorithms, and how do they work?
4. What are the issues unique to multiple processor scheduling compared to single CPU scheduling?
5. In practice, how do operating systems perform CPU scheduling?
Part -5:
1. What is the purpose of process synchronization?
2. What requirements should be satisfied to solve the critical-section problem?
3. What are the differences between hardware instruction and semaphore-based solutions?
4. What are the differences between semaphore and monitor? How are they used for solving the classic problems of synchronization?
5. How do Windows and Linux support process synchronization?
6. What is conflict serializability, and how can locking protocols be used to ensure it?
Part -6:
1. Why is it important to learn to handle deadlock issues?
2. What are the necessary conditions for a deadlock to happen, and how can knowledge of these conditions be used in deadlock prevention?
3. How can one determine whether a state is safe state (deadlock free)? How can this knowledge be used to avoid deadlock?
4. What data structures are used in deadlock avoidance and deadlock detection?