Oregon Institute of Technology

CST 352 - Operating Systems

Exam #2 - Review Notes

  1. Process Synchronization
    1. Race Conditions - Pseudocode example
    2. Counitng, Blocking Semaphore/Mutex - Pseudocode example
    3. Counitng, Blocking Semaphore/Mutex application - Pseudocode example
  2. Classic IPC
    1. Producer/Consumer - Semaphore based solution
    2. Dinning Philosophers
  3. Scheduling
    1. Boundedness (I/O vs CPU)
    2. Algorithms
      1. Batch
        1. First Come/First Serve
        2. Shortest Process First
        3. Three Level
      2. Pre-emptive
        1. Round Robin
        2. Priority
        3. Guanenteed
        4. Lottery
        5. Fair Share
  4. Deadlock
    1. Deadlock Conditions
    2. Deadlock Modeling
    3. Deadlock Detection
      1. Ostrich Algorithm
      2. Graph Approach
      3. Matrix Approach
    4. Deadlock Recovery
      1. Recovery through Preemption
      2. Recovery through Rollback
      3. Recovery through Process Killing
    5. Deadlock Avoidance
      1. Bankers Algorithm
      2. Attack Deadlock Conditions
  5. Memory Management
    1. Heap Management
    2. Switching, Swapping, and Paging (Oh My!)