Oregon Institute of Technology

CST 352 - Operating Systems

Final - Review Notes

 

  1. OS breakdown.

  2. OS Definitions
    1. Concurrency
    2. Context
    3. Process
    4. Thread
    5. Switching
    6. Swapping
    7. Paging
    8. Heap Management vs. Memory Management

  3. Process Creation
  1. Thread Creation
  1. Process State Transition Diagram
    1. Active
    2. Execute
    3. Blocked

  2. Race Conditions
    1. Example with multiple threads
    2. Example walk through

  3. Process Synchronization
    1. Semaphores
    2. Mutex

  4. Scheduling
    1. I/O Bound
    2. CPU Bound
    3. Scheduling Algorithms
      1. First Come/First Serve
      2. Round Robin Scheduling
      3. Priority Scheduling
      4. Guaranteed Scheduling
      5. Lottery Scheduling
      6. Fair Share Scheduling

  5. Deadlock
    1. Deadlock Conditions
    2. Removing deadlock from a system

  6. Memory Management
    1. Virtual Memory
      1. Paging
        1. Page Table Layout and Construction
        2. Address Resolution
        3. Page Table Parameters
        4. Principle of Locality
        5. TLB
      2. Page Replacement Algorithms
        1. Not Recently Used
        2. First-in/First-out
        3. Second Chance
        4. Least Recently Used
        5. Working Set

  7. I/O
    1. I/O Programming
      1. Polled
      2. Interrupt Driven
      3. DMA

  8. File Management
    1. Basic Strategies
    2. FAT
    3. NTFS

Expect to have the the following questions on the Final: