)
- Scheduling Theory
- Basic Queuing Theory
- Hard Drive & Ssd Speeds
- Hard Drive Block Size
- Hard Drive Scheduling Algorithms
- Deadlock
- Memory Paging, Segmentation, Contiguous
- Defragmentation
- Caching Theory (Concepts, No Formulas)
- Page Replacement Policies
EXAMPLE QUESTIONS
- Describe what the bankers algorithm does
- CPU scheduling must balance 3 different goals. What are they?
- Describe the 4 necessary conditions for deadlock
- Describe some of the benefits of paging
- Virtual addressing allows more efficient uses of memory. Describe at least 2 ways memory is wasted in systems that don’t use virtual addressing
- Describe the pros and cons of hierarchical or multilevel paging in comparison to single level paging
- Describe what an inverted page table is
- Describe the disk scheduling algorithms FCFS, SSTF, SCAN, and LOOK
- Describe direct mapped, set associative, and fully associative cache