The final will be Tuesday, May 7, from 3-4:50 PM in Wright 5. You will again get a one-page (front and back) 8.5" x 11" "cheat sheet" of notes.

About 75% of the final will be over chapters 5, 6, and 7. The remaining 25% will be more comprehensive in nature. However, this comprehensive questions will not expect you to know the details of the other chapters, but instead focus on the "big picture."

Some possible questions that you might want to look at over the material since the last test would be:

Chapter 5: 5.1, 5.2, 5.3

Chapter 6: 6.3, 6.4 (Should be "Repeat Problem 6.3...")

Chapter 7: 7.2, 7.4, 7.6, 7.9, 7.10

I'll post the answers outside my door.

Chapter 5. External memory

Magnetic disk- organizaton/format; characteristics; access time (seek time, rotational delay/latency)

RAID - levels and their relationship to error-correcting, I/O request rate, and data-transfer rate

Chapter 6. I/O

General idea of interrupts

I/O module operation and function

I/O instructions: memory-mapped I/O and isolated I/O

I/O techniques: programmed I/O, interrupt-driven I/O, and direct-memory access (DMA)

Chapter 7. OS Support

OS objectives and functions

Effects of multiprogramming on system utilization

Process control block (PCB) components

Scheduling of jobs: types of queues and their purpose

Scheduling techniques, priorities, and fairness

Memory management: swapping, fixed partition and variable partitioning

Paging: virtual memory, demand paging, page table and virtual to physical

address translation, time and memory efficiency considerations, TLB

(translation lookaside buffer)

Handling of large page tables: two-level page table, inverted page table

Segmentation: advantages and disadvantages

Segmentation and paging combined

Page-replacement algorithms and their implementation (R-bits & history bits)

Frame-allocation algorithms: page-fault frequency algorithm