Add the rest of university notes

docs/lectures/osc/03_processes4.md

@@ -10,7 +10,7 @@
 
 Exam 2013: Explain how you would prevent starvation in a priority queue algorithm?
 
-![alt text](/lectures/osc/assets/h.png)
+![alt text](assets/h.png)
 
 The solution to this is to momentarily boost thread A's priority level, this will let A do what it what's to do and release resource X so that B and C can run. 
 
@@ -38,9 +38,9 @@ Feedback queues are highly configurable and offer significant flexibility.
 
 
 
-![alt text](/lectures/osc/assets/i.png)
+![alt text](assets/I.png)
 
-![alt text](/lectures/osc/assets/j.png)
+![alt text](assets/j.png)
 
 If you give a couple of the threads the highest priority level, you can freeze your computer. (causes starvation for low priority threads)
 
@@ -81,7 +81,7 @@ Both ways *cannot* guarantee hard deadlines.
 
 A **weighting scheme** is used to take difference priorities into account.
 
-<img src="/lectures/osc/assets/k.png" alt="alt text" style="zoom:60%;" />
+<img src="assets/k.png" alt="alt text" style="zoom:60%;" />
 
 The tasks with the **lowest proportional amount** of "used CPU time" are selected first. (Shorter tasks picked first if Wi is the same).
 
@@ -115,9 +115,9 @@ Windows will allocate the **highest priority threads** to the individual CPUs/co
 >
 > **Unrelated** processes threads that are **independent**, possibly started by **different users** running different programs.
 
-![alt text](/lectures/osc/assets/l.png)
+![alt text](assets/L.png)
 
-Threads belong to the same process are are cooperating e.g. they **exchange messages** or **share information**
+Threads belong to the same process are cooperating e.g. they **exchange messages** or **share information**
 
 The aim is to get threads running as much as possible, at the **same time across multiple CPU**s.