Operating Systems course guide To follow along with "Three Easy Pieces"

An OS in general aims to deliver transparency, efficiency, fairness and protection. Explain how this is achieved in regards to running processes on the CPU. Key things: direct execution, timer interrupts, context switch

Explain the various statuses that a process can be in, and what transitions are possible

Explain what the context switch is and what needs to happen during it

Explain what limited direct execution is

Describe at a high level how system calls are made, and why we need something like that

Discuss the different scheduling algorithms and what the advantages and disadvantages of each are.

Be able to work out specific example of process scheduling for a given algorithm. (FIFO, SJF, STCF, RR, MLFQ)

What are different metric we can use to evaluate the performance of a scheduling algorithm? When would each metric be suitable.

What are the 5 rules for the MLFQ? What is the importance of each rule?

An OS in general aims to deliver transparency, efficiency, fairness and protection. Explain how this is achieved in regards to memory management. Key things: address spaces, virtual memory, page tables, TLB cache.

Describe the basic idea of address translation in general and more concretely for the various approaches to VM set up (basic base and bounds, segmentation, paging). Be able to translate a virtual address to a physical address in each case.

Be able to describe the concepts of external fragmentation, internal fragmentation, spacial locality and temporal locality, their significance, and the effect that different VM approaches have to them.

Explain how TLBs work and how they can help make paging efficient.

Be able to work with a basic multi-level page table example