1. Inter Process Communication (IPC) using Message Queues.
2. IPC using pipes.
3. Implementation of wait and signal using counting semaphores.
4. Implementation of wait and signal using binary semaphores.
5. Atomic Counter update problem.
6. Counting Semaphores at the user level using binary semaphores.
7. Signaling processes.
8. Deadlock detection (for processes passing messages)
9. Process Scheduling: FCFS
10. Process Scheduling: Least Frequently Used.
11. Process Scheduling: Round Robin.
12. Producer-Consumer problem with limited buffers.
13. Dining-Philosopher Problem.
14. Reader-Writer problem.
15. Two Process Mutual Exclusion.
Students can refer the following book for further details.
Charles Crowley - Operating Systems ( A Design Oriented Approach) - TMH -
1998.