Week 3

Question 1

What is LRU/LFU?

Answer 1

Least Recently/Frequently Used - The most recently requested page is replaced

Question 2

What is FIFO?

Answer 2

First In First Out - The element that has been inside the frame the longest is replaced

Question 3

What is Belady’s Anomaly?

Answer 3

An occurence where some page replacement algiorithms have an increasing number of hard faults/page faults as the number of frames increases.

Question 4

What is single-processing?

Answer 4

one process in memory at any time. It is easy to implement - it either fits or it doesn’t.

Question 5

What is multi-processing?

Answer 5

multiple processes in memory at the same time.

Question 6

What is swapping?

Answer 6

allows computer rapidly “swap” its CPU between the process by loading and unloading them into/from memory.

Question 7

What is a process table?

Answer 7

contains entries called Process Control Blocks. It contains data such as process state and process ID, program counter, memory address of the Page Table, resources in-used/needed, etc.

Question 8

What is cache memory?

Answer 8

is small and stores only active pages. It is searched first for page number. If not found, search then goes to the page table in conventional memory.