Basics	Processes	Scheduling	Synchronization	Memory Management
Define Kernel	Define program	Describe FIFO	Deadlock: good or bad?	Do page
Define a RTOS	Define process	Where do processes go after they leave the ready queue?	Name a way to prevent deadlock.	Where is virtual address 3002 in physical ram?
Define a Shell	Define thread	Give one reason why the time quantum for a scheduler should be long.	Name another.	What fields must be present in a standard inverted page table?
Why do we want to operlap computation and I/O?	List three things that must be done at context swict time?	Give one reason why the time quantum for a scheduler should be long.	To acquire a lock, do you wait() or signal().	Do applications refernce memory using physical addresses or virtual addresses?
What is the fastest storage in a modern computer?	How many processes are normally active on an idle UNIX box?	Which scheduling startegy is provably optimal at reducing wait times?	Can a process be in deadlock with just itself.	Which requires more hardware support, normal page tables or inverted page tables?
Should reading the clock timer be a privliged instruction?	What is the "scheduling paradox?"	Which scheduling startegy do RTOS's use?	Can signal and wait be implemented without using the cpu instructions test-and-set or swap?	What determines how many page table entries you need with an inverted page table?
Should changing the CMOs be a privliged instruction?	Name one thing that must be done in a context swicth between processes that can be skipped between threads.	For shortest process first, what are two ways to determine the shortest process	What interrupt should be waited for using busy waiting?	Which is fatsre, normal page tables or inverted page tables?

Normnal Page Table:

3

2

3

4

17

5

Inverted Page table