Add the rest of university notes

docs/lectures/osc/17_file_systems3.md

@@ -56,17 +56,17 @@ To avoid external fragmentation, files are stored in **separate blocks** that ar
 > * **Random access is very slow**, to retrieve a block in the middle, one has to walk through the list from the start
 > * There is some **internal fragmentation** - on average the last half of the block is left unused
 >   * Internal fragmentation will reduce for **smaller block sizes**
->   * However **larger blocks** will be **faster**
+>   * However, **larger blocks** will be **faster**
 > * Space for data is lost within the blocks due to the pointer, the data in a **block is no longer a power of 2**
 > * **Diminished reliability**: if one block is corrupted/lost, access to the rest of the file is lost.
 
-![Linked list file storage](/lectures/osc/assets/b8.png)
+![Linked list file storage](assets/b8.png)
 
 ##### File Allocation Tables
 
 * Store the linked-list pointers in a **separate index table** called a **file allocation table** in memory.
 
-![FAT](/lectures/osc/assets/b9.png)
+![FAT](assets/b9.png)
 
 > **Advantages**
 >
@@ -88,4 +88,4 @@ Each file has a small data structure (on disk) called an **I-node** (index-node)
 
 I-nodes are composed of **direct block pointers** (usually 10) **indirect block pointers** or a combination thereof.
 
-![I-nodes](/lectures/osc/assets/c1.png)
+![I-nodes](assets/c1.png)