Add the rest of university notes

docs/lectures/osc/14_mem_management6.md

@@ -21,7 +21,7 @@
 > * It is faster, but can still be **slow if the list is long**.
 > * The **time spent** on **maintaining** the list is **reduced**.
 
-![clock replacement](/lectures/osc/assets/a2.png)
+![clock replacement](assets/a2.png)
 
 ##### Not Recently Used (NRU)
 
@@ -54,7 +54,7 @@
 >
 > This algorithm can be **implemented in hardware** using a **counter** that is incremented after each instruction ...
 
-![least used recently visualisation](/lectures/osc/assets/a3.png)
+![least used recently visualisation](assets/a3.png)
 
 This will look familiar to the FIFO algorithm however, when a page is used, that is like its just come in.
 
@@ -88,7 +88,7 @@ The **working set** is a subset of the resident set that is actually needed for
   * The set of pages used within a pre-specified time interval
 * The **working set size** can be used as a guide for the number of frames that should be allocated to a process.
 
-![working set](/lectures/osc/assets/a4.png)
+![working set](assets/a4.png)
 
 The working set is a **function of time** $t$:
 
@@ -96,9 +96,11 @@ The working set is a **function of time** $t$:
 * **Stable** intervals alternate with intervals of **rapid change**
 
 $|W(t,k)|$ is then a variable in time. Specifically:
+
 $$
 1\le |W(t,k)| \le min(k, N)
 $$
+
 where $N$ is the total number of pages of the process. All the maths is saying is that the size of the working set can be as small as **one** or as large as **all the pages in the process**.
 
 Choosing the right value for $k$ is important: