[12/09/2011]

FINAL EXAM THURSDAY 12/15 from 3:00-6:00pm in DCC 324

OPEN BOOK, OPEN NOTES, NO COMPUTER, CALCULATOR OKAY

FIVE QUESTIONS:
(1) What is the EXACT output of given C code
     Unix system calls, C-specific stuff, etc.
    Extend the code by adding functionality to do ______.

(2) Contiguous Memory Allocation (i.e. Project #2 stuff)
    -- fragmentation (interval vs. external)
    -- defragmentation
    -- algorithms (first-fit, best-fit, next-fit, worst-fit)

(3) Noncontiguous Memory Allocation
    -- fragmentation (internal fragmentation only)
    -- no need for defragmentation
    -- addressing scheme
        (mapping logical addresses to physical addresses)

(4) Virtual Memory
    -- page replacement algorithms
    -- page faults

(5) Disk I/O Scheduling
    -- algorithms for seeking to tracks

=============================================================

Project #2
-- Noncontiguous memory: you do not have to implement a
    page table, etc.  You can simply use the 1-dimensional
     array representing memory and walk through that.