1. Test 2 Preparation

2. General Information Close book, close notes Review online course notes and read the book. You may work on some exercise problems at the end of each chapter. No memorization is needed. The focus will be understanding the major concepts/principles covered in the course. Be familiar with reading C code, and writing some pseudo code. No need to memorize specific APIs. Question types: – multiple choice question, short answers, problem solving.

3. General Information (cont.) The test will focus on materials from chapters 6 – 9, 11, 12. However, it will also tie in material from earlier this semester. The test will not ask specifics from earlier this semester, but at a minimum you should be familiar with: - user mode and kernel mode distinction - what a system call is - general concept behind a process and a thread - race conditions and how to prevent them (through locks)

4. Chapter 6 Distinction between CPU-bound and IO-bound tasks General idea of what a scheduling algorithm is Some major concepts – Starvation – Preemptive and non-preemptive Scheduling algorithms – FCFS – SJF scheduling – Priority scheduling – Round robin scheduling You can skip section 6.4 and after

5. Chapter 7 General concept of deadlock – What is a deadlock situation – How it can happen Methods for handling deadlocks – Prevention and avoidance – Detect and recover – Ignore General deadlock prevention Ideas You can skip section 7.5 and after

6. Chapter 8 General concept behind memory management and translation of logical to physical addresses Memory management schemas – Contiguous memory allocation Fragmentation – Non-contiguous memory allocation: segmentation, paging Paging: – Page number/offset – Role of page table and TLB You can skip section 8.6 and after

7. Chapter 9 Benefits of virtual memory. Why virtual memory Demand paging Copy on write Page replacement algorithms (FIFO, Optimal, LRU). For this section, you can skip 9.4.5 and after Global vs local page replacement algorithms Working set and concept of locality of reference Skip sections 9.7 and after

8. Chapter 11, 12 General concept of File and File system File locking Sequential vs direct (random) access Benefits of VFS Directory implementation Cover only sections 11.1, 11.2, 11.3, 12.1, 12.2, 12.3

9. Exercise Exercise 6.16 Exercise 9.21