All lecture notes for Lecture 11, 12, 13, 14, 15, 16, 17

Textbook: Chapters 8, 9, 10, 11, 12-12.4, 13

---------------------------------------------------------------------

Lecture 10: Memory allocation
  - Abstraction provided by the memory managment sub-system
  - Memory allocation problem definition
  - Static/Dynamic memory organization
  - Memory allocation schemes: static, buddy system, dynamic memory 
    allocation schemes
    o first fit, next fit, best fit, worst fit
  - dynamic memory allocation scheme implementation (Project No. 3)

Lecture 11: Memory protection
  - Physical address, logical address
  - Address binding, when is it done?
  - dynamic loading, dynamic linking, and shared library
  - swapping
  - Mechanisms that enable memory protection
  
Lecture 12: Address translation
  - Based-and-bound
  - Segmentation
  - Paging
  - Multi-level translation
  - Paged page tables
  - Hashed page tables
  - Inverted page tables

Lecture 13: Virtual Memory
  - Motivation
  - How it works
  - Analyzing performance
  - Page replacement algorithms
    - Random, FIFO, LFU, LRU, MIN (optimal), 
    - Belady's Anomaly
  - Implementing LRU
    - clock algorithm
    - N-th chance algorithm
  - Thrashing
  - Working Set
  - Global/Local replacement algorithms

Lecture 14: Device Management
  - Block device/Character device
  - The relationship among user application, OS components, device drivers,
    device controllers, and I/O devices
  - Device Addressing methods:
    o Separate address and memory mapped
  - Ways to access a device:
    o Polling, interrupt, DMA
  - Disk related concepts:
    o tracks, cylinders, sectors, 
    o seek time, rotational time, and transfer time
  - Disk ARM scheduling algorithms:
    o FCFS, SSTF, SCAN, C-SCAN

Lecture 15: File System
  - File system abstractions
  - File system components:
    o disk management, naming, protection, reliability
  - Files (viewed from different levels)
  - File header
  - Disk allocation policies (how to realize each one of them)
    o contiguous allocation
    o link-list allocation
    o segment-based allocation
    o indexed allocation
    o multi-level indexed allocation 
    o hashed allocation

Lecture 16: Naming
  - i-node (what is it? where is it stored?)
  - directories
  - Name space
    o flat name space, hierarchical naming, relational name space,
      contextual naming, content-based naming

----------------------------------------------------------------------

concepts and techniques: 
   define the concepts (What), 
   explain how each technique works (How),
   
   apply techniques to new situations

-------------------------------------------------------------------------

Question types:

  1. True/False 
  2. definition and short explanation 
  3. questions with longer answers/calculations testing your understanding of 
     various concepts and/or techniques.