Add the rest of university notes

docs/lectures/osc/16_file_systems2.md

@@ -79,7 +79,7 @@ Retrieving a file comes down to **searching the directory file** as fast as poss
 * Indexes or **hash tables** can be used.
 * They can store all **file related attributes** (file name, disk address - Windows) or they can **contain a pointer** to the data structure that contains the details of the file (Unix)
 
-![directory files](/lectures/osc/assets/b2.png)
+![directory files](assets/b2.png)
 
 ##### System Calls
 
@@ -140,9 +140,9 @@ Disks are usually divided into **multiple partitions**
 > * **Root directory**: the top of the file-system tree
 > * **Data**: files and directories
 
-![unix partition composition](/lectures/osc/assets/b4.png)
+![unix partition composition](assets/b4.png)
 
-![Free block management](/lectures/osc/assets/b5.png)
+![Free block management](assets/b5.png)
 
 Free space management with linked list (on the left) and bitmaps (on the right)
 
@@ -163,9 +163,9 @@ Apart from the free space memory tables, there is a number of key data structure
 * A **system-wide open file table**, containing a copy of the FCB for every currently open file in the system, including location on disk, file size and **open count** (number of processes that use the file)
 * A **per-process open file table**, containing a pointer to the system open file table.
 
-![file tables](/lectures/osc/assets/b6.png)
+![file tables](assets/b6.png)
 
-![opening & reading a file](/lectures/osc/assets/b7.png)
+![opening & reading a file](assets/b7.png)